{"created":"2021-03-01T07:04:34.403754+00:00","id":26365,"links":{},"metadata":{"_buckets":{"deposit":"1bad7013-125b-44bc-8781-25cc356dd0aa"},"_deposit":{"created_by":188,"id":"26365","owners":[188],"pid":{"revision_id":0,"type":"depid","value":"26365"},"status":"published"},"_oai":{"id":"oai:tsukuba.repo.nii.ac.jp:00026365","sets":["152:2152","3:2658:2662"]},"author_link":["90941","687"],"item_11_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2011-11","bibliographicIssueDateType":"Issued"}}]},"item_11_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"We call a positive semidefinite matrix whose elements are nonnegative a doubly nonnegative\nmatrix, and the set of those matrices the doubly nonnegative cone (DNN cone). The DNN cone\nis not symmetric but can be represented as the projection of a symmetric cone embedded in a\nhigher dimension. In [16], the authors demonstrated the efficiency of the DNN relaxation using\nthe symmetric cone representation of the DNN cone. They showed that the DNN relaxation gives\nsignificantly tight bounds for a class of quadratic assignment problems, but the computational time\nis not affordable as long as we employ the symmetric cone representation. They then suggested a\nprimal barrier function approach for solving the DNN optimization problem directly, instead of using\nthe symmetric cone representation. However, most of existing studies on the primal barrier function\napproach assume the availability of a feasible interior point. This fact means that those studies are\nnot inextricably tied to the practical usage. Motivated by these observations, we propose a primal\nbarrier function Phase I algorithm for solving conic optimization problems over the closed convex\ncone K having the following properties: (a) K is not necessarily symmetric, (b) a self-concordant\nfunction f is defined over intK, and (c) its dual cone K? is not explicit or is intractable, all of which\nare observed when K is the DNN cone. We analyze the algorithm and provide a sufficient condition\nfor finite termination.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_11_description_5":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"Revised March 2012","subitem_description_type":"Other"}]},"item_11_publisher_27":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"University of Tsukuba. Graduate School of Systems and Information Engineering. Doctoral Program in Social Systems & Management","subitem_publisher_language":"en"}]},"item_11_relation_36":{"attribute_name":"シリーズ","attribute_value_mlt":[{"subitem_relation_name":[{"subitem_relation_name_language":"en","subitem_relation_name_text":"Department of Social Systems and Management Discussion Paper Series;no.1284"}]}]},"item_access_right":{"attribute_name":"アクセス権","attribute_value_mlt":[{"subitem_access_right":"open access","subitem_access_right_uri":"http://purl.org/coar/access_right/c_abf2"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"MATSUKAWA, Yasuaki","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"吉瀬, 章子","creatorNameLang":"ja"},{"creatorName":"ヨシセ, アキコ","creatorNameLang":"ja-Kana"},{"creatorName":"YOSHISE, Akiko","creatorNameLang":"en"}],"nameIdentifiers":[{},{},{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2013-12-25"}],"displaytype":"detail","filename":"1284.pdf","filesize":[{"value":"433.3 kB"}],"format":"application/pdf","mimetype":"application/pdf","url":{"objectType":"fulltext","url":"https://tsukuba.repo.nii.ac.jp/record/26365/files/1284.pdf"},"version_id":"b682ccd9-0d90-4c53-9ece-653b3ea8a6c2"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"technical report","resourceuri":"http://purl.org/coar/resource_type/c_18gh"}]},"item_title":"A Primal Barrier Function Phase I Algorithm for Nonsymmetric Conic Optimization Problems","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A Primal Barrier Function Phase I Algorithm for Nonsymmetric Conic Optimization Problems","subitem_title_language":"en"}]},"item_type_id":"11","owner":"188","path":["2152","2662"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2012-02-22"},"publish_date":"2012-02-22","publish_status":"0","recid":"26365","relation_version_is_last":true,"title":["A Primal Barrier Function Phase I Algorithm for Nonsymmetric Conic Optimization Problems"],"weko_creator_id":"188","weko_shared_id":-1},"updated":"2024-03-21T04:13:45.470707+00:00"}