{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:48:24Z","timestamp":1766137704204,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2021,4,29]],"date-time":"2021-04-29T00:00:00Z","timestamp":1619654400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,29]],"date-time":"2021-04-29T00:00:00Z","timestamp":1619654400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100012190","name":"Ministry of Science and Higher Education of the Russian Federation","doi-asserted-by":"crossref","award":["075-00337-20-03, project no. 0714-2020-0005","075-00337-20-03, project no. 0714-2020-0005"],"award-info":[{"award-number":["075-00337-20-03, project no. 0714-2020-0005","075-00337-20-03, project no. 0714-2020-0005"]}],"id":[{"id":"10.13039\/501100012190","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s11590-021-01742-z","type":"journal-article","created":{"date-parts":[[2021,4,29]],"date-time":"2021-04-29T10:03:22Z","timestamp":1619690602000},"page":"2123-2143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Zeroth-order methods for noisy H\u00f6lder-gradient functions"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6609-3738","authenticated-orcid":false,"given":"Innokentiy","family":"Shibaev","sequence":"first","affiliation":[]},{"given":"Pavel","family":"Dvurechensky","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Gasnikov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,29]]},"reference":[{"key":"1742_CR1","unstructured":"Baydin, A.G., Pearlmutter, B.A., Radul, A.A., Siskind, J.M.: Automatic differentiation in machine learning: a survey (2018). arxiv:1502.05767"},{"key":"1742_CR2","unstructured":"Berahas, A.S., Cao, L., Choromanski, K., Scheinberg, K.: A theoretical and empirical comparison of gradient approximations in derivative-free optimization (2019). arxiv:1905.01332"},{"key":"1742_CR3","unstructured":"Berahas, A.S., Cao, L., Scheinberg, K.: Global convergence rate analysis of a generic line search algorithm with noise (2019). arxiv:1910.04055"},{"key":"1742_CR4","unstructured":"Bolte, J., Glaudin, L., Pauwels, E., Serrurier, M.: A H\u00f6lderian backtracking method for min-max and min-min problems (2020). arxiv:2007.08810"},{"key":"1742_CR5","volume-title":"Algorithms for Minimization Without Derivatives","author":"R Brent","year":"1973","unstructured":"Brent, R.: Algorithms for Minimization Without Derivatives. Dover Books on Mathematics, Dover Publications (1973)"},{"key":"1742_CR6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768","author":"AR Conn","year":"2009","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to derivative-free optimization. Soc. Ind. Appl. Math. (2009). https:\/\/doi.org\/10.1137\/1.9780898718768","journal-title":"Soc. Ind. Appl. Math."},{"key":"1742_CR7","unstructured":"Dvurechensky, P.: Gradient method with inexact oracle for composite non-convex optimization (2017). arxiv:1703.09180"},{"issue":"1","key":"1742_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1214\/aoms\/1177699070","volume":"38","author":"V Fabian","year":"1967","unstructured":"Fabian, V.: Stochastic approximation of minima with improved asymptotic speed. Ann. Math. Statist. 38(1), 191\u2013200 (1967). https:\/\/doi.org\/10.1214\/aoms\/1177699070","journal-title":"Ann. Math. Statist."},{"issue":"4","key":"1742_CR9","doi-asserted-by":"publisher","first-page":"2341","DOI":"10.1137\/120880811","volume":"23","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi, S., Lan, G.: Stochastic first- and zeroth-order methods for nonconvex stochastic programming. SIAM J. Optim. 23(4), 2341\u20132368 (2013). https:\/\/doi.org\/10.1137\/120880811","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1742_CR10","first-page":"309","volume":"20","author":"K Kim","year":"1984","unstructured":"Kim, K., Nesterov, Y., Skokov, V., Cherkasskii, B.: Effektivnii algoritm vychisleniya proisvodnyh i ekstremalnye zadachi (efficient algorithm for calculation of derivatives and extreme problems). Ekonomika i matematicheskie metody 20(2), 309\u2013318 (1984)","journal-title":"Ekonomika i matematicheskie metody"},{"key":"1742_CR11","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1017\/S0962492919000060","volume":"28","author":"J Larson","year":"2019","unstructured":"Larson, J., Menickelly, M., Wild, S.M.: Derivative-free optimization methods. Acta Numerica 28, 287\u2013404 (2019). https:\/\/doi.org\/10.1017\/S0962492919000060","journal-title":"Acta Numerica"},{"key":"1742_CR12","first-page":"3727","volume":"31","author":"S Liu","year":"2018","unstructured":"Liu, S., Kailkhura, B., Chen, P.Y., Ting, P., Chang, S., Amini, L.: Zeroth-order stochastic variance reduction for nonconvex optimization. Adv. Neural Inf. Process. Syst. 31, 3727\u20133737 (2018)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"1","key":"1742_CR13","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10107-014-0790-0","volume":"152","author":"Y Nesterov","year":"2015","unstructured":"Nesterov, Y.: Universal gradient methods for convex optimization problems. Math. Program. 152(1), 381\u2013404 (2015). https:\/\/doi.org\/10.1007\/s10107-014-0790-0","journal-title":"Math. Program."},{"issue":"2","key":"1742_CR14","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s10208-015-9296-2","volume":"17","author":"Y Nesterov","year":"2015","unstructured":"Nesterov, Y., Spokoiny, V.: Random gradient-free minimization of convex functions. Found. Comput. Math. 17(2), 527\u2013566 (2015). https:\/\/doi.org\/10.1007\/s10208-015-9296-2","journal-title":"Found. Comput. Math."},{"issue":"3","key":"1742_CR15","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1093\/comjnl\/3.3.175","volume":"3","author":"HH Rosenbrock","year":"1960","unstructured":"Rosenbrock, H.H.: An automatic method for finding the greatest or least value of a function. Comput. J. 3(3), 175\u2013184 (1960). https:\/\/doi.org\/10.1093\/comjnl\/3.3.175","journal-title":"Comput. J."},{"key":"1742_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0846-1","author":"GL Saeed Ghadimi","year":"2013","unstructured":"Saeed Ghadimi, G.L., Zhang, H.: Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization. Math. Program. (2013). https:\/\/doi.org\/10.1007\/s10107-014-0846-1","journal-title":"Math. Program."},{"key":"1742_CR17","doi-asserted-by":"publisher","DOI":"10.1002\/0471722138","volume-title":"Introduction to Stochastic Search and Optimization","author":"JC Spall","year":"2003","unstructured":"Spall, J.C.: Introduction to Stochastic Search and Optimization, 1st edn. Wiley, New York, NY, USA (2003)","edition":"1"},{"key":"1742_CR18","unstructured":"Sutton, R..S., Barto, A..G.: Reinforcement learning: An introduction. MIT press (2018)"},{"key":"1742_CR19","doi-asserted-by":"publisher","first-page":"6202","DOI":"10.1609\/aaai.v34i04.6086","volume":"34","author":"J Wang","year":"2020","unstructured":"Wang, J., Liu, Y., Li, B.: Reinforcement learning with perturbed rewards. Proc. AAAI Conf. Artif. Intell. 34, 6202\u20136209 (2020). https:\/\/doi.org\/10.1609\/aaai.v34i04.6086","journal-title":"Proc. AAAI Conf. Artif. Intell."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01742-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01742-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01742-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T12:13:10Z","timestamp":1659615190000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01742-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,29]]},"references-count":19,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["1742"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01742-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2021,4,29]]},"assertion":[{"value":"10 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The research of A. Gasnikov and P. Dvurechensly was partially supported by the Ministry of Science and Higher Education of the Russian Federation (Goszadaniye) 075-00337-20-03, project no. 0714-2020-0005.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Funding"}},{"value":"Not applicable","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Availability of data and material"}},{"value":"Not applicable","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}