{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T18:30:11Z","timestamp":1772130611096,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1023\/a:1014842520519","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T16:20:03Z","timestamp":1041092403000},"page":"133-144","source":"Crossref","is-referenced-by-count":50,"title":["Gilding the Lily: A Variant of the Nelder-Mead Algorithm Based on Golden-Section Search"],"prefix":"10.1007","volume":"22","author":[{"given":"Larry","family":"Nazareth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Tseng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"399776_CR1","volume-title":"Nonlinear Programming","author":"D.P. Bertsekas","year":"1999","unstructured":"D.P. Bertsekas, Nonlinear Programming, 2nd edn., Athena Scientific: Belmont, 1999.","edition":"2nd edn."},{"key":"399776_CR2","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1137\/0801027","volume":"1","author":"J.E. Dennis Jr.","year":"1991","unstructured":"J.E. Dennis, Jr. and V. Torczon, \u201cDirect search methods on parallel machines,\u201d SIAM Journal on Optimization, vol. 1, pp. 448\u2013474, 1991.","journal-title":"SIAM Journal on Optimization"},{"key":"399776_CR3","volume-title":"Practical Methods of Optimization","author":"R. Fletcher","year":"1980","unstructured":"R. Fletcher, Practical Methods of Optimization, vol. 1, John Wiley: New York, 1980."},{"key":"399776_CR4","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970920","volume-title":"Iterative Methods for Optimization","author":"C.T. Kelly","year":"1999","unstructured":"C.T. Kelly, Iterative Methods for Optimization, SIAM: Philadelphia, PA, 1999."},{"key":"399776_CR5","series-title":"Report OUEL","volume-title":"Nonlinear optimization toolbox","author":"A.G. Kuznetsov","year":"1992","unstructured":"A.G. Kuznetsov, \u201cNonlinear optimization toolbox,\u201d Department of Engineering Science, University of Oxford, Oxford, UK, Report OUEL 1936\/92, 1992."},{"key":"399776_CR6","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1137\/S1052623496303470","volume":"9","author":"J.C. Lagarias","year":"1998","unstructured":"J.C. Lagarias, J.A. Reeds, M.H. Wright, and P.E. Wright, \u201cConvergence properties of the Nelder-Mead simplex algorithm in low dimensions,\u201d SIAM Journal on Optimization, vol. 9, pp. 112\u2013147, 1998.","journal-title":"SIAM Journal on Optimization"},{"key":"399776_CR7","volume-title":"Linear and Nonlinear Programming","author":"D.G. Luenberger","year":"1984","unstructured":"D.G. Luenberger, Linear and Nonlinear Programming, 2nd edn., Addison-Wesley: Reading, MA, 1984.","edition":"2nd edn."},{"key":"399776_CR8","volume-title":"Nonlinear Programming","author":"O.L. Mangasarian","year":"1969","unstructured":"O.L. Mangasarian, Nonlinear Programming, McGraw-Hill: New York, 1969."},{"key":"399776_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 to a non-stationary point,\u201d SIAM Journal on Optimization, vol. 9, pp. 148\u2013158, 1998.","journal-title":"SIAM Journal on Optimization"},{"key":"399776_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":"399776_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 Computer Journal, vol. 7, pp. 308\u2013313, 1965.","journal-title":"Computer Journal"},{"key":"399776_CR12","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1093\/comjnl\/7.2.155","volume":"7","author":"M.J.D. Powell","year":"1964","unstructured":"M.J.D. Powell, \u201cAn efficient method for finding the minimum of a function of several variables without calculating derivatives,\u201d Computer Journal, vol. 7, pp. 155\u2013162, 1964.","journal-title":"Computer Journal"},{"key":"399776_CR13","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1017\/S0962492900002841","volume":"7","author":"M.J.D. Powell","year":"1998","unstructured":"M.J.D. Powell, \u201cDirect search algorithms for optimization calculations,\u201d Acta Numerica, vol. 7, pp. 287\u2013336, 1998.","journal-title":"Acta Numerica"},{"key":"399776_CR14","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1080\/00401706.1962.10490033","volume":"4","author":"W. Spendley","year":"1962","unstructured":"W. Spendley, G.R. Hext, and F.R. Himsworth, \u201cSequential application of simplex designs in optimisation and evolutionary operation,\u201d Technometrica, vol. 4, pp. 441\u2013461, 1962.","journal-title":"Technometrica"},{"key":"399776_CR15","volume-title":"Multi-directional search: A direct search algorithm for parallel machines","author":"V. Torczon","year":"1989","unstructured":"V. Torczon, \u201cMulti-directional search: A direct search algorithm for parallel machines,\u201d Ph.D. Thesis, Rice University, Houston, TX, 1989; available as Department of Mathematical Sciences, Rice University, Houston, TX, Technical Report 90-7."},{"key":"399776_CR16","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1137\/S1052623495282857","volume":"10","author":"P. Tseng","year":"2000","unstructured":"P. Tseng, \u201cFortified-descent simplicial search method: A general approach,\u201d SIAM Journal on Optimization, vol. 10, pp. 269\u2013288, 2000.","journal-title":"SIAM Journal on Optimization"},{"key":"399776_CR17","first-page":"191","volume-title":"Numerical Analysis 1995","author":"M.H. Wright","year":"1996","unstructured":"M.H. Wright, \u201cDirect search methods: Once scorned, now respectable,\u201d in Numerical Analysis 1995, Proceedings of the 1995 Dundee Biennial Conference in Numerical Analysis, D.F. Griffiths and G.A. Watson (Eds.), Addison-Wesley Longman: Harlow, UK, 1996, pp. 191\u2013208."},{"key":"399776_CR18","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1093\/comjnl\/10.3.293","volume":"10","author":"W.I. Zangwill","year":"1967","unstructured":"W.I. Zangwill, \u201cMinimizing a function without calculating derivatives,\u201d Computer Journal, vol. 10, pp. 293\u2013296, 1967.","journal-title":"Computer Journal"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1014842520519.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1014842520519\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1014842520519.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:11:12Z","timestamp":1752376272000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1014842520519"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["399776"],"URL":"https:\/\/doi.org\/10.1023\/a:1014842520519","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}