{"created":"2021-03-01T07:27:58.925067+00:00","id":47926,"links":{},"metadata":{"_buckets":{"deposit":"a2e6e1af-5be5-411c-afa5-083d13c24ff0"},"_deposit":{"id":"47926","owners":[],"pid":{"revision_id":0,"type":"depid","value":"47926"},"status":"published"},"_oai":{"id":"oai:tsukuba.repo.nii.ac.jp:00047926","sets":["152:2148","3:62:5592:1846"]},"item_5_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2018-06","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicPageEnd":"311","bibliographicPageStart":"297","bibliographicVolumeNumber":"71","bibliographic_titles":[{"bibliographic_title":"Journal of global optimization "}]}]},"item_5_creator_3":{"attribute_name":"著者別名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"久野, 誉人"}],"nameIdentifiers":[{},{},{}]}]},"item_5_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"The simplicial algorithm is a popular branch-and-bound approach to the convex maximization problem with multiple local maxima. In this paper, we discuss some difficulties revealed when implementing this algorithm under the ω-subdivision rule. To overcome those, we modify the bounding process and extend the ω-subdivision rule. We also report numerical results for the simplicial algorithm according to the new subdivision rule.","subitem_description_type":"Abstract"}]},"item_5_publisher_27":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"Springer"}]},"item_5_relation_11":{"attribute_name":"DOI","attribute_value_mlt":[{"subitem_relation_type_id":{"subitem_relation_type_id_text":"10.1007/s10898-018-0619-0","subitem_relation_type_select":"DOI"}}]},"item_5_rights_12":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"© Springer Science+Business Media, LLC, part of Springer Nature 2018"},{"subitem_rights":"This is a pre-print of an article published in　Journal of global optimization. The final authenticated version is available online at: https://doi.org/10.1007/s10898-018-0619-0"}]},"item_5_select_15":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_select_item":"author"}]},"item_5_source_id_7":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"0925-5001","subitem_source_identifier_type":"ISSN"}]},"item_5_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA10831465 ","subitem_source_identifier_type":"NCID"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kuno, Takahito"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2019-07-01"}],"displaytype":"detail","filename":"JGO_71-2.pdf","filesize":[{"value":"119.3 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"JGO_71-2","url":"https://tsukuba.repo.nii.ac.jp/record/47926/files/JGO_71-2.pdf"},"version_id":"ad90c788-659d-44c5-b215-6c2db5fe5616"}]},"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":"A modified simplicial algorithm for convex maximization based on an extension of ω -subdivision","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A modified simplicial algorithm for convex maximization based on an extension of ω -subdivision"}]},"item_type_id":"5","owner":"1","path":["2148","1846"],"pubdate":{"attribute_name":"公開日","attribute_value":"2018-09-28"},"publish_date":"2018-09-28","publish_status":"0","recid":"47926","relation_version_is_last":true,"title":["A modified simplicial algorithm for convex maximization based on an extension of ω -subdivision"],"weko_creator_id":"1","weko_shared_id":5},"updated":"2022-04-27T09:18:08.217476+00:00"}