{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T22:14:50Z","timestamp":1773267290791,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2014,11,28]],"date-time":"2014-11-28T00:00:00Z","timestamp":1417132800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s10107-014-0847-0","type":"journal-article","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T13:10:48Z","timestamp":1417439448000},"page":"307-332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Worst case complexity of direct search under convexity"],"prefix":"10.1007","volume":"155","author":[{"given":"M.","family":"Dodangeh","sequence":"first","affiliation":[]},{"given":"L. N.","family":"Vicente","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,28]]},"reference":[{"key":"847_CR1","doi-asserted-by":"crossref","first-page":"2833","DOI":"10.1137\/090774100","volume":"20","author":"C Cartis","year":"2010","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: On the complexity of steepest descent, Newton\u2019s and regularized Newton\u2019s methods for nonconvex unconstrained optimization. SIAM J. Optim. 20, 2833\u20132852 (2010)","journal-title":"SIAM J. Optim."},{"key":"847_CR2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s10107-009-0337-y","volume":"130","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: Adaptive cubic regularisation methods for unconstrained optimization. Part II. Math. Program. 130, 295\u2013319 (2011)","journal-title":"Math. Program."},{"key":"847_CR3","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1137\/100812276","volume":"22","author":"C Cartis","year":"2012","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization. SIAM J. Optim. 22, 66\u201386 (2012)","journal-title":"SIAM J. Optim."},{"key":"847_CR4","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718768","volume-title":"Introduction to Derivative-Free Optimization. MPS-SIAM Series on Optimization","author":"AR Conn","year":"2009","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to Derivative-Free Optimization. MPS-SIAM Series on Optimization. SIAM, Philadelphia (2009)"},{"key":"847_CR5","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1137\/S1052623400374495","volume":"14","author":"ED Dolan","year":"2003","unstructured":"Dolan, E.D., Lewis, R.M., Torczon, V.: On the local convergence of pattern search. SIAM J. Optim. 14, 567\u2013583 (2003)","journal-title":"SIAM J. Optim."},{"key":"847_CR6","unstructured":"Duchi, J.C., Jordan, M.I., Wainwright, M.J., Wibisono, A.: Optimal rates for zero-order convex optimization: the power of two function evaluations (2014). arXiv:1312.2139v2"},{"key":"847_CR7","doi-asserted-by":"crossref","first-page":"1008","DOI":"10.1093\/imanum\/drs027","volume":"33","author":"R Garmanjani","year":"2013","unstructured":"Garmanjani, R., Vicente, L.N.: Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization. IMA J. Numer. Anal. 33, 1008\u20131028 (2013)","journal-title":"IMA J. Numer. Anal."},{"key":"847_CR8","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"NIM Gould","year":"2003","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: CUTEr, a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29, 373\u2013394 (2003)","journal-title":"ACM Trans. Math. Softw."},{"key":"847_CR9","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1137\/050623012","volume":"19","author":"S Gratton","year":"2008","unstructured":"Gratton, S., Sartenaer, A., Toint, P.L.: Recursive trust-region methods for multiscale nonlinear optimization. SIAM J. Optim. 19, 414\u2013444 (2008)","journal-title":"SIAM J. Optim."},{"key":"847_CR10","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1137\/S003614450242889","volume":"45","author":"TG Kolda","year":"2003","unstructured":"Kolda, T.G., Lewis, R.M., Torczon, V.: Optimization by direct search: new perspectives on some classical and modern methods. SIAM Rev. 45, 385\u2013482 (2003)","journal-title":"SIAM Rev."},{"key":"847_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization. Kluwer Academic Publishers, Dordrecht (2004)"},{"key":"847_CR12","unstructured":"Nesterov, Y.: Random gradient-free minimization of convex functions. Technical Report 2011\/1, CORE (2011)"},{"key":"847_CR13","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1137\/100802001","volume":"22","author":"Y Nesterov","year":"2012","unstructured":"Nesterov, Y.: Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J. Optim. 22, 341\u2013362 (2012)","journal-title":"SIAM J. Optim."},{"key":"847_CR14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10107-006-0706-8","volume":"108","author":"Y Nesterov","year":"2006","unstructured":"Nesterov, Y., Polyak, B.T.: Cubic regularization of Newton\u2019s method and its global performance. Math. Program. 108, 177\u2013205 (2006)","journal-title":"Math. Program."},{"key":"847_CR15","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, Berlin (2006)","edition":"2"},{"key":"847_CR16","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"847_CR17","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s13675-012-0003-7","volume":"1","author":"LN Vicente","year":"2013","unstructured":"Vicente, L.N.: Worst case complexity of direct search. EURO J. Comput. Optim. 1, 143\u2013153 (2013)","journal-title":"EURO J. Comput. Optim."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0847-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-014-0847-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0847-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:00:06Z","timestamp":1559109606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-014-0847-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,28]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["847"],"URL":"https:\/\/doi.org\/10.1007\/s10107-014-0847-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,28]]}}}