{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T22:14:48Z","timestamp":1773267288182,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,6,3]],"date-time":"2015-06-03T00:00:00Z","timestamp":1433289600000},"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":["Optim Lett"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s11590-015-0908-1","type":"journal-article","created":{"date-parts":[[2015,6,2]],"date-time":"2015-06-02T14:55:41Z","timestamp":1433256941000},"page":"699-708","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["On the optimal order of worst case complexity of direct search"],"prefix":"10.1007","volume":"10","author":[{"given":"M.","family":"Dodangeh","sequence":"first","affiliation":[]},{"given":"L. N.","family":"Vicente","sequence":"additional","affiliation":[]},{"given":"Z.","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,3]]},"reference":[{"key":"908_CR1","doi-asserted-by":"crossref","first-page":"651","DOI":"10.2307\/2047241","volume":"102","author":"I B\u00e1r\u00e1ny","year":"1988","unstructured":"B\u00e1r\u00e1ny, I., F\u00fcredi, Z.: Approximation of the sphere by polytopes having few vertices. Proc. Am. Math. Soc. 102, 651\u2013659 (1988)","journal-title":"Proc. Am. Math. Soc."},{"key":"908_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546587","volume-title":"Finite Packing and Covering","author":"K B\u00f6r\u00f6czky Jr","year":"2004","unstructured":"B\u00f6r\u00f6czky Jr, K.: Finite Packing and Covering. Cambridge University Press, New York (2004)"},{"key":"908_CR3","unstructured":"B\u00f6r\u00f6czky Jr, K.: April 25, 2014 (private communication)"},{"key":"908_CR4","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-642-55566-4_10","volume-title":"Discrete and Computational Geometry","author":"K B\u00f6r\u00f6czky Jr","year":"2003","unstructured":"B\u00f6r\u00f6czky Jr, K., Wintsche, G.: Covering the sphere by equal spherical balls. In: Aronov, B., Basu, S., Pach, J., Sharir, M. (eds.) Discrete and Computational Geometry. Algorithms and Combinatorics, vol. 25, pp. 235\u2013251. Springer, Berlin (2003)"},{"key":"908_CR5","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF02392835","volume":"162","author":"J Bourgain","year":"1989","unstructured":"Bourgain, J., Lindenstrauss, J., Milman, V.: Approximation of zonoids by zonotopes. Acta Math. 162, 73\u2013141 (1989)","journal-title":"Acta Math."},{"key":"908_CR6","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/BF01394273","volume":"94","author":"B Carl","year":"1988","unstructured":"Carl, B., Pajor, A.: Gelfand numbers of operators with values in a Hilbert space. Invent. Math. 94, 479\u2013504 (1988)","journal-title":"Invent. Math."},{"key":"908_CR7","series-title":"MPS-SIAM Series on Optimization","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718768","volume-title":"Introduction to Derivative-Free 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":"908_CR8","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s004540010032","volume":"24","author":"L Dalla","year":"2000","unstructured":"Dalla, L., Larman, D.G., Mani-Levitska, P., Zong, C.: The blocking numbers of convex bodies. Discret. Comput. Geom. 24, 267\u2013278 (2000)","journal-title":"Discret. Comput. Geom."},{"key":"908_CR9","doi-asserted-by":"crossref","unstructured":"Dodangeh, M., Vicente, L.N.: Worst case complexity of direct search under convexity. Math. Program. doi: 10.1007\/s10107-014-0847-0","DOI":"10.1007\/s10107-014-0847-0"},{"key":"908_CR10","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":"908_CR11","volume-title":"Regular Figures","author":"L Fejes T\u00f3th","year":"1964","unstructured":"Fejes T\u00f3th, L.: Regular Figures. Pergman Press, London (1964)"},{"key":"908_CR12","unstructured":"Fercoq, O., Richt\u00e1rik, P.: Accelerated, parallel and proximal coordinate descent. Technical report, School of Mathematics, University of Edinburgh, December 2013. arXiv:1312.5799v2"},{"key":"908_CR13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1070\/SM1989v064n01ABEH003295","volume":"64","author":"ED Gluskin","year":"1989","unstructured":"Gluskin, E.D.: Extremal properties of orthogonal parallelepipeds and their applications to the geometry of Banach spaces. Math. USSR-Sbornik 64, 85\u201396 (1989)","journal-title":"Math. USSR-Sbornik"},{"key":"908_CR14","doi-asserted-by":"crossref","unstructured":"Gratton, S., Royer, C.W., Vicente, L.N., Zhang, Z.: Direct search based on probabilistic descent. SIAM J. Optim. (to appear)","DOI":"10.1137\/140961602"},{"key":"908_CR15","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":"908_CR16","unstructured":"Kone\u010dn\u00fd, J., Richt\u00e1rik, P.: Simple complexity analysis of simplified direct search. Technical report, School of Mathematics, University of Edinburgh, November 2014. arXiv:1410.0390v2"},{"key":"908_CR17","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":"908_CR18","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s00454-014-9639-9","volume":"53","author":"KE Tikhomirov","year":"2015","unstructured":"Tikhomirov, K.E.: On the distance of polytopes with few vertices to the Euclidean ball. Discret. Comput. Geom. 53, 173\u2013181 (2015)","journal-title":"Discret. Comput. Geom."},{"key":"908_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S1052623493250780","volume":"7","author":"V Torczon","year":"1997","unstructured":"Torczon, V.: On the convergence of pattern search algorithms. SIAM J. Optim. 7, 1\u201325 (1997)","journal-title":"SIAM J. Optim."},{"key":"908_CR20","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":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0908-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0908-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0908-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:42Z","timestamp":1559409102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0908-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,3]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["908"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0908-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,3]]}}}