{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T23:03:16Z","timestamp":1774306996585,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/100008208","name":"Courant Institute of Mathematical Sciences, New York University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100008208","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007472","name":"Funda\u00e7\u00e3o Luso-Americana para o Desenvolvimento","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007472","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006136","name":"Fuel Cell Technologies Program","doi-asserted-by":"publisher","award":["PTDC\/MAT\/098214\/2008"],"award-info":[{"award-number":["PTDC\/MAT\/098214\/2008"]}],"id":[{"id":"10.13039\/100006136","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s13675-012-0003-7","type":"journal-article","created":{"date-parts":[[2012,12,6]],"date-time":"2012-12-06T05:27:30Z","timestamp":1354771650000},"page":"143-153","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":53,"title":["Worst case complexity of direct search"],"prefix":"10.1016","volume":"1","author":[{"given":"L.N.","family":"Vicente","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1007\/s13675-012-0003-7_CR1","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1137\/S1052623400378742","article-title":"Analysis of generalized pattern searches","volume":"13","author":"Audet","year":"2002","journal-title":"SIAM J Optim"},{"key":"10.1007\/s13675-012-0003-7_CR2","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1137\/040603371","article-title":"Mesh adaptive direct search algorithms for constrained optimization","volume":"17","author":"Audet","year":"2006","journal-title":"SIAM J Optim"},{"key":"10.1007\/s13675-012-0003-7_CR3","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s10107-009-0337-y","article-title":"Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity","volume":"130","author":"Cartis","year":"2011","journal-title":"Math Program"},{"key":"10.1007\/s13675-012-0003-7_CR4","doi-asserted-by":"crossref","first-page":"2833","DOI":"10.1137\/090774100","article-title":"On the complexity of steepest descent, Newton\u2019s and regularized Newton\u2019s methods for nonconvex unconstrained optimization","volume":"20","author":"Cartis","year":"2010","journal-title":"SIAM J Optim"},{"key":"10.1007\/s13675-012-0003-7_CR5","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1137\/100812276","article-title":"On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization","volume":"22","author":"Cartis","year":"2012","journal-title":"SIAM J Optim"},{"key":"10.1007\/s13675-012-0003-7_CR6","doi-asserted-by":"crossref","unstructured":"Conn AR, Gould NIM, Toint PhL (2000) Trust-region methods. MPS-SIAM Series on Optimization. SIAM, Philadelphia","DOI":"10.1137\/1.9780898719857"},{"key":"10.1007\/s13675-012-0003-7_CR7","doi-asserted-by":"crossref","unstructured":"Conn AR, Scheinberg K, Vicente LN (2009) Introduction to derivative-free optimization. MPS-SIAM Series on Optimization. SIAM, Philadelphia","DOI":"10.1137\/1.9780898718768"},{"key":"10.1007\/s13675-012-0003-7_CR8","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1137\/S1052623400374495","article-title":"On the local convergence of pattern search","volume":"14","author":"Dolan","year":"2003","journal-title":"SIAM J Optim"},{"key":"10.1007\/s13675-012-0003-7_CR9","doi-asserted-by":"crossref","unstructured":"Garmanjani R, Vicente LN (2012) Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization. IMA J Numer Anal (to appear)","DOI":"10.1093\/imanum\/drs027"},{"key":"10.1007\/s13675-012-0003-7_CR10","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1093\/imanum\/drn034","article-title":"A recursive trust-region method in infinity norm for bound-constrained nonlinear optimization","volume":"28","author":"Gratton","year":"2008","journal-title":"IMA J Numer Anal"},{"key":"10.1007\/s13675-012-0003-7_CR11","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1137\/050623012","article-title":"Recursive trust-region methods for multiscale nonlinear optimization","volume":"19","author":"Gratton","year":"2008","journal-title":"SIAM J Optim"},{"key":"10.1007\/s13675-012-0003-7_CR12","unstructured":"Jarre F (2012) On Nesterov\u2019s smooth Chebyshev\u2013Rosenbrock function. Optim Methods Softw (to appear)"},{"key":"10.1007\/s13675-012-0003-7_CR13","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.1007\/s13675-012-0003-7_CR14","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1137\/S1052623497331373","article-title":"Pattern search methods for linearly constrained minimization","volume":"10","author":"Lewis","year":"2000","journal-title":"SIAM J Optim"},{"key":"10.1007\/s13675-012-0003-7_CR15","series-title":"Introductory lectures on convex optimization","author":"Nesterov","year":"2004"},{"key":"10.1007\/s13675-012-0003-7_CR16","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10107-006-0706-8","article-title":"Cubic regularization of Newton\u2019s method and its global performance","volume":"108","author":"Nesterov","year":"2006","journal-title":"Math Program"},{"key":"10.1007\/s13675-012-0003-7_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S1052623493250780","article-title":"On the convergence of pattern search algorithms","volume":"7","author":"Torczon","year":"1997","journal-title":"SIAM J Optim"},{"key":"10.1007\/s13675-012-0003-7_CR18","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10107-010-0429-8","article-title":"Analysis of direct searches for discontinuous functions","volume":"133","author":"Vicente","year":"2012","journal-title":"Math Program"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-012-0003-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-012-0003-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000150?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000150?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-012-0003-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:45:16Z","timestamp":1761882316000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621000150"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["S2192440621000150"],"URL":"https:\/\/doi.org\/10.1007\/s13675-012-0003-7","relation":{},"ISSN":["2192-4406"],"issn-type":[{"value":"2192-4406","type":"print"}],"subject":[],"published":{"date-parts":[[2013,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Worst case complexity of direct search","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-012-0003-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 The Author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}