{"created":"2023-06-20T15:03:19.007453+00:00","id":1372,"links":{},"metadata":{"_buckets":{"deposit":"972f8a67-fbb3-48c3-a0c5-b70d964859e1"},"_deposit":{"created_by":16,"id":"1372","owners":[16],"pid":{"revision_id":0,"type":"depid","value":"1372"},"status":"published"},"_oai":{"id":"oai:grips.repo.nii.ac.jp:00001372","sets":["52:53"]},"author_link":["7866","7865"],"item_10002_biblio_info_31":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1989-11","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"B-5","bibliographicVolumeNumber":"89","bibliographic_titles":[{"bibliographic_title":"Institute for Policy Science research report. B","bibliographic_titleLang":"en"}]}]},"item_10002_description_29":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"As a natural extension of Roos and Vial's \"Long steps with logarithmic penalty barrier function in llnear programming\" (1989) and Ye's \"An O(n³L) potential reduction algorithm for linear programming\" (1989), it will be shown that the classical logarithmic barrier function method can be adjusted so that it generates the optimal solution in O(√nL) iterations, where n is the number of variables and L is the data length.","subitem_description_type":"Abstract"}]},"item_10002_full_name_27":{"attribute_name":"著者別名","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"7866","nameIdentifierScheme":"WEKO"}],"names":[{"name":"刀根, 薫","nameLang":"ja"}]}]},"item_10002_link_46":{"attribute_name":"著者情報","attribute_value_mlt":[{"subitem_link_text":"https://www.grips.ac.jp/list/facultyinfo/tone_kaoru/","subitem_link_url":"https://www.grips.ac.jp/list/facultyinfo/tone_kaoru/"}]},"item_10002_publisher_32":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"Technology Policy Science, Saitama Univ","subitem_publisher_language":"en"}]},"item_10002_version_type_42":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_ab4af688f83e57aa","subitem_version_type":"AM"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"TONE, Kaoru","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"7865","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","filename":"89-B-5.pdf","filesize":[{"value":"402.1 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"89-B-5.pdf","url":"https://grips.repo.nii.ac.jp/record/1372/files/89-B-5.pdf"},"version_id":"2ae0f8e0-7c47-4013-a261-e25edfd16202"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"Linear programming","subitem_subject_scheme":"Other"},{"subitem_subject":"interior point algorithm","subitem_subject_scheme":"Other"},{"subitem_subject":"barrier function","subitem_subject_scheme":"Other"},{"subitem_subject":"potential function","subitem_subject_scheme":"Other"},{"subitem_subject":"primal and dual","subitem_subject_scheme":"Other"},{"subitem_subject":"complexity","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"An O(√nL) Iteration Large-Step Logarithmic Barrier Function Algorithm for Linear Programming","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"An O(√nL) Iteration Large-Step Logarithmic Barrier Function Algorithm for Linear Programming","subitem_title_language":"en"}]},"item_type_id":"10002","owner":"16","path":["53"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2016-04-13"},"publish_date":"2016-04-13","publish_status":"0","recid":"1372","relation_version_is_last":true,"title":["An O(√nL) Iteration Large-Step Logarithmic Barrier Function Algorithm for Linear Programming"],"weko_creator_id":"16","weko_shared_id":-1},"updated":"2023-12-14T04:14:56.538065+00:00"}