{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T06:24:57Z","timestamp":1773815097651,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003443","name":"Ministry of Education and Science of the Russian Federation","doi-asserted-by":"publisher","award":["strategic academic leadership program \u201criority 2030\u201d (Agreement 075-02-2021-1316, 30.09.2021)"],"award-info":[{"award-number":["strategic academic leadership program \u201criority 2030\u201d (Agreement 075-02-2021-1316, 30.09.2021)"]}],"id":[{"id":"10.13039\/501100003443","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["21-71-30005"],"award-info":[{"award-number":["21-71-30005"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["21-71-30005"],"award-info":[{"award-number":["21-71-30005"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s10957-023-02245-w","type":"journal-article","created":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T03:38:31Z","timestamp":1685590711000},"page":"531-551","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Stopping Rules for Gradient Methods for Non-convex Problems with Additive Noise in Gradient"],"prefix":"10.1007","volume":"198","author":[{"given":"Fedor","family":"Stonyakin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilya","family":"Kuruzov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boris","family":"Polyak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,1]]},"reference":[{"key":"2245_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1017\/S0962492921000039","volume":"30","author":"M Belkin","year":"2021","unstructured":"Belkin, M.: Fit without fear: remarkable mathematical phenomena of deep learning through the prism of interpolation. Acta Numer. 30, 203\u2013248 (2021)","journal-title":"Acta Numer."},{"issue":"3","key":"2245_CR2","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1137\/060676386","volume":"19","author":"A d\u2019Aspremont","year":"2008","unstructured":"d\u2019Aspremont, A.: Smooth optimization with approximate gradient. SIAM J. Optim. 19(3), 1171\u20131183 (2008)","journal-title":"SIAM J. Optim."},{"key":"2245_CR3","unstructured":"Devolder, O.: Exactness, inexactness and stochasticity in first-order methods for large-scale convex optimization. Ph.D. thesis, ICTEAM and CORE, Universit\u00e9 Catholique de Louvain (2013)"},{"issue":"1","key":"2245_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10107-013-0677-5","volume":"146","author":"O Devolder","year":"2014","unstructured":"Devolder, O., Glineur, F., Nesterov, Y.: First-order methods of smooth convex optimization with inexact oracle. Math. Program. 146(1), 37\u201375 (2014)","journal-title":"Math. Program."},{"key":"2245_CR5","unstructured":"Emelin, I.V., Krasnosel\u2019skii, M.A.: The stoppage rule in iterative procedures of solving ill-posed problems. Autom. Remote Control 39, 1783\u20131787,: Translation from Avtom. Telemekh. 1978(12), 59\u201363 (1979). (in Russian)"},{"key":"2245_CR6","unstructured":"Frei, S., Gu, Q.: Proxy convexity: a unified framework for the analysis of neural networks trained by gradient descent (2021). arXiv preprint arXiv:2106.13792"},{"key":"2245_CR7","unstructured":"Garrigos, G., Gower, R.M.: Handbook of convergence theorems for (stochastic) gradient methods (2023). arXiv preprint arXiv:2301.11235"},{"key":"2245_CR8","unstructured":"Gasnikov, A.V.: Modern numerical optimization methods: The universal gradient descent method (2021). arXiv preprint arXiv:1711.00394"},{"key":"2245_CR9","doi-asserted-by":"crossref","unstructured":"Kabanikhin, S.I.: Inverse and Ill-posed Problems. In: Inverse and Ill-posed Problems. deGruyter (2011)","DOI":"10.1515\/9783110224016"},{"key":"2245_CR10","doi-asserted-by":"crossref","unstructured":"Karimi, H., Nutini, J., Schmidt, M.: Linear convergence of gradient and proximal-gradient methods under the polyak-\u0142ojasiewicz condition. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp. 795\u2013811. Springer (2016)","DOI":"10.1007\/978-3-319-46128-1_50"},{"issue":"1","key":"2245_CR11","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)","journal-title":"Math. Program."},{"issue":"1","key":"2245_CR12","doi-asserted-by":"publisher","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 method and its global performance. Math. Program. 108(1), 177\u2013205 (2006)","journal-title":"Math. Program."},{"key":"2245_CR13","unstructured":"Nesterov, Y., Skokov, V.: On the issue of testing unconstrained optimization algorithms. In: Numerical methods of mathematical programming, pp. 77\u201391. Moscow (1980) (in Russian)"},{"issue":"6","key":"2245_CR14","doi-asserted-by":"publisher","first-page":"1272","DOI":"10.1080\/10556788.2019.1669154","volume":"35","author":"B Polyak","year":"2020","unstructured":"Polyak, B., Tremba, A.: New versions of Newton method: step-size choice, convergence domain and under-determined equations. Optim. Methods Softw. 35(6), 1272\u20131303 (2020)","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"2245_CR15","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1016\/0041-5553(63)90382-3","volume":"3","author":"BT Polyak","year":"1963","unstructured":"Polyak, B.T.: Gradient methods for minimizing functionals. Comput. Math. Math. Phys. 3(4), 864\u2013878 (1963). (in Russian)","journal-title":"Comput. Math. Math. Phys."},{"key":"2245_CR16","first-page":"32","volume":"1","author":"BT Polyak","year":"1987","unstructured":"Polyak, B.T.: Introduction to optimization. Optim. Softw. Inc. N. Y. 1, 32 (1987)","journal-title":"Optim. Softw. Inc. N. Y."},{"key":"2245_CR17","unstructured":"Polyak, B.T., Kuruzov, I.A., Stonyakin, F.S.: Stopping rules for gradient methods for non-convex problems with additive noise in gradient (2022) . arXiv preprint arXiv:2205.07544"},{"key":"2245_CR18","volume-title":"Optimization Methods","author":"F Vasilyev","year":"2002","unstructured":"Vasilyev, F.: Optimization Methods. FP, Moscow (2002). (in Russian)"},{"key":"2245_CR19","unstructured":"Vasin, A., Gasnikov, A., Spokoiny, V.: Stopping rules for accelerated gradient methods with additive noise in gradient (2021). arXiv preprint arXiv:2102.02921"},{"key":"2245_CR20","unstructured":"Vorontsova, E., Hildbrand, R., Gasnikov, A., Stonyakin, F.: Convex Optimization (2021). arXiv preprint arXiv:2106.01946"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-023-02245-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-023-02245-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-023-02245-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T18:08:52Z","timestamp":1693418932000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-023-02245-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,1]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["2245"],"URL":"https:\/\/doi.org\/10.1007\/s10957-023-02245-w","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,1]]},"assertion":[{"value":"20 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}