{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T00:53:55Z","timestamp":1767833635696,"version":"3.49.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031229893","type":"print"},{"value":"9783031229909","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22990-9_2","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T01:22:43Z","timestamp":1672536163000},"page":"18-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Gradient-Type Methods for\u00a0Optimization Problems with\u00a0Polyak-\u0141ojasiewicz Condition: Early Stopping and\u00a0Adaptivity to\u00a0Inexactness Parameter"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2715-5489","authenticated-orcid":false,"given":"Ilya A.","family":"Kuruzov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9250-4438","authenticated-orcid":false,"given":"Fedor S.","family":"Stonyakin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5470-0182","authenticated-orcid":false,"given":"Mohammad S.","family":"Alkousa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Beck, A.: First-Order Methods in Optimization. Society for Industrial and Applied Mathematics, Philadelphia (2017)","DOI":"10.1137\/1.9781611974997"},{"key":"2_CR2","unstructured":"Du, S.S., Lee, J.D., Li, H., Wang, L., Zhai, X.: Gradient Descent Finds Global Minima of Deep Neural Networks (2018). https:\/\/arxiv.org\/pdf\/1811.03804.pdf"},{"issue":"1\u20132","key":"2_CR3","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, Yu.: First-order methods of smooth convex optimization with inexact oracle. Math. Program. 146(1\u20132), 37\u201375 (2014)","journal-title":"Math. Program."},{"key":"2_CR4","unstructured":"Devolder, O.: Exactness, inexactness and stochasticity in first-order methods for largescale convex optimization: Ph.D. thesis (2013)"},{"issue":"3","key":"2_CR5","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. Opt. 19(3), 1171\u20131183 (2008)","journal-title":"SIAM J. Opt."},{"key":"2_CR6","unstructured":"Fazel, M., Ge, R., Kakade, S., Mesbahi, M.: Global convergence of policy gradient methods for the linear quadratic regulator. In: Proceedings of the 35th International Conference on Machine Learning, PMLR 1980, Stockholm, Sweden, pp. 1466\u20131475 (2018)"},{"key":"2_CR7","unstructured":"Gasnikov, A.V.: Modern Numerical Optimization Methods. The Method of Universal Gradient Descent. A Textbook, 2nd edn. p. 272. MCCME (2021). (in Russian)"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Kabanikhin, S.I.: Inverse and ill-posed problems: theory and applications. Walter de Gruyter, p. 475 (2011). https:\/\/doi.org\/10.1515\/9783110224016","DOI":"10.1515\/9783110224016"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/978-3-319-46128-1_50","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"H Karimi","year":"2016","unstructured":"Karimi, H., Nutini, J., Schmidt, M.: Linear convergence of gradient and proximal-gradient methods under the Polyak-\u0141ojasiewicz condition. In: Frasconi, P., Landwehr, N., Manco, G., Vreeken, J. (eds.) ECML PKDD 2016. LNCS (LNAI), vol. 9851, pp. 795\u2013811. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46128-1_50"},{"key":"2_CR10","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-030-92711-0_2","volume-title":"Advances in Optimization and Applications","author":"IA Kuruzov","year":"2021","unstructured":"Kuruzov, I.A., Stonyakin, F.S.: Sequential subspace optimization for\u00a0quasar-convex optimization problems with\u00a0inexact gradient. In: Olenev, N.N., Evtushenko, Y.G., Ja\u0107imovi\u0107, M., Khachay, M., Malkova, V. (eds.) OPTIMA 2021. CCIS, vol. 1514, pp. 19\u201333. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92711-0_2"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Nesterov, Yu.: Universal gradient methods for convex optimization problems. Math. Program. A(152), 381\u2013404 (2015)","DOI":"10.1007\/s10107-014-0790-0"},{"key":"2_CR12","unstructured":"Nesterov, Yu.E., Skokov, V.A.: Testing unconstrained minimization algorithms. In: The Book: \u201cComputational Methods of Mathematical Programming\u201d. CEMI Ac. of Sc. M, pp. 77\u201391 (1980). (in Russian)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Nesterov, Yu.: Introductory Lectures on Convex Optimization. Springer Optimization and Its Applications, vol. 137. Springer, Heidelberg (2018)","DOI":"10.1007\/978-3-319-91578-4_2"},{"key":"2_CR14","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). https:\/\/arxiv.org\/pdf\/2205.07544.pdf"},{"issue":"4","key":"2_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)","journal-title":"Comput. Math. Math. Phys."},{"issue":"23","key":"2_CR16","doi-asserted-by":"publisher","first-page":"17715","DOI":"10.1007\/s00500-020-05030-3","volume":"24","author":"YD Sergeyev","year":"2020","unstructured":"Sergeyev, Y.D., Candelieri, A., Kvasov, D.E., Perego, R.: Safe global optimization of expensive noisy black-box functions in the $$\\delta $$-Lipschitz framework. Soft. Comput. 24(23), 17715\u201317735 (2020). https:\/\/doi.org\/10.1007\/s00500-020-05030-3","journal-title":"Soft. Comput."},{"issue":"6","key":"2_CR17","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1080\/10556788.2021.1924714","volume":"36","author":"F Stonyakin","year":"2021","unstructured":"Stonyakin, F., et al.: Inexact relative smoothness and strong convexity for optimization and variational inequalities by inexact model. Optim. Methods Softw. 36(6), 1155\u20131201 (2021)","journal-title":"Optim. Methods Softw."},{"key":"2_CR18","volume-title":"Global Optimization with Non-convex Constraints: Sequential and Parallel Algorithms","author":"RG Strongin","year":"2013","unstructured":"Strongin, R.G., Sergeyev, Y.D.: Global Optimization with Non-convex Constraints: Sequential and Parallel Algorithms, vol. 45. Springer, Cham (2013)"},{"issue":"5","key":"2_CR19","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1007\/s10208-017-9365-9","volume":"18","author":"J Sun","year":"2018","unstructured":"Sun, J., Qu, Q., Wright, J.: A geometric analysis of phase retrieval. Found. Comput. Math. 18(5), 1131\u20131198 (2018)","journal-title":"Found. Comput. Math."},{"key":"2_CR20","volume-title":"Optimization Methods","author":"F Vasilyev","year":"2002","unstructured":"Vasilyev, F.: Optimization Methods. Fizmatlit, Moscow (2002). (in Russian)"},{"key":"2_CR21","unstructured":"Vasin, A., Gasnikov, A., Spokoiny, V.: Stopping rules for accelerated gradient methods with additive noise in gradient (2021). https:\/\/arxiv.org\/pdf\/2102.02921.pdf"}],"container-title":["Communications in Computer and Information Science","Advances in Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22990-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:21:12Z","timestamp":1672539672000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22990-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031229893","9783031229909"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22990-9_2","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OPTIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Petrovac","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montenegro","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"optima2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/agora.guru.ru\/display.php?conf=OPTIMA-2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}