{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:47:31Z","timestamp":1775018851409,"version":"3.50.1"},"reference-count":25,"publisher":"Pleiades Publishing Ltd","issue":"6","license":[{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"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":["Program Comput Soft"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1134\/s0361768823060063","type":"journal-article","created":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T07:02:57Z","timestamp":1701414177000},"page":"535-547","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Gradient-Free Algorithms for Solving Stochastic Saddle Optimization Problems with the Polyak\u2013\u0141ojasiewicz Condition"],"prefix":"10.1134","volume":"49","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-7101-6532","authenticated-orcid":false,"given":"S. I.","family":"Sadykov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1620-9581","authenticated-orcid":false,"given":"A. V.","family":"Lobanov","sequence":"additional","affiliation":[]},{"given":"A. M.","family":"Raigorodskii","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2023,12,1]]},"reference":[{"key":"3768_CR1","volume-title":"Deep Learning","author":"I. Goodfellow","year":"2016","unstructured":"Goodfellow, I., Bengio, Y., and Courville, A., Deep Learning, MIT Press, 2016."},{"key":"3768_CR2","unstructured":"Dai, B., et al., SBEED: Convergent reinforcement learning with nonlinear function approximation, Proc. Int. Conf. Machine Learning, 2018, pp. 1125\u20131134."},{"key":"3768_CR3","unstructured":"Namkoong, H. and Duchi, J.C., Variance-based regularization with convex objectives, Adv. Neural Inf. Process. Syst., 2017, vol. 30."},{"key":"3768_CR4","unstructured":"Xu, L., et al., Maximum margin clustering, Adv. Neural Inf. Process. Syst., 2004, vol. 17."},{"key":"3768_CR5","unstructured":"Sinha, A., et al., Certifying some distributional robustness with principled adversarial training, 2017."},{"key":"3768_CR6","doi-asserted-by":"crossref","unstructured":"Audet, C. and Hare, W., Derivative-free and blackbox optimization, 2017.","DOI":"10.1007\/978-3-319-68913-5"},{"key":"3768_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1093\/comjnl\/3.3.175","volume":"3","author":"H.H. Rosenbrock","year":"1960","unstructured":"Rosenbrock, H.H., An automatic method for finding the greatest or least value of a function, Comput. J., 1960, vol. 3, no. 3, pp. 175\u2013184.","journal-title":"Comput. J."},{"key":"3768_CR8","doi-asserted-by":"crossref","unstructured":"Gasnikov, A., et al., Randomized gradient-free methods in convex optimization, 2022.","DOI":"10.1007\/978-3-030-54621-2_859-1"},{"key":"3768_CR9","unstructured":"Lobanov, A., et al., Gradient-free federated learning methods with l\n               1 and l\n               2-randomization for non-smooth convex stochastic optimization problems, 2022."},{"key":"3768_CR10","unstructured":"Gasnikov, A., et al., The power of first-order smooth optimization for black-box non-smooth problems, Proc. Int. Conf. Machine Learning, 2022, pp. 7241\u20137265."},{"key":"3768_CR11","unstructured":"Bach, F. and Perchet, V., Highly-smooth zero-th order online optimization, Proc. Conf. Learning Theory, 2016, pp. 257\u2013283."},{"key":"3768_CR12","doi-asserted-by":"crossref","unstructured":"Beznosikov, A., Novitskii, V., and Gasnikov, A., One-point gradient-free methods for smooth and non-smooth saddle-point problems, Proc. 20th Int. Conf. Mathematical Optimization Theory and Operations Research (MOTOR), Irkutsk, Russia, 2021, pp. 144\u2013158.","DOI":"10.1007\/978-3-030-77876-7_10"},{"key":"3768_CR13","first-page":"9017","volume":"33","author":"A. Akhavan","year":"2020","unstructured":"Akhavan, A., Pontil, M., and Tsybakov, A., Exploiting higher order smoothness in derivative-free optimization and continuous bandits, Adv. Neural Inf. Process. Syst., 2020, vol. 33, pp. 9017\u20139027.","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"3768_CR14","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1016\/0041-5553(63)90382-3","volume":"3","author":"B.T. Polyak","year":"1963","unstructured":"Polyak, B.T., Gradient methods for the minimisation of functionals, USSR Comput. Math. Math. Phys., 1963, vol. 3, no. 4, pp. 864\u2013878.","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"3768_CR15","unstructured":"\u0141ojasiewicz, S., Une propri\u00e9t\u00e9 topologique des sous-ensembles analytiques r\u00e9els, Les Equations aux D\u00e9riv\u00e9es Partielles, 1963, vol. 117, pp. 87\u201389."},{"key":"3768_CR16","unstructured":"Ajalloeian, A. and Stich, S.U., On the convergence of SGD with biased gradients, 2020."},{"key":"3768_CR17","doi-asserted-by":"crossref","unstructured":"Lobanov, A., Gasnikov, A., and Stonyakin, F., Highly smoothness zero-order methods for solving optimization problems under PL condition, 2023.","DOI":"10.1134\/S0965542524700118"},{"key":"3768_CR18","unstructured":"Yue, P., Fang, C., and Lin, Z., On the lower bound of minimizing Polyak\u2013\u0141ojasiewicz functions, 2022."},{"key":"3768_CR19","unstructured":"Yang, J., Kiyavash, N., and He, N., Global convergence and variance-reduced optimization for a class of nonconvex-nonconcave minimax problems, 2020."},{"key":"3768_CR20","unstructured":"Akhavan, A., et al., Gradient-free optimization of highly smooth functions: Improved analysis and a new algorithm, 2023."},{"key":"3768_CR21","unstructured":"Nouiehed, M., et al., Solving a class of non-convex min-max games using iterative first order methods, Adv. Neural Inf. Process. Syst., 2019, vol. 32."},{"key":"3768_CR22","doi-asserted-by":"publisher","first-page":"1182","DOI":"10.1090\/S0002-9904-1978-14553-4","volume":"84","author":"R. Osserman","year":"1978","unstructured":"Osserman, R., The isoperimetric inequality, Bull. Am. Math. Soc., 1978, vol. 84, no. 6, pp. 1182\u20131238.","journal-title":"Bull. Am. Math. Soc."},{"key":"3768_CR23","first-page":"397","volume":"105","author":"W. Beckner","year":"1989","unstructured":"Beckner, W., A generalized Poincar\u00e9 inequality for Gaussian measures, Proc. Am. Math. Soc., 1989, vol.\u00a0105, no. 2, pp. 397\u2013400.","journal-title":"Proc. Am. Math. Soc."},{"key":"3768_CR24","doi-asserted-by":"crossref","unstructured":"Karimi, H., Nutini, J., and Schmidt, M., Linear convergence of gradient and proximal-gradient methods under the Polyak\u2013\u0141ojasiewicz condition, Proc. Eur. Conf. Machine Learning and Knowledge Discovery in Databases (ECML PKDD), Riva del Garda, Italy, 2016, pp.\u00a0795\u2013811.","DOI":"10.1007\/978-3-319-46128-1_50"},{"key":"3768_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48993-2","volume-title":"Mathematical Analysis II","author":"V.A. Zorich","year":"2016","unstructured":"Zorich, V.A., Mathematical Analysis II, Berlin: Springer, 2016."}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768823060063.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768823060063","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768823060063.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:56:31Z","timestamp":1775012191000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768823060063"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12]]},"references-count":25,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["3768"],"URL":"https:\/\/doi.org\/10.1134\/s0361768823060063","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12]]},"assertion":[{"value":"13 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}