{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T00:08:21Z","timestamp":1779235701908,"version":"3.51.4"},"reference-count":47,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T00:00:00Z","timestamp":1771977600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004329","name":"Slovenian Research and Innovation Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational and Applied Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.cam.2026.117521","type":"journal-article","created":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T08:49:22Z","timestamp":1772095762000},"page":"117521","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On the optimal parameter values of the Nelder\u2013Mead simplex algorithm"],"prefix":"10.1016","volume":"484","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3288-8254","authenticated-orcid":false,"given":"Janez","family":"Puhan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3035-1376","authenticated-orcid":false,"given":"\u00c1rp\u00e1d","family":"B\u0171rmen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.cam.2026.117521_bib0001","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","article-title":"A simplex method for function minimization","volume":"7","author":"Nelder","year":"1965","journal-title":"Comput. J."},{"key":"10.1016\/j.cam.2026.117521_bib0002","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1137\/S003614450242889","article-title":"Optimization by direct search: new perspectives on some classical and modern methods","volume":"45","author":"Kolda","year":"2003","journal-title":"SIAM Rev."},{"key":"10.1016\/j.cam.2026.117521_bib0003","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1017\/S0962492919000060","article-title":"Derivative-free optimization methods","volume":"28","author":"Larson","year":"2019","journal-title":"Acta. Numer."},{"key":"10.1016\/j.cam.2026.117521_bib0004","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1080\/00401706.1962.10490033","article-title":"Sequential application of simplex designs in optimisation and evolutionary operation","volume":"4","author":"Spendley","year":"1962","journal-title":"Technometrics"},{"key":"10.1016\/j.cam.2026.117521_bib0005","series-title":"Technical Report","article-title":"An Interactive Approach for Solving Multi-Objective Optimisation Problems","author":"Woods","year":"1985"},{"key":"10.1016\/j.cam.2026.117521_bib0006","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1137\/S1052623496303482","article-title":"Convergence of the Nelder-Mead simplex method to a nonstationary point","volume":"9","author":"Mckinnon","year":"1998","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2026.117521_bib0007","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1137\/S1052623496303470","article-title":"Convergence properties of the Nelder-mead simplex method in low dimensions","volume":"9","author":"Lagarias","year":"1998","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2026.117521_bib0008","series-title":"Proc. 1st Conf. Appl. Math. Comput.","first-page":"185","article-title":"Complexity analysis of Nelder-Mead search iterations","author":"Singer","year":"1999"},{"key":"10.1016\/j.cam.2026.117521_bib0009","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1137\/S1052623497315203","article-title":"Detection and remediation of stagnation in the Nelder-Mead algorithm using a sufficient decrease condition","volume":"10","author":"Kelley","year":"1999","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2026.117521_bib0010","doi-asserted-by":"crossref","unstructured":"C.T. Kelley, Iterative Methods for Optimization, SIAM, 1999b.","DOI":"10.1137\/1.9781611970920"},{"key":"10.1016\/j.cam.2026.117521_bib0011","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1137\/110830150","article-title":"Convergence of the restricted Nelder-Mead algorithm in two dimensions","volume":"22","author":"Lagarias","year":"2012","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2026.117521_bib0012","doi-asserted-by":"crossref","first-page":"1785","DOI":"10.12700\/APH.18.5.2021.5.7","article-title":"A convergence analysis of the Nelder-Mead simplex method","volume":"18","author":"Gal\u00e1ntai","year":"2021","journal-title":"Acta Polytech. Hung."},{"key":"10.1016\/j.cam.2026.117521_bib0013","doi-asserted-by":"crossref","first-page":"115","DOI":"10.32973\/jcam.2020.008","article-title":"Convergence theorems for the Nelder-Mead method","volume":"15","author":"Gal\u00e1ntai","year":"2020","journal-title":"J. Comput. Appl. Mech."},{"key":"10.1016\/j.cam.2026.117521_bib0014","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1007\/s11075-021-01221-7","article-title":"Convergence of the Nelder-Mead method","volume":"90","author":"Gal\u00e1ntai","year":"2022","journal-title":"Numer. Algorithms"},{"issue":"9","key":"10.1016\/j.cam.2026.117521_bib0015","doi-asserted-by":"crossref","DOI":"10.3390\/math11091998","article-title":"A stochastic convergence result for the Nelder-Mead simplex method","volume":"11","author":"Gal\u00e1ntai","year":"2023","journal-title":"Mathematics"},{"key":"10.1016\/j.cam.2026.117521_bib0016","series-title":"Technical Report","article-title":"Multi-Directional Search: A Direct Search Algorithm for Parallel Machines","author":"Torczon","year":"1989"},{"key":"10.1016\/j.cam.2026.117521_bib0017","unstructured":"M. Wright, Direct Search Methods: Once Scorned, Now Respectable, Numer. Anal: Proc. 1995 Dundee Biennial Conf. Numer. Anal. pp. 191\u2013208."},{"key":"10.1016\/j.cam.2026.117521_bib0018","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10556780512331318290","article-title":"Effect of dimensionality on the Nelder-Mead simplex method","volume":"21","author":"Han","year":"2006","journal-title":"Optim. Methods Softw."},{"key":"10.1016\/j.cam.2026.117521_bib0019","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10589-010-9329-3","article-title":"Implementing the Nelder-Mead simplex algorithm with adaptive parameters","volume":"51","author":"Gao","year":"2012","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.cam.2026.117521_bib0020","first-page":"784","volume":"41","author":"Rykov","year":"1980","journal-title":"Simplex Direct Search Algorithms"},{"key":"10.1016\/j.cam.2026.117521_bib0021","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1137\/S1052623495282857","article-title":"Fortified-descent simplicial search method: a general approach","volume":"10","author":"Tseng","year":"1999","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2026.117521_bib0022","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1023\/A:1014842520519","article-title":"Gilding the Lily: a variant of the Nelder-Mead algorithm based on golden-section search","volume":"22","author":"Nazareth","year":"2002","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.cam.2026.117521_bib0023","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1014849028575","article-title":"A convergent variant of the Nelder-Mead algorithm","volume":"113","author":"Price","year":"2002","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/j.cam.2026.117521_bib0024","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s10589-005-3912-z","article-title":"Grid restrained Nelder-Mead algorithm","volume":"34","author":"B\u0171rmen","year":"2006","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.cam.2026.117521_bib0025","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.cam.2007.12.017","article-title":"Unconstrained derivative-free optimization by successive approximation","volume":"223","author":"B\u0171rmen","year":"2009","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.cam.2026.117521_bib0026","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1162\/evco_a_00174","article-title":"Evolving a Nelder-Mead algorithm for optimization with genetic programming","volume":"25","author":"Fajfar","year":"2017","journal-title":"Evol. Comput."},{"key":"10.1016\/j.cam.2026.117521_bib0027","doi-asserted-by":"crossref","first-page":"2169","DOI":"10.1109\/ACCESS.2018.2855079","article-title":"Dynamic Hassan Nelder Mead with simplex free selectivity for unconstrained optimization","volume":"6","author":"Musafer","year":"2018","journal-title":"IEEE Access"},{"key":"10.1016\/j.cam.2026.117521_bib0028","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10589-018-0016-0","article-title":"Mesh-based Nelder-Mead algorithm for inequality constrained optimization","volume":"71","author":"Audet","year":"2018","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.cam.2026.117521_bib0029","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1007\/s11590-018-1306-2","article-title":"The Nelder-Mead simplex algorithm with perturbed centroid for high-dimensional function optimization","volume":"13","author":"Fajfar","year":"2019","journal-title":"Optim. Lett."},{"key":"10.1016\/j.cam.2026.117521_bib0030","doi-asserted-by":"crossref","first-page":"613","DOI":"10.3934\/naco.2020058","article-title":"A modified Nelder-Mead barrier method for constrained optimization","volume":"11","author":"Price","year":"2021","journal-title":"Numer. Algebra Contr. Optim."},{"key":"10.1016\/j.cam.2026.117521_bib0031","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2023.111178","article-title":"Weighted centroids in adaptive Nelder-Mead simplex: with heat source locator and multiple myeloma predictor applications","volume":"151","author":"G\u00fcnel","year":"2024","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cam.2026.117521_bib0032","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1007\/s11590-018-1284-4","article-title":"Proper initialization is crucial for the nelder-Mead simplex search","volume":"13","author":"Wessing","year":"2019","journal-title":"Optim. Lett."},{"key":"10.1016\/j.cam.2026.117521_bib0033","series-title":"Scipy: Open Source Scientific Tool for Python","author":"Jones","year":"2001"},{"key":"10.1016\/j.cam.2026.117521_bib0034","series-title":"Compact Numerical Methods for Computers: Linear Algebra and Function Minimisation","author":"Nash","year":"1990"},{"key":"10.1016\/j.cam.2026.117521_bib0035","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s11590-022-01953-y","article-title":"Practical initialization of the Nelder-Mead method for computationally expensive optimization problems","volume":"17","author":"Takenaga","year":"2023","journal-title":"Optim. Lett."},{"key":"10.1016\/j.cam.2026.117521_bib0036","doi-asserted-by":"crossref","DOI":"10.1007\/s42979-025-03984-5","article-title":"An experimental study of noisy optimization with RPS over different distributions","volume":"6","author":"Rocha","year":"2025","journal-title":"SN Comput. Sci."},{"key":"10.1016\/j.cam.2026.117521_bib0037","series-title":"Multilevel Nelder Mead\u2019s Simplex Method","first-page":"1","author":"Kumar","year":"2014"},{"key":"10.1016\/j.cam.2026.117521_bib0038","doi-asserted-by":"crossref","first-page":"1814","DOI":"10.1080\/0305215X.2019.1688315","article-title":"Improved Nelder-Mead algorithm in high dimensions with adaptive parameters based on chebyshev spacing points","volume":"52","author":"Mehta","year":"2020","journal-title":"Eng. Optim."},{"key":"10.1016\/j.cam.2026.117521_bib0039","series-title":"Meta-optimization of dimension adaptive parameter schema for Nelder-Mead algorithm in high-dimensional problems","first-page":"10","author":"\u017d Rojec","year":"2022"},{"key":"10.1016\/j.cam.2026.117521_bib0040","first-page":"43","article-title":"The IRACE package: iterated racing for automatic algorithm configuration","volume":"3","author":"L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","journal-title":"Oper. Res. Perspect."},{"key":"10.1016\/j.cam.2026.117521_bib0041","first-page":"267","volume":"36","author":"Hutter","year":"2009","journal-title":"ParamILS: an automatic algorithm configuration framework"},{"key":"10.1016\/j.cam.2026.117521_bib0042","series-title":"Bayesian optimization for parameter tuning in evolutionary algorithms","first-page":"4839","author":"Roman","year":"2016"},{"key":"10.1016\/j.cam.2026.117521_bib0043","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","article-title":"A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms","volume":"1","author":"Derrac","year":"2011","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.cam.2026.117521_bib0044","first-page":"80","volume":"1","author":"Wilcoxon","year":"1945","journal-title":"Individual Comparisons by Ranking Methods"},{"key":"10.1016\/j.cam.2026.117521_bib0045","series-title":"Nonparametric Statistical Methods","author":"Hollander","year":"2014"},{"key":"10.1016\/j.cam.2026.117521_bib0046","first-page":"65","article-title":"A simple sequentially rejective multiple test procedure","volume":"6","author":"Holm","year":"1979","journal-title":"Scand. J. Stat."},{"key":"10.1016\/j.cam.2026.117521_bib0047","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1214\/aoms\/1177704172","article-title":"Estimates of location based on rank tests","volume":"6","author":"Hodges Jr","year":"1963","journal-title":"Ann. Math. Statist."}],"container-title":["Journal of Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726001810?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726001810?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T23:27:23Z","timestamp":1779233243000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377042726001810"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":47,"alternative-id":["S0377042726001810"],"URL":"https:\/\/doi.org\/10.1016\/j.cam.2026.117521","relation":{},"ISSN":["0377-0427"],"issn-type":[{"value":"0377-0427","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the optimal parameter values of the Nelder\u2013Mead simplex algorithm","name":"articletitle","label":"Article Title"},{"value":"Journal of Computational and Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cam.2026.117521","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"117521"}}