{"created":"2021-03-01T07:17:42.015870+00:00","id":38509,"links":{},"metadata":{"_buckets":{"deposit":"dee6b9f0-6d6e-48c0-b12f-a74d52ee8b4e"},"_deposit":{"id":"38509","owners":[],"pid":{"revision_id":0,"type":"depid","value":"38509"},"status":"published"},"_oai":{"id":"oai:tsukuba.repo.nii.ac.jp:00038509","sets":["152:2148","3:62:5298:2023"]},"item_5_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2016-06","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicPageEnd":"555","bibliographicPageStart":"535","bibliographicVolumeNumber":"64","bibliographic_titles":[{"bibliographic_title":"Computational optimization and applications"}]}]},"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":"In this paper, we refine the proof of convergence by Kuno–Buckland (J Global Optim 52:371–390, 2012) for the simplicial algorithm with ω-subdivision and generalize their ω-bisection rule to establish a class of subdivision rules, called ω-k-section, which bounds the number of subsimplices generated in a single execution of subdivision by a prescribed number k. We also report some numerical results of comparing the ω-k-section rule with the usual ω-subdivision rule.","subitem_description_type":"Abstract"}]},"item_5_publisher_27":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"Springer US"}]},"item_5_relation_11":{"attribute_name":"DOI","attribute_value_mlt":[{"subitem_relation_type_id":{"subitem_relation_type_id_text":"10.1007/s10589-015-9817-6","subitem_relation_type_select":"DOI"}}]},"item_5_rights_12":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"© Springer Science+Business Media New York 2016"},{"subitem_rights":"The final publication is available at Springer via http://dx.doi.org/10.1007/s10589-015-9817-6"}]},"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":"0926-6003","subitem_source_identifier_type":"ISSN"}]},"item_5_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA10936780","subitem_source_identifier_type":"NCID"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kuno, Takahito"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Ishihama, Tomohiro"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2017-07-01"}],"displaytype":"detail","filename":"COA_64-2.pdf","filesize":[{"value":"164.9 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"COA_64-2","url":"https://tsukuba.repo.nii.ac.jp/record/38509/files/COA_64-2.pdf"},"version_id":"ebf9b80c-307f-4623-a8fe-fd8cc66adef9"}]},"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 generalization of ω -subdivision ensuring convergence of the simplicial algorithm","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A generalization of ω -subdivision ensuring convergence of the simplicial algorithm"}]},"item_type_id":"5","owner":"1","path":["2148","2023"],"pubdate":{"attribute_name":"公開日","attribute_value":"2016-07-12"},"publish_date":"2016-07-12","publish_status":"0","recid":"38509","relation_version_is_last":true,"title":["A generalization of ω -subdivision ensuring convergence of the simplicial algorithm"],"weko_creator_id":"1","weko_shared_id":5},"updated":"2022-04-27T09:08:19.483135+00:00"}