{"created":"2023-06-20T13:00:02.180924+00:00","id":4106,"links":{},"metadata":{"_buckets":{"deposit":"afafdb81-c999-4bc4-9a1c-ab5d305483d3"},"_deposit":{"created_by":2,"id":"4106","owners":[2],"pid":{"revision_id":0,"type":"depid","value":"4106"},"status":"published"},"_oai":{"id":"oai:fun.repo.nii.ac.jp:00004106","sets":["22:28","25:81:102"]},"author_link":["79","7379"],"item_5_biblio_info_5":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2007","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicPageEnd":"522","bibliographicPageStart":"504","bibliographicVolumeNumber":"21","bibliographic_titles":[{"bibliographic_title":"SIAM Journal on Discrete Mathematics"}]}]},"item_5_description_3":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"「離散凸解析」における「（拡張された）M凸関数」に対する最小化アルゴリズムを高速化した論文である。以前の論文では、適当な初期点から始め、「局所的」に見て最も関数値が減少する点への移動を繰り返すことで最小点へ到達したが、本論文では、最小点の存在する領域を一定の手続きで絞り込むことによってより高速に最小点に到達できることを示した。","subitem_description_type":"Abstract"}]},"item_5_publisher_17":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"Society for Indusctial and Applied Mathematics"}]},"item_5_select_10":{"attribute_name":"単著共著","attribute_value_mlt":[{"subitem_select_item":"共著/joint"}]},"item_5_select_8":{"attribute_name":"査読有無","attribute_value_mlt":[{"subitem_select_item":"あり/yes"}]},"item_5_select_9":{"attribute_name":"研究業績種別","attribute_value_mlt":[{"subitem_select_item":"原著論文/Original Paper"}]},"item_access_right":{"attribute_name":"アクセス権","attribute_value_mlt":[{"subitem_access_right":"metadata only access","subitem_access_right_uri":"http://purl.org/coar/access_right/c_14cb"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Shioura, Akiyoshi"}],"nameIdentifiers":[{"nameIdentifier":"7379","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Tanaka, Ken'ichiro"}],"nameIdentifiers":[{"nameIdentifier":"79","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"70610640","nameIdentifierScheme":"e-Rad","nameIdentifierURI":"https://kaken.nii.ac.jp/ja/search/?qm=70610640"},{"nameIdentifier":"0000-0003-0359-0969","nameIdentifierScheme":"ORCIDID","nameIdentifierURI":"https://orcid.org/0000-0003-0359-0969"}]}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems"}]},"item_type_id":"5","owner":"2","path":["28","102"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-06-29"},"publish_date":"2011-06-29","publish_status":"0","recid":"4106","relation_version_is_last":true,"title":["Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems"],"weko_creator_id":"2","weko_shared_id":-1},"updated":"2023-06-20T13:31:09.323953+00:00"}