{"created":"2023-06-20T14:00:46.254249+00:00","id":6890,"links":{},"metadata":{"_buckets":{"deposit":"4495bef6-833b-4897-9403-85e4d7647402"},"_deposit":{"created_by":2,"id":"6890","owners":[2],"pid":{"revision_id":0,"type":"depid","value":"6890"},"status":"published"},"_oai":{"id":"oai:hokkyodai.repo.nii.ac.jp:00006890","sets":["6:614"]},"author_link":["27320","27321","27318","27319"],"item_6_alternative_title_14":{"attribute_name":"その他のタイトル","attribute_value_mlt":[{"subitem_alternative_title":"Global Optimization Algorithms based on Multi-Start Local Search (3) : Study and Examples of Mathematical Structures around each Local Minimum and Stationary Point, and Proposing Multistart Local Search with Limited Step Size"}]},"item_6_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2020-02","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicPageEnd":"32","bibliographicPageStart":"19","bibliographicVolumeNumber":"70","bibliographic_titles":[{"bibliographic_title":"北海道教育大学紀要. 自然科学編"}]}]},"item_6_description_3":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"First, we show a classification of optimal solutions and an example of an continuous optimization problem with Morse function and bound constrains. Next, we investigate and demonstrate mathematical structures: (unimodal region, strictly convex reigon, region of attraction, etc.) around each local minimum. Finally, we propose a multistart local search method with limited step size, and show a comparative study between a previous local search method and proposed local search method.","subitem_description_type":"Abstract"}]},"item_6_full_name_2":{"attribute_name":"著者別名","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"27320","nameIdentifierScheme":"WEKO"}],"names":[{"name":"KANEMITSU, Hideo"}]},{"nameIdentifiers":[{"nameIdentifier":"27321","nameIdentifierScheme":"WEKO"}],"names":[{"name":"MIYAMOTO, Nagisa"}]}]},"item_6_identifier_registration":{"attribute_name":"ID登録","attribute_value_mlt":[{"subitem_identifier_reg_text":"10.32150/00006884","subitem_identifier_reg_type":"JaLC"}]},"item_6_publisher_15":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"北海道教育大学"}]},"item_6_source_id_7":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"13442570","subitem_source_identifier_type":"ISSN"}]},"item_6_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11273226","subitem_source_identifier_type":"NCID"}]},"item_6_version_type_12":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"金光, 秀雄"}],"nameIdentifiers":[{"nameIdentifier":"27318","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"宮本, 凪沙"}],"nameIdentifiers":[{"nameIdentifier":"27319","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2022-12-01"}],"displaytype":"detail","filename":"70-2-c03.pdf","filesize":[{"value":"58.2 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"70-2-c03.pdf","url":"https://hokkyodai.repo.nii.ac.jp/record/6890/files/70-2-c03.pdf"},"version_id":"3b691877-59b0-40ed-8221-c295ecf0caa5"}]},"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":"多点局所探索に基づく大域的最適化アルゴリズム(3) : 局小・停留点の周辺数理構造の検討・例示とステップ幅制限多点局所探索法の提案","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"多点局所探索に基づく大域的最適化アルゴリズム(3) : 局小・停留点の周辺数理構造の検討・例示とステップ幅制限多点局所探索法の提案"}]},"item_type_id":"6","owner":"2","path":["614"],"pubdate":{"attribute_name":"公開日","attribute_value":"2020-04-10"},"publish_date":"2020-04-10","publish_status":"0","recid":"6890","relation_version_is_last":true,"title":["多点局所探索に基づく大域的最適化アルゴリズム(3) : 局小・停留点の周辺数理構造の検討・例示とステップ幅制限多点局所探索法の提案"],"weko_creator_id":"2","weko_shared_id":-1},"updated":"2023-06-20T14:43:00.812492+00:00"}