{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T18:27:34Z","timestamp":1772130454875,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,7,28]],"date-time":"2018-07-28T00:00:00Z","timestamp":1532736000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100005989","name":"Ministrstvo za Izobra\u017eevanje, Znanost in \u0160port","doi-asserted-by":"publisher","award":["P2-0246"],"award-info":[{"award-number":["P2-0246"]}],"id":[{"id":"10.13039\/501100005989","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s11590-018-1306-2","type":"journal-article","created":{"date-parts":[[2018,7,28]],"date-time":"2018-07-28T06:52:17Z","timestamp":1532760737000},"page":"1011-1025","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["The Nelder\u2013Mead simplex algorithm with perturbed centroid for high-dimensional function optimization"],"prefix":"10.1007","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4416-5432","authenticated-orcid":false,"given":"Iztok","family":"Fajfar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c1rp\u00e1d","family":"B\u0171rmen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janez","family":"Puhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,28]]},"reference":[{"key":"1306_CR1","unstructured":"Blum, A., Hopcroft, J., Kannan, R.: Foundations of Data Science. Unpublished (2017) \n                    https:\/\/www.cs.cornell.edu\/jeh\/book.pdf"},{"issue":"11","key":"1306_CR2","doi-asserted-by":"publisher","first-page":"2257","DOI":"10.1007\/s00500-010-0650-7","volume":"15","author":"A Duarte","year":"2011","unstructured":"Duarte, A., Mart\u00ed, R., Gortazar, F.: Path relinking for large-scale global optimization. Soft Comput. 15(11), 2257\u20132273 (2011). \n                    https:\/\/doi.org\/10.1007\/s00500-010-0650-7","journal-title":"Soft Comput."},{"issue":"3","key":"1306_CR3","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1162\/evco_a_00174","volume":"25","author":"I Fajfar","year":"2017","unstructured":"Fajfar, I., Puhan, J., B\u00fcrmen, \u00c1.: Evolving a nelder-mead algorithm for optimization with genetic programming. Evolut. Comput. 25(3), 351\u2013373 (2017). \n                    https:\/\/doi.org\/10.1162\/evco_a_00174","journal-title":"Evolut. Comput."},{"issue":"1","key":"1306_CR4","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10589-010-9329-3","volume":"51","author":"F Gao","year":"2012","unstructured":"Gao, F., Han, L.: Implementing the Nelder\u2013Mead simplex algorithm with adaptive parameters. Comput. Optim. Appl. 51(1), 259\u2013277 (2012). \n                    https:\/\/doi.org\/10.1007\/s10589-010-9329-3","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1306_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10556780512331318290","volume":"21","author":"L Han","year":"2006","unstructured":"Han, L., Neumann, M.: Effect of dimensionality on the Nelder\u2013Mead simplex method. Optim. Methods Softw. 21(1), 1\u201316 (2006). \n                    https:\/\/doi.org\/10.1080\/10556780512331318290","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"1306_CR6","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1137\/S1052623496303470","volume":"9","author":"JC Lagarias","year":"1998","unstructured":"Lagarias, J.C., Reeds, J.A., Wright, M.H., Wright, P.E.: Convergence properties of the Nelder\u2013Mead simplex method in low dimensions. SIAM J. Optim. 9(1), 112\u2013147 (1998)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1306_CR7","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1137\/S1052623496303482","volume":"9","author":"KIM McKinnon","year":"1998","unstructured":"McKinnon, K.I.M.: Convergence of the Nelder\u2013Mead simplex method to a nonstationary point. SIAM J. Optim. 9(1), 148\u2013158 (1998)","journal-title":"SIAM J. Optim."},{"issue":"C","key":"1306_CR8","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1016\/j.asoc.2017.05.060","volume":"59","author":"P Mohapatra","year":"2017","unstructured":"Mohapatra, P., Nath Das, K., Roy, S.: A modified competitive swarm optimizer for large scale optimization problems. Appl. Soft Comput. 59(C), 340\u2013362 (2017). \n                    https:\/\/doi.org\/10.1016\/j.asoc.2017.05.060","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"1306_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"JJ Mor\u00e9","year":"1981","unstructured":"Mor\u00e9, J.J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7(1), 17\u201341 (1981)","journal-title":"ACM Trans. Math. Softw."},{"issue":"4","key":"1306_CR10","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"Nelder, J.A., Mead, R.: A simplex method for function minimization. Comput. J. 7(4), 308\u2013313 (1965)","journal-title":"Comput. J."},{"key":"1306_CR11","unstructured":"Torczon, V.J.: Multi-directional search: A direct search algorithm for parallel machines. Ph.D. thesis, Rice University, Houston, TX (1989)"},{"key":"1306_CR12","unstructured":"Wright, M.H.: Direct search methods: once scorned, now respectable. In: Griffiths DF, Watson GA (eds) Numerical Analysis 1995, In: Proceedings of the 1995 dundee biennial conference in numerical analysis, CRC Press, Boca Raton, FL, Pitman Research Notes in Mathematics, vol 344, pp. 191\u2013208 (1996). \n                    http:\/\/www.crcpress.com\/shopping_cart\/products\/product_detail.asp?sku=LM7633&parent_id=&pc=\/shopping_cart\/search\/search.asp!"},{"issue":"1","key":"1306_CR13","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1109\/TEVC.2017.2672689","volume":"22","author":"P Yang","year":"2018","unstructured":"Yang, P., Tang, K., Yao, X.: Turning high-dimensional optimization into computationally expensive optimization. IEEE Trans. Evolut. Comput. 22(1), 143\u2013156 (2018). \n                    https:\/\/doi.org\/10.1109\/TEVC.2017.2672689","journal-title":"IEEE Trans. Evolut. Comput."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1306-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-018-1306-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1306-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T04:53:27Z","timestamp":1569387207000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-018-1306-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,28]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["1306"],"URL":"https:\/\/doi.org\/10.1007\/s11590-018-1306-2","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,28]]},"assertion":[{"value":"28 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}