{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T19:26:52Z","timestamp":1783625212894,"version":"3.55.0"},"reference-count":27,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872281"],"award-info":[{"award-number":["61872281"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472297"],"award-info":[{"award-number":["61472297"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Patt. Recogn. Artif. Intell."],"published-print":{"date-parts":[[2020,4]]},"abstract":"<jats:p> Currently, there are four drawbacks for filled function methods: (1) too many local optimal solutions result in huge difficulty to search global optimal solutions; (2) difficult to control the parameter(s); (3) difficult to determine the initial point for minimization of filled function; (4) the shallow basins will affect the solution precision during the minimization of the filled function. To overcome these drawbacks, in this paper, we adopt a flatten function to eliminate many local optimal solutions first, and then a new filled function with one parameter is proposed, and its parameter is easy to control. Furthermore, we propose an efficient method for determining initial point of the filled function by using adaptive step size. Moreover, when some basins of the filled function are shallow ones, it will result in inefficiency of searching these basins during the minimization of the filled function. To tackle this issue and make the search for global optimal solutions much easier, we propose a strategy of basin deepening. By integrating these schemes, we propose a new efficient filled flatten function method. Numerical results indicate the efficiency and effectiveness of the proposed filled function methods. <\/jats:p>","DOI":"10.1142\/s0218001420590119","type":"journal-article","created":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T09:28:35Z","timestamp":1559899715000},"page":"2059011","source":"Crossref","is-referenced-by-count":9,"title":["A Filled Flatten Function Method Based on Basin Deepening and Adaptive Initial Point for Global Optimization"],"prefix":"10.1142","volume":"34","author":[{"given":"Junhua","family":"Liu","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Xidian University, Xi\u2019an 710071, P.\u00a0R.\u00a0China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6868-0004","authenticated-orcid":false,"given":"Yuping","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xidian University, Xi\u2019an 710071, P.\u00a0R.\u00a0China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shiwei","family":"Wei","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xidian University, Xi\u2019an 710071, P.\u00a0R.\u00a0China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xin","family":"Sui","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xidian University, Xi\u2019an 710071, P.\u00a0R.\u00a0China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wuning","family":"Tong","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xidian University, Xi\u2019an 710071, P.\u00a0R.\u00a0China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2019,8,7]]},"reference":[{"key":"S0218001420590119BIB001","doi-asserted-by":"publisher","DOI":"10.1126\/science.276.5315.1094"},{"key":"S0218001420590119BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/BF00940781"},{"key":"S0218001420590119BIB003","doi-asserted-by":"publisher","DOI":"10.1109\/4235.985692"},{"key":"S0218001420590119BIB004","doi-asserted-by":"publisher","DOI":"10.1126\/science.267.5198.664"},{"key":"S0218001420590119BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2015.08.091"},{"issue":"3","key":"S0218001420590119BIB006","first-page":"1","volume":"37","author":"Feng Z. G.","year":"2018","journal-title":"Circuits Syst. Signal Process."},{"key":"S0218001420590119BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2015.06.090"},{"key":"S0218001420590119BIB008","doi-asserted-by":"publisher","DOI":"10.1007\/BF00939433"},{"key":"S0218001420590119BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-018-1145-y"},{"key":"S0218001420590119BIB010","doi-asserted-by":"publisher","DOI":"10.1109\/4235.910464"},{"key":"S0218001420590119BIB011","doi-asserted-by":"publisher","DOI":"10.1137\/0906002"},{"key":"S0218001420590119BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2011.09.022"},{"key":"S0218001420590119BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2012.10.035"},{"key":"S0218001420590119BIB014","doi-asserted-by":"publisher","DOI":"10.1007\/s40314-016-0407-8"},{"key":"S0218001420590119BIB015","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2017.1283021"},{"key":"S0218001420590119BIB016","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585737"},{"issue":"1","key":"S0218001420590119BIB017","first-page":"176","volume":"191","author":"Shang Y.-L.","year":"2007","journal-title":"Appl. Math. Comput."},{"issue":"4","key":"S0218001420590119BIB018","first-page":"670","volume":"29","author":"Wang Y.","year":"2006","journal-title":"Chin. J. Comput."},{"key":"S0218001420590119BIB019","doi-asserted-by":"publisher","DOI":"10.1109\/NSS.2010.92"},{"key":"S0218001420590119BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2008.04.019"},{"key":"S0218001420590119BIB021","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2008.07.001"},{"key":"S0218001420590119BIB022","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-013-0515-1"},{"issue":"2","key":"S0218001420590119BIB023","first-page":"385","volume":"10","author":"Wei F.","year":"2014","journal-title":"Pacific J. Optim."},{"key":"S0218001420590119BIB024","doi-asserted-by":"publisher","DOI":"10.1109\/21.44040"},{"key":"S0218001420590119BIB025","doi-asserted-by":"publisher","DOI":"10.1109\/4235.771163"},{"key":"S0218001420590119BIB026","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOGO.0000006653.60256.f6"},{"key":"S0218001420590119BIB027","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2008.10.015"}],"container-title":["International Journal of Pattern Recognition and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218001420590119","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T10:50:49Z","timestamp":1588935049000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218001420590119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,7]]},"references-count":27,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["10.1142\/S0218001420590119"],"URL":"https:\/\/doi.org\/10.1142\/s0218001420590119","relation":{},"ISSN":["0218-0014","1793-6381"],"issn-type":[{"value":"0218-0014","type":"print"},{"value":"1793-6381","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,7]]}}}