{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T17:41:34Z","timestamp":1778694094062,"version":"3.51.4"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,11,30]],"date-time":"2015-11-30T00:00:00Z","timestamp":1448841600000},"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":["Found Comput Math"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s10208-015-9296-2","type":"journal-article","created":{"date-parts":[[2015,11,30]],"date-time":"2015-11-30T14:47:16Z","timestamp":1448894836000},"page":"527-566","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":566,"title":["Random Gradient-Free Minimization of Convex Functions"],"prefix":"10.1007","volume":"17","author":[{"given":"Yurii","family":"Nesterov","sequence":"first","affiliation":[]},{"given":"Vladimir","family":"Spokoiny","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,30]]},"reference":[{"key":"9296_CR1","unstructured":"A. Agarwal, O. Dekel, and L. Xiao, Optimal algorithms for online convex optimization with multi-point bandit feedback, in Proceedings of the 23rd Annual Conference on Learning, 2010, pp. 2840."},{"key":"9296_CR2","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1137\/110850827","volume":"23","author":"A Agarwal","year":"2013","unstructured":"A. Agarwal, D. Foster, D. Hsu, S. Kakade, and A. Rakhlin, Stochastic convex optimization with bandit feedback,. SIAM J. on Optimization, 23 (2013), pp. 213-240.","journal-title":"SIAM J. on Optimization"},{"key":"9296_CR3","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1145\/1008731.1008733","volume":"51","author":"D Bertsimas","year":"2004","unstructured":"D. Bertsimas and S. Vempala, Solving convex programs by random walks, J. of the ACM, 51 (2004), pp. 540-556.","journal-title":"J. of the ACM"},{"key":"9296_CR4","volume-title":"Optimization and nonsmooth analysis","author":"F Clarke","year":"1983","unstructured":"F. Clarke, Optimization and nonsmooth analysis, Wliley, New York, 1983."},{"key":"9296_CR5","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718768","volume-title":"Introduction to derivative-free optimization","author":"A Conn","year":"2009","unstructured":"A. Conn, K. Scheinberg, and L. Vicente , Introduction to derivative-free optimization. MPS-SIAM series on optimization, SIAM, Philadelphia, 2009."},{"key":"9296_CR6","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF00934526","volume":"39","author":"C Dorea","year":"1983","unstructured":"C. Dorea, Expected number of steps of a random optimization method, JOTA, 39 (1983), pp. 165-171.","journal-title":"JOTA"},{"key":"9296_CR7","unstructured":"J. Duchi, M.I. Jordan, M.J. Wainwright, and A. Wibisono, Finite sample convergence rate of zero-order stochastic optimization methods, in NIPS, 2012, pp. 1448-1456."},{"key":"9296_CR8","unstructured":"A. D. Flaxman, A.T. Kalai, and B.H. Mcmahan, Online convex optimization in the bandit setting: gradient descent without a gradient, in Proceedings of the 16th annual ACM-SIAM symposium on Discrete Algorithms, 2005, pp. 385-394 ."},{"key":"9296_CR9","doi-asserted-by":"crossref","unstructured":"R. Kleinberg, A. Slivkins, and E. Upfal, Multi-armed bandits in metric spaces, in Proceedings of the 40th annual ACM symposium on Theory of Computing, 2008, pp. 681-690.","DOI":"10.1145\/1374376.1374475"},{"key":"9296_CR10","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1137\/S1052623496303470","volume":"9","author":"JC Lagarias","year":"1998","unstructured":"J. C. Lagarias, J. A. Reeds, M. H. Wright, and P. E. Wright, Convergence properties of the Nelder-Mead Simplex Algorithm in low dimensions, SIAM J. Optimization, 9 (1998), pp. 112-147.","journal-title":"SIAM J. Optimization"},{"key":"9296_CR11","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1137\/110830150","volume":"22","author":"JC Lagarias","year":"2012","unstructured":"J. C. Lagarias, B. Poonen, and M. H. Wright, Convergence of the restricted Nelder-Mead algorithm in two dimensions, SIAM J. Optimization, 22 (2012), pp. 501-532.","journal-title":"SIAM J. Optimization"},{"key":"9296_CR12","first-page":"246","volume":"26","author":"J Matyas","year":"1965","unstructured":"J. Matyas, Random optimization. Automation and Remote Control, 26 (1965), pp. 246-253.","journal-title":"Automation and Remote Control"},{"key":"9296_CR13","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"J. A. Nelder and R. Mead, A simplex method for function minimization, Computer Journal, 7 (1965), pp. 308\u20133013","journal-title":"Computer Journal"},{"key":"9296_CR14","doi-asserted-by":"crossref","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"A. Nemirovski, A. Juditsky, G. Lan, and A.Shapiro, Robust Stochastic Approximation approach to Stochastic Programming, SIAM J. on Optimization, 19 (2009), pp. 1574-1609.","journal-title":"SIAM J. on Optimization"},{"key":"9296_CR15","volume-title":"Problem complexity and method efficiency in optimization","author":"A Nemirovsky","year":"1983","unstructured":"A. Nemirovsky and D.Yudin, Problem complexity and method efficiency in optimization, John Wiley and Sons, New York, 1983."},{"key":"9296_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization","author":"Yu Nesterov","year":"2004","unstructured":"Yu. Nesterov, Introductory Lectures on Convex Optimization, Kluwer, Boston, 2004."},{"key":"9296_CR17","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1007\/s10107-005-0633-0","volume":"104","author":"Yu Nesterov","year":"2005","unstructured":"Yu. Nesterov, Lexicographic differentiation of nonsmooth functions\u2019, Mathematical Programming, 104 (2005), pp. 669-700.","journal-title":"Mathematical Programming"},{"key":"9296_CR18","unstructured":"Yu. Nesterov, Random gradient-free minimization of convex functions, CORE Discussion Paper # 2011\/1, (2011)."},{"key":"9296_CR19","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1137\/100802001","volume":"22","author":"Yu Nesterov","year":"2012","unstructured":"Yu. Nesterov, Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J. on Optimization, 22 (2012), pp. 341-362.","journal-title":"SIAM J. on Optimization"},{"key":"9296_CR20","volume-title":"Introduction to Optimization","author":"B Polyak","year":"1987","unstructured":"B. Polyak, Introduction to Optimization. Optimization Software - Inc., Publications Division, New York, 1987."},{"key":"9296_CR21","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF02312467","volume":"59","author":"V Protasov","year":"1996","unstructured":"V. Protasov, Algorithms for approximate calculation of the minimum of a convex function from its values, Mathematical Notes, 59 (1996), pp. 69-74.","journal-title":"Mathematical Notes"},{"key":"9296_CR22","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF00939542","volume":"66","author":"M Sarma","year":"1990","unstructured":"M. Sarma, On the convergence of the Baba and Dorea random optimization methods, JOTA, 66 (1990), pp. 337-343.","journal-title":"JOTA"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9296-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-015-9296-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9296-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9296-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T07:05:16Z","timestamp":1559113516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-015-9296-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,30]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["9296"],"URL":"https:\/\/doi.org\/10.1007\/s10208-015-9296-2","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,30]]}}}