{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T18:27:06Z","timestamp":1772130426790,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,3,23]],"date-time":"2006-03-23T00:00:00Z","timestamp":1143072000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[2006,7]]},"DOI":"10.1007\/s10589-005-3912-z","type":"journal-article","created":{"date-parts":[[2006,3,23]],"date-time":"2006-03-23T12:07:23Z","timestamp":1143115643000},"page":"359-375","source":"Crossref","is-referenced-by-count":41,"title":["Grid Restrained Nelder-Mead Algorithm"],"prefix":"10.1007","volume":"34","author":[{"given":"\u00c1rp\u00e1d","family":"B\u0171rmen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janez","family":"Puhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tadej","family":"Tuma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,3,23]]},"reference":[{"key":"3912_CR1","unstructured":"D. Byatt, \u201cA convergent variant of the Nelder-Mead algorithm,\u201d Master\u2019;s thesis, Mathematics and Statistics Department, University of Canterbury, Christchurch, NZ, 2000."},{"key":"3912_CR2","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1023\/A:1026429319405","volume":"107","author":"I.D. Coope","year":"2000","unstructured":"I.D. Coope and C.J. Price, \u201cFrame based methods for unconstrained optimization,\u201d Journal of Optimization Theory and Applications, vol. 107, pp. 261\u2013274, 2000.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"3912_CR3","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1137\/S1052623499354989","volume":"11","author":"I.D. Coope","year":"2001","unstructured":"I.D. Coope and C.J. Price, \u201cOn the convergence of grid-based methods for unconstrained optimization,\u201d SIAM J. Optim., vol. 11, pp. 859\u2013869, 2001.","journal-title":"SIAM J. Optim."},{"key":"3912_CR4","doi-asserted-by":"crossref","first-page":"733","DOI":"10.2307\/2372648","volume":"76","author":"C. Davis","year":"1954","unstructured":"C. Davis, \u201cTheory of positive linear dependence,\u201d American Journal of Mathematics, vol. 76, pp. 733\u2013746, 1954.","journal-title":"American Journal of Mathematics"},{"key":"3912_CR5","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1137\/S1052623497315203","volume":"10","author":"C.T. Kelley","year":"1999","unstructured":"C.T. Kelley, \u201cDetection and remediation of stagnation in the Nelder-Mead algorithm using a sufficient decrease condition,\u201d SIAM Journal on Optimization, vol. 10, pp. 43\u201355, 1999.","journal-title":"SIAM Journal on Optimization"},{"key":"3912_CR6","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1137\/S1052623496303470","volume":"9","author":"J.C. Lagarias","year":"1998","unstructured":"J.C. Lagarias, \u201cConvergence properties of the Nelder-Mead simplex method in low dimensions,\u201d SIAM Journal on Optimization, vol. 9, pp. 112\u2013147, 1998.","journal-title":"SIAM Journal on Optimization"},{"key":"3912_CR7","unstructured":"R.M. Lewis and V.J. Torczon, \u201cRank ordering and positive bases in pattern search algorithms,\u201d ICASE NASA Langley Research Center, Hampton, VA 23681-0001, USA, Tech. Report 96-71, 1996."},{"key":"3912_CR8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0377-0427(00)00423-4","volume":"124","author":"R.M. Lewis","year":"2000","unstructured":"R.M. Lewis, V.J. Torczon, and M.W. Trosset, \u201cDirect search methods: Then and now,\u201d Journal of Computational and Applied Mathematics, vol. 124, pp. 191\u2013207, 2000.","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"3912_CR9","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1137\/S1052623496303482","volume":"9","author":"K.I.M. McKinnon","year":"1998","unstructured":"K.I.M. McKinnon, \u201cConvergence of the Nelder-Mead simplex method,\u201d SIAM Journal on Optimization, vol. 9, pp. 148\u2013158, 1998.","journal-title":"SIAM Journal on Optimization"},{"key":"3912_CR10","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"J.J. Mor\u00e9","year":"1981","unstructured":"J.J. Mor\u00e9, B.S. Garbow, and K.E. Hillstrom, \u201cTesting unconstrained optimization software,\u201d ACM Transactions on Mathematical Software, vol. 7, pp. 17\u201341, 1981.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"3912_CR11","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"J.A. Nelder","year":"1965","unstructured":"J.A. Nelder and R. Mead, \u201cA simplex method for function minimization,\u201d The Computer Journal, vol. 7, pp. 308\u2013313, 1965.","journal-title":"The Computer Journal"},{"key":"3912_CR12","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1014849028575","volume":"113","author":"C.J. Price","year":"2002","unstructured":"C.J. Price, I.D. Coope, and D. Byatt, \u201cA convergent variant of the Nelder-Mead algorithm,\u201d Journal of Optimization Theory and Applications, vol. 113, pp. 5\u201319, 2002.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"3912_CR13","first-page":"195","volume":"12","author":"A.S. Rykov","year":"1983","unstructured":"A.S. Rykov, \u201cSimplex algorithms for unconstrained minimization,\u201d Problems of Control and Information Theory, vol. 12, pp. 195\u2013208, 1983.","journal-title":"Problems of Control and Information Theory"},{"key":"3912_CR14","unstructured":"V.J. Torczon, \u201cMulti-directional search: A direct search algorithm for parallel machines,\u201d PhD thesis, Department of Mathematical Sciences, Rice University, Houston, TX 77251-1892, USA, 1989."},{"key":"3912_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S1052623493250780","volume":"7","author":"V.J. Torczon","year":"1997","unstructured":"V.J. Torczon, \u201cOn the convergence of pattern search methods,\u201d SIAM J. Optim., vol. 7, pp. 1\u201325, 1997.","journal-title":"SIAM J. Optim."},{"key":"3912_CR16","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1137\/S1052623495282857","volume":"10","author":"P. Tseng","year":"1999","unstructured":"P. Tseng, \u201cFortified-descent simplical search method: A general approach,\u201d SIAM Journal on Optimization, vol. 10, pp. 269\u2013288, 1999.","journal-title":"SIAM Journal on Optimization"},{"key":"3912_CR17","unstructured":"M.H. Wright, \u201cDirect search methods: Once scorned, now respectable,\u201d in Proceedings of the 1995 Dundee Biennial Conference in Numerical Analysis, Dundee, UK, 1996, pp. 191\u2013208."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-3912-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-005-3912-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-3912-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:29Z","timestamp":1559288189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-005-3912-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3,23]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,7]]}},"alternative-id":["3912"],"URL":"https:\/\/doi.org\/10.1007\/s10589-005-3912-z","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,3,23]]}}}