{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T19:28:53Z","timestamp":1780082933058,"version":"3.54.0"},"reference-count":55,"publisher":"Informa UK Limited","issue":"6","license":[{"start":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T00:00:00Z","timestamp":1686182400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100020409","name":"Analytical Center for the Government of the Russian Federation","doi-asserted-by":"publisher","award":["000000D730321P5Q0002"],"award-info":[{"award-number":["000000D730321P5Q0002"]}],"id":[{"id":"10.13039\/100020409","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018887","name":"Moscow Institute of Physics and Technology","doi-asserted-by":"crossref","award":["70-2021-00138"],"award-info":[{"award-number":["70-2021-00138"]}],"id":[{"id":"10.13039\/501100018887","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2023,11,2]]},"DOI":"10.1080\/10556788.2023.2212503","type":"journal-article","created":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T14:59:37Z","timestamp":1686236377000},"page":"1180-1229","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":9,"title":["Accelerated gradient methods with absolute and relative noise in the gradient"],"prefix":"10.1080","volume":"38","author":[{"given":"Artem","family":"Vasin","sequence":"first","affiliation":[{"name":"Moscow Institute of Physics and Technology, Research Center of Applied AI Systems, Dolgoprudny, Russia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Gasnikov","sequence":"additional","affiliation":[{"name":"Moscow Institute of Physics and Technology, Lab Mathematical Methods of Optimization, Dolgoprudny, Russia"},{"name":"Institute for Information Transmission Problems, Sector 7, Moscow, Russia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1201-2343","authenticated-orcid":false,"given":"Pavel","family":"Dvurechensky","sequence":"additional","affiliation":[{"name":"Weierstrass Institute for Applied Analysis and Stochastics, Research Group Stochastic Algorithms and Nonparametric Statistics, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vladimir","family":"Spokoiny","sequence":"additional","affiliation":[{"name":"Weierstrass Institute for Applied Analysis and Stochastics, Research Group Stochastic Algorithms and Nonparametric Statistics, Berlin, Germany"},{"name":"Humboldt-University of Berlin, Institute of Mathematics, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2023,6,8]]},"reference":[{"key":"e_1_3_4_2_1","unstructured":"A. Ajalloeian and S.U. Stich Analysis of SGD with Biased Gradient Estimators arXiv preprint arXiv:2008.00051 (2020)."},{"key":"e_1_3_4_3_1","first-page":"9017","article-title":"Exploiting higher order smoothness in derivative-free optimization and continuous bandits","volume":"33","author":"Akhavan A.","year":"2020","unstructured":"A. Akhavan, M. Pontil, and A. Tsybakov, Exploiting higher order smoothness in derivative-free optimization and continuous bandits, Adv. Neural. Inf. Process. Syst. 33 (2020), pp.\u00a09017\u20139027.","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"e_1_3_4_4_1","unstructured":"F. Bach and V. Perchet Highly-smooth zero-th order online optimization in 29th Annual Conference on Learning Theory V. Feldman A. Rakhlin and O. Shamir eds. Proceedings of Machine Learning Research Vol. 49 23\u201326 Jun Columbia University New York New York USA PMLR 2016 pp.\u00a0257\u2013283. Available at http:\/\/proceedings.mlr.press\/v49\/bach16.html."},{"key":"e_1_3_4_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997"},{"key":"e_1_3_4_6_1","unstructured":"A. Belloni T. Liang H. Narayanan and A. Rakhlin Escaping the Local Minima via Simulated Annealing: Optimization of Approximately Convex Functions in Proceedings of The 28th Conference on Learning Theory P. Gr\u00fcnwald E. Hazan and S. Kale eds. Proceedings of Machine Learning Research Vol. 40 3\u20136 Jul Paris France PMLR 2015 pp.\u00a0240\u2013265. Available at http:\/\/proceedings.mlr.press\/v40\/Belloni15.html."},{"key":"e_1_3_4_7_1","unstructured":"A. Ben-Tal and A. Nemirovski Lectures on Modern Convex Optimization (Lecture Notes) Personal web-page of A. Nemirovski 2015."},{"key":"e_1_3_4_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-021-09513-z"},{"key":"e_1_3_4_9_1","doi-asserted-by":"crossref","unstructured":"A. Beznosikov A. Sadiev and A. Gasnikov Gradient-free methods with inexact oracle for convex-concave stochastic saddle-point problem in International Conference on Mathematical Optimization Theory and Operations Research Springer 2020 pp.\u00a0105\u2013119.","DOI":"10.1007\/978-3-030-58657-7_11"},{"key":"e_1_3_4_10_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000050"},{"key":"e_1_3_4_11_1","unstructured":"M. Cohen J. Diakonikolas and L. Orecchia On acceleration with noise-corrupted gradients in International Conference on Machine Learning PMLR 2018 pp.\u00a01019\u20131028."},{"key":"e_1_3_4_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768"},{"key":"e_1_3_4_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/060676386"},{"key":"e_1_3_4_14_1","unstructured":"O. Devolder Stochastic first order methods in smooth convex optimization CORE Discussion Paper 2011\/70 (2011)."},{"key":"e_1_3_4_15_1","unstructured":"O. Devolder Exactness inexactness and stochasticity in first-order methods for large-scale convex optimization Ph.D. diss. ICTEAM and CORE Universit\u00e9 Catholique de Louvain 2013."},{"key":"e_1_3_4_16_1","first-page":"47","article-title":"First-order methods with inexact oracle: The strongly convex case","volume":"2013016","author":"Devolder O.","year":"2013","unstructured":"O. Devolder, F. Glineur, and Y. Nesterov, First-order methods with inexact oracle: The strongly convex case, CORE Discuss. Papers 2013016 (2013), p. 47.","journal-title":"CORE Discuss. Papers"},{"key":"e_1_3_4_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0677-5"},{"key":"e_1_3_4_18_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2022.1287"},{"key":"e_1_3_4_19_1","doi-asserted-by":"publisher","DOI":"10.1515\/jiip-2020-0068"},{"key":"e_1_3_4_20_1","first-page":"515","article-title":"Accelerated and non accelerated stochastic gradient descent in model generality","volume":"108","author":"Dvinskikh D.M.","year":"2020","unstructured":"D.M. Dvinskikh, A.I. Turin, A.V. Gasnikov, and S.S. Omelchenko, Accelerated and non accelerated stochastic gradient descent in model generality, Mat. Zametki 108 (2020), pp.\u00a0515\u2013528.","journal-title":"Mat. Zametki"},{"key":"e_1_3_4_21_1","volume-title":"Numerical Methods in Large-Scale Optimization: Inexact Oracle and Primal-Dual Analysis","author":"Dvurechensky P.","year":"2020","unstructured":"P. Dvurechensky, Numerical Methods in Large-Scale Optimization: Inexact Oracle and Primal-Dual Analysis, HSE, Moscow, 2020."},{"key":"e_1_3_4_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-016-0999-6"},{"key":"e_1_3_4_23_1","unstructured":"P. Dvurechensky A. Gasnikov and A. Kroshnin Computational optimal transport: Complexity by accelerated gradient descent is better than by Sinkhorn's algorithm in Proceedings of the 35th International Conference on Machine Learning J. Dy and A. Krause eds. Proceedings of Machine Learning Research Vol. 80. 2018 pp.\u00a01367\u20131376. arXiv:1802.04367."},{"key":"e_1_3_4_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejco.2021.100015"},{"key":"e_1_3_4_25_1","doi-asserted-by":"publisher","DOI":"10.1561\/2400000036"},{"key":"e_1_3_4_26_1","unstructured":"Y.G. Evtushenko Optimization and fast automatic differentiation Computing Center of RAS Moscow (2013)."},{"key":"e_1_3_4_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01665-8"},{"key":"e_1_3_4_28_1","unstructured":"A. Gasnikov Universal gradient descent arXiv preprint arXiv:1711.00394 (2017)."},{"key":"e_1_3_4_29_1","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542518010050"},{"key":"e_1_3_4_30_1","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542516040084"},{"key":"e_1_3_4_31_1","unstructured":"A. Gasnikov S. Kabanikhin A. Mohammed and M. Shishlenin Convex optimization in hilbert space with applications to inverse problems arXiv preprint arXiv:1703.00267 (2017)."},{"key":"e_1_3_4_32_1","volume-title":"Deep Learning","author":"Goodfellow I.","year":"2016","unstructured":"I. Goodfellow, Y. Bengio, A. Courville, and Y. Bengio, Deep Learning, Vol. 1, MIT Press, Cambridge, 2016."},{"key":"e_1_3_4_33_1","unstructured":"E. Gorbunov P. Dvurechensky and A. Gasnikov An accelerated method for derivative-free smooth stochastic convex optimization arXiv preprint arXiv:1802.09022 (2018)."},{"key":"e_1_3_4_34_1","unstructured":"E. Gorbunov D. Dvinskikh and A. Gasnikov Optimal decentralized distributed algorithms for stochastic convex optimization arXiv preprint arXiv:1911.07363 (2019)."},{"key":"e_1_3_4_35_1","doi-asserted-by":"publisher","DOI":"10.1515\/9783110224016"},{"key":"e_1_3_4_36_1","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2019.1711079"},{"key":"e_1_3_4_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1381678"},{"key":"e_1_3_4_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-39568-1"},{"key":"e_1_3_4_39_1","first-page":"332","article-title":"Regularizing properties of the conjugate gradient method for ill-posed problems","volume":"26","author":"Nemirovski A.S.","year":"1986","unstructured":"A.S. Nemirovski, Regularizing properties of the conjugate gradient method for ill-posed problems, Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki 26 (1986), pp.\u00a0332\u2013347.","journal-title":"Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki"},{"key":"e_1_3_4_40_1","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"Nemirovsky A.","year":"1983","unstructured":"A. Nemirovsky and D. Yudin, Problem Complexity and Method Efficiency in Optimization, J. Wiley & Sons, New York, 1983."},{"key":"e_1_3_4_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91578-4"},{"key":"e_1_3_4_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-015-9296-2"},{"key":"e_1_3_4_43_1","doi-asserted-by":"crossref","unstructured":"V. Novitskii and A. Gasnikov Improved exploiting higher order smoothness in derivative-free optimization and continuous bandit arXiv preprint arXiv:2101.03821 (2021).","DOI":"10.1007\/s11590-022-01863-z"},{"key":"e_1_3_4_44_1","unstructured":"F. Pedregosa and D. Scieur Average-case acceleration through spectral density estimation arXiv preprint arXiv:2002.04756 (2020)."},{"key":"e_1_3_4_45_1","doi-asserted-by":"crossref","unstructured":"B. Poljak Iterative algorithms for singular minimization problems in Nonlinear Programming 4 Elsevier 1981 pp.\u00a0147\u2013166.","DOI":"10.1016\/B978-0-12-468662-5.50011-2"},{"key":"e_1_3_4_46_1","volume-title":"Introduction to Optimization","author":"Polyak B.","year":"1987","unstructured":"B. Polyak, Introduction to Optimization, Optimization Software, New York, 1987."},{"key":"e_1_3_4_47_1","first-page":"45","article-title":"Optimal order of accuracy of search algorithms in stochastic optimization","volume":"26","author":"Polyak B.T.","year":"1990","unstructured":"B.T. Polyak and A.B. Tsybakov, Optimal order of accuracy of search algorithms in stochastic optimization, Probl. Peredachi Inform. 26 (1990), pp.\u00a045\u201353.","journal-title":"Probl. Peredachi Inform."},{"key":"e_1_3_4_48_1","first-page":"4745","article-title":"Algorithms and matching lower bounds for approximately-convex optimization","volume":"29","author":"Risteski A.","year":"2016","unstructured":"A. Risteski and Y. Li, Algorithms and matching lower bounds for approximately-convex optimization, Adv. Neural. Inf. Process. Syst. 29 (2016), pp.\u00a04745\u20134753.","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"e_1_3_4_49_1","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173"},{"key":"e_1_3_4_50_1","unstructured":"D. Scieur and F. Pedregosa Universal asymptotic optimality of polyak momentum in International Conference on Machine Learning PMLR 2020 pp.\u00a08565\u20138572."},{"key":"e_1_3_4_51_1","unstructured":"F. Stonyakin Adaptive methods for variational inequalities minimization problems and functional with generalized growth condition MIPT. Habilitation (2020)."},{"key":"e_1_3_4_52_1","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2021.1924714"},{"key":"e_1_3_4_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1009-3"},{"key":"e_1_3_4_54_1","unstructured":"A. Tyurin Development of a method for solving structural optimization problems HSE. PhD Thesis (2020)."},{"key":"e_1_3_4_55_1","unstructured":"F. Vasilyev Optimization Methods Moscow Russia: FP 2002."},{"key":"e_1_3_4_56_1","unstructured":"S. Vaswani F. Bach and M. Schmidt Fast and faster convergence of SGD for over-parameterized models and an accelerated perceptron in The 22nd International Conference on Artificial Intelligence and Statistics PMLR 2019 pp.\u00a01195\u20131204."}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2023.2212503","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,24]],"date-time":"2023-11-24T14:17:42Z","timestamp":1700835462000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2023.2212503"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,8]]},"references-count":55,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,11,2]]}},"alternative-id":["10.1080\/10556788.2023.2212503"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2023.2212503","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,8]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2022-03-15","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-05-04","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-06-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}