{"created":"2023-06-19T10:35:13.144534+00:00","id":1168,"links":{},"metadata":{"_buckets":{"deposit":"943ee919-34d2-4f17-ac0b-bb2f293aade8"},"_deposit":{"created_by":14,"id":"1168","owners":[14],"pid":{"revision_id":0,"type":"depid","value":"1168"},"status":"published"},"_oai":{"id":"oai:ous.repo.nii.ac.jp:00001168","sets":["296:314:329"]},"author_link":["11776","11777"],"item_1_biblio_info_14":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1996-03-31","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"368","bibliographicPageStart":"359","bibliographicVolumeNumber":"31","bibliographic_titles":[{"bibliographic_title":"岡山理科大学紀要. A, 自然科学","bibliographic_titleLang":"ja"},{"bibliographic_title":"Bulletin of Okayama University of Science. A, Natural Sciences","bibliographic_titleLang":"en"}]}]},"item_1_creator_6":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"三上, 昭治","creatorNameLang":"ja"},{"creatorName":"ミカミ, ショウジ","creatorNameLang":"ja-Kana"},{"creatorName":"Mikami, Shoji","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"11776","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"成久, 洋之","creatorNameLang":"ja"},{"creatorName":"ナリヒサ, ヒロユキ","creatorNameLang":"ja-Kana"},{"creatorName":"Narihisa, Hiroyuki","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"11777","nameIdentifierScheme":"WEKO"}]}]},"item_1_description_1":{"attribute_name":"ページ属性","attribute_value_mlt":[{"subitem_description":"P(論文)","subitem_description_type":"Other"}]},"item_1_description_12":{"attribute_name":"抄録(英)","attribute_value_mlt":[{"subitem_description":"Simplex method for solving linear programming problem is most used and efficient procedure. After G.B. Dantzig first proposed his original simplex method, a lot of improved methods have been developed. Recently, besides those simplex-like procedures, iteration method have been investigated as an approximate solution for a large scale linear programming problem along with inner point method. Especially speaking, these iterative methods are attractive in a point of vectorization or parallelism of computer procedure. In this paper, we propose a scaled gradient projection algorithm which guarantees the efficient polynomial convergence and also investigate into the possibility of its parallel procedure.","subitem_description_language":"en","subitem_description_type":"Other"}]},"item_1_source_id_13":{"attribute_name":"雑誌書誌ID","attribute_value_mlt":[{"subitem_source_identifier":"AN00033244","subitem_source_identifier_type":"NCID"}]},"item_1_text_10":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_language":"en","subitem_text_value":"Graduate School of Engineering, Okayama University of Science"},{"subitem_text_language":"en","subitem_text_value":"Department of Information and Computer Engineering, Faculty of Engineering, Okayama University of Science"}]},"item_1_text_9":{"attribute_name":"著者所属(日)","attribute_value_mlt":[{"subitem_text_language":"ja","subitem_text_value":"岡山理科大学大学院工学研究科"},{"subitem_text_language":"ja","subitem_text_value":"岡山理科大学工学部情報工学科"}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"1996-03-31"}],"displaytype":"detail","filename":"KJ00000063677.pdf","filesize":[{"value":"307.9 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"url":"https://ous.repo.nii.ac.jp/record/1168/files/KJ00000063677.pdf"},"version_id":"d94c93df-4641-4f27-8834-080e6f1a984e"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"線形相補性問題に対する勾配投影法について","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"線形相補性問題に対する勾配投影法について","subitem_title_language":"ja"},{"subitem_title":"A Gradient Projection Algorithm for Linear Complementarity Problems","subitem_title_language":"en"},{"subitem_title":"センケイ ソウホセイ モンダイ ニ タイスル コウバイ トウエイホウ ニツイテ","subitem_title_language":"ja-Kana"}]},"item_type_id":"1","owner":"14","path":["329"],"pubdate":{"attribute_name":"PubDate","attribute_value":"1996-03-31"},"publish_date":"1996-03-31","publish_status":"0","recid":"1168","relation_version_is_last":true,"title":["線形相補性問題に対する勾配投影法について"],"weko_creator_id":"14","weko_shared_id":-1},"updated":"2023-09-28T04:56:52.404692+00:00"}