{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T19:18:19Z","timestamp":1770923899446,"version":"3.50.1"},"reference-count":59,"publisher":"Informa UK Limited","issue":"5","funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["000000D730321P5Q0002"],"award-info":[{"award-number":["000000D730321P5Q0002"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100020409","name":"Analytical Center for the Government of the Russian Federation","doi-asserted-by":"crossref","award":["70-2021-00138"],"award-info":[{"award-number":["70-2021-00138"]}],"id":[{"id":"10.13039\/100020409","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100018887","name":"Moscow Institute of Physics and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100018887","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2025,9,3]]},"DOI":"10.1080\/10556788.2023.2280062","type":"journal-article","created":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T22:57:31Z","timestamp":1706137051000},"page":"1127-1152","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":1,"title":["Decentralized saddle point problems via non-Euclidean mirror prox"],"prefix":"10.1080","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3435-2680","authenticated-orcid":false,"given":"Alexander","family":"Rogozin","sequence":"first","affiliation":[{"name":"Moscow Institute of Physics and Technology","place":["Moscow, Russia"]},{"name":"HSE University","place":["Moscow, Russia"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3217-3614","authenticated-orcid":false,"given":"Aleksandr","family":"Beznosikov","sequence":"additional","affiliation":[{"name":"Moscow Institute of Physics and Technology","place":["Moscow, Russia"]},{"name":"HSE University","place":["Moscow, Russia"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1757-1021","authenticated-orcid":false,"given":"Darina","family":"Dvinskikh","sequence":"additional","affiliation":[{"name":"HSE University","place":["Moscow, Russia"]}]},{"given":"Dmitry","family":"Kovalev","sequence":"additional","affiliation":[{"name":"King Abdullah University of Science and Technology","place":["Thuwal, Saudi Arabia"]}]},{"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 Statistics","place":["Berlin, Germany"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7386-039X","authenticated-orcid":false,"given":"Alexander","family":"Gasnikov","sequence":"additional","affiliation":[{"name":"Moscow Institute of Physics and Technology","place":["Moscow, Russia"]},{"name":"HSE University","place":["Moscow, Russia"]},{"name":"IITP RAS","place":["Moscow, Russia"]}]}],"member":"301","published-online":{"date-parts":[[2024,1,24]]},"reference":[{"key":"e_1_3_4_2_1","article-title":"Communication complexity of distributed convex learning and optimization","volume":"28","author":"Arjevani Y.","year":"2015","unstructured":"Y. Arjevani and O. Shamir, Communication complexity of distributed convex learning and optimization. Adv. Neural Inf 28 (2015).","journal-title":"Adv. Neural Inf"},{"key":"e_1_3_4_3_1","series-title":"Lecture notes","volume-title":"Iterative Solution of Large Linear Systems","author":"Auzinger W.","year":"2011","unstructured":"W. Auzinger and J. Melenk, Iterative Solution of Large Linear Systems, Lecture notes, TU Wien, 2011."},{"key":"e_1_3_4_4_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000015"},{"key":"e_1_3_4_5_1","unstructured":"F. Bach J. Mairal and J. Ponce Convex sparse matrix factorizations (2008). arXiv preprint arXiv:0812.1869."},{"key":"e_1_3_4_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/141000439"},{"key":"e_1_3_4_7_1","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050"},{"key":"e_1_3_4_8_1","unstructured":"A. Ben-Tal and A. Nemirovski Lectures on modern convex optimization (2012). Available at https:\/\/www2.isye.gatech.edu\/\u00f1emirovs\/Lect_ModConvOpt 2011."},{"key":"e_1_3_4_9_1","unstructured":"A. Beznosikov V. Samokhin and A. Gasnikov Distributed saddle-point problems: Lower bounds near-optimal and robust algorithms. arXiv preprint arXiv:2010.13112 2020."},{"key":"e_1_3_4_10_1","first-page":"8172","article-title":"Distributed saddle-point problems under data similarity","volume":"34","author":"Beznosikov A.","year":"2021","unstructured":"A. Beznosikov, G. Scutari, A. Rogozin, and A. Gasnikov, Distributed saddle-point problems under data similarity, Adv. Neural. Inf. Process. Syst. 34 (2021), pp. 8172\u20138184.","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"e_1_3_4_11_1","doi-asserted-by":"publisher","DOI":"10.3150\/13-BEJ585"},{"key":"e_1_3_4_12_1","unstructured":"S. Bubeck Theory of convex optimization for machine learning (2014). arXiv preprint arXiv:1405.4980 p. 15."},{"key":"e_1_3_4_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-010-0251-1"},{"key":"e_1_3_4_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-018-9800-z"},{"key":"e_1_3_4_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M1301047"},{"key":"e_1_3_4_16_1","doi-asserted-by":"publisher","DOI":"10.1515\/jiip-2020-0068"},{"key":"e_1_3_4_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9029798"},{"key":"e_1_3_4_18_1","unstructured":"D. Dvinskikh and D. Tiapkin Improved complexity bounds in wasserstein barycenter problem in Proceedings of The 24th International Conference on Artificial Intelligence and Statistics PMLR 2021 pp. 1738\u20131746."},{"key":"e_1_3_4_19_1","first-page":"10760","article-title":"Decentralize and randomize: Faster algorithm for wasserstein barycenters","volume":"31","author":"Dvurechenskii P.","year":"2018","unstructured":"P. Dvurechenskii, D. Dvinskikh, A. Gasnikov, C. Uribe, and A. Nedich, Decentralize and randomize: Faster algorithm for wasserstein barycenters, Adv. Neural. Inf. Process. Syst. 31 (2018), pp. 10760\u201310770.","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"e_1_3_4_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/09076934X"},{"key":"e_1_3_4_21_1","volume-title":"Finite-dimensional Variational Inequalities and Complementarity Problems","author":"Facchinei F.","year":"2007","unstructured":"F. Facchinei and J.-S. Pang, Finite-dimensional Variational Inequalities and Complementarity Problems, Springer Science & Business Media, 2007."},{"key":"e_1_3_4_22_1","unstructured":"A. Gasnikov Universal gradient descent (2017). arXiv preprint arXiv:1711.00394."},{"key":"e_1_3_4_23_1","unstructured":"G. Gidel H. Berard G. Vignoud P. Vincent and S. Lacoste-Julien A variational inequality perspective on generative adversarial networks (2018). arXiv preprint arXiv:1802.10551."},{"key":"e_1_3_4_24_1","unstructured":"E. Gorbunov D. Dvinskikh and A. Gasnikov Optimal decentralized distributed algorithms for stochastic convex optimization (2019). arXiv:1911.07363."},{"key":"e_1_3_4_25_1","volume-title":"High-Dimensional Optimization and Probability: With a View Towards Data Science","author":"Gorbunov E.","year":"2022","unstructured":"E. Gorbunov, A. Rogozin, A. Beznosikov, D. Dvinskikh, and A. Gasnikov, High-Dimensional Optimization and Probability: With a View Towards Data Science, Springer, 2022."},{"key":"e_1_3_4_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-19992-4_20"},{"key":"e_1_3_4_27_1","doi-asserted-by":"publisher","DOI":"10.1134\/S1064562419020042"},{"key":"e_1_3_4_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2298712"},{"key":"e_1_3_4_29_1","first-page":"11359","article-title":"A direct tilde O(1\/\u03f5)\u00a0iteration parallel algorithm for optimal transport","volume":"32","author":"Jambulapati A.","year":"2019","unstructured":"A. Jambulapati, A. Sidford, and K. Tian, A direct tilde O(1\/\u03f5)\u00a0iteration parallel algorithm for optimal transport, Adv. Neural. Inf. Process. Syst. 32 (2019), pp. 11359\u201311370.","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"e_1_3_4_30_1","unstructured":"Y. Jin and A. Sidford Efficiently solving mdps with stochastic mirror descent in International Conference on Machine Learning PMLR 2020 pp. 4890\u20134900."},{"key":"e_1_3_4_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102399"},{"key":"e_1_3_4_32_1","first-page":"31073","article-title":"Optimal algorithms for decentralized stochastic variational inequalities","volume":"35","author":"Kovalev D.","year":"2022","unstructured":"D. Kovalev, A. Beznosikov, A. Sadiev, M. Persiianov, P. Richt\u00e1rik, and A. Gasnikov, Optimal algorithms for decentralized stochastic variational inequalities. Adv. Neural Inf. Process. Syst. 35 (2022), pp. 31073\u201331088.","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"e_1_3_4_33_1","first-page":"18342","article-title":"Optimal and practical algorithms for smooth and strongly convex decentralized optimization","volume":"33","author":"Kovalev D.","year":"2020","unstructured":"D. Kovalev, A. Salim, and P. Richt\u00e1rik, Optimal and practical algorithms for smooth and strongly convex decentralized optimization, Adv. Neural. Inf. Process. Syst. 33 (2020), pp. 18342\u201318352.","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"e_1_3_4_34_1","unstructured":"A. Kroshnin N. Tupitsa D. Dvinskikh P. Dvurechensky A. Gasnikov and C. Uribe On the complexity of approximating Wasserstein barycenters. in Proceedings of the 36th International Conference on Machine Learning K. Chaudhuri and R. Salakhutdinov eds. Volume 97 of Proceedings of Machine Learning Research Long Beach California USA 09\u201315 Jun 2019. PMLR pp. 3530\u20133540."},{"key":"e_1_3_4_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1355-4"},{"key":"e_1_3_4_36_1","unstructured":"H. Li and Z. Lin Accelerated gradient tracking over time-varying graphs for decentralized optimization (2021). arXiv preprint arXiv:2104.02596."},{"key":"e_1_3_4_37_1","unstructured":"T. Lin N. Ho X. Chen M. Cuturi and M.I. Jordan Fixed-support wasserstein barycenters: Computational hardness and fast algorithm (2020)."},{"key":"e_1_3_4_38_1","unstructured":"T. Lin C. Jin and M.I. Jordan Near-optimal algorithms for minimax optimization in Conference on Learning Theory PMLR 2020 pp. 2738\u20132779."},{"key":"e_1_3_4_39_1","unstructured":"W. Liu A. Mokhtari A. Ozdaglar S. Pattathil Z. Shen and N. Zheng A decentralized proximal point-type method for saddle point problems (2019). arXiv preprint arXiv:1910.14380."},{"key":"e_1_3_4_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2015.7403075"},{"key":"e_1_3_4_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC42340.2020.9304470"},{"key":"e_1_3_4_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jprocont.2010.12.010"},{"key":"e_1_3_4_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"e_1_3_4_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623403425629"},{"key":"e_1_3_4_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"e_1_3_4_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0552-5"},{"key":"e_1_3_4_47_1","unstructured":"S. Omidshafiei J. Pazis C. Amato J.P. How and J. Vian Deep decentralized multi-task multi-agent reinforcement learning under partial observability in Proceedings of the 34th International Conference on Machine Learning (ICML) vol. 70 PMLR 2017 pp. 2681\u20132690."},{"key":"e_1_3_4_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01420-0"},{"key":"e_1_3_4_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24785-9_37"},{"key":"e_1_3_4_50_1","unstructured":"K. Scaman F. Bach S. Bubeck Y.T. Lee and L. Massouli\u00e9 Optimal algorithms for smooth and strongly convex distributed optimization in networks in Proceedings of the 34th International Conference on Machine Learning D. Precup and Y. W. Teh eds. volume 70 of Proceedings of Machine Learning Research International Convention Centre Sydney Australia 6\u201311 Aug 2017. PMLR pp. 3027\u20133036."},{"key":"e_1_3_4_51_1","first-page":"2740","article-title":"Optimal algorithms for non-smooth distributed optimization in networks","volume":"31","author":"Scaman K.","year":"2018","unstructured":"K. Scaman, F. Bach, S. Bubeck, L. Massouli\u00e9, and Y.T. Lee, Optimal algorithms for non-smooth distributed optimization in networks, Adv. Neural. Inf. Process. Syst. 31 (2018), pp. 2740\u20132749.","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"e_1_3_4_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766963"},{"key":"e_1_3_4_53_1","first-page":"1","article-title":"Optimal gradient tracking for decentralized optimization","author":"Song Z.","year":"2023","unstructured":"Z. Song, L. Shi, S. Pu, and M. Yan, Optimal gradient tracking for decentralized optimization. Mathematical Programming (2023), pp. 1\u201353.","journal-title":"Mathematical Programming"},{"key":"e_1_3_4_54_1","unstructured":"S. Srivastava V. Cevher Q. Dinh and D. Dunson WASP: Scalable Bayes via barycenters of subset posteriors. in Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics G. Lebanon and S. V. N. Vishwanathan eds. Volume 38 of Proceedings of Machine Learning Research San Diego California USA 09\u201312 May 2015. PMLR pp. 912\u2013920."},{"key":"e_1_3_4_55_1","unstructured":"Y. Sun A. Daneshmand and G. Scutari Convergence rate of distributed optimization algorithms based on gradient tracking (2019). arXiv preprint arXiv:1905.02637."},{"key":"e_1_3_4_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITA50056.2020.9244951"},{"key":"e_1_3_4_57_1","article-title":"Multi-agent reinforcement learning via double averaging primal-dual optimization","volume":"31","author":"Wai H.-T.","year":"2018","unstructured":"H.-T. Wai, Z. Yang, Z. Wang, and M. Hong, Multi-agent reinforcement learning via double averaging primal-dual optimization. Adv. Neural Inf. Process. Syst. 31 (2018).","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"e_1_3_4_58_1","article-title":"Maximum margin clustering","volume":"17","author":"Xu L.","year":"2004","unstructured":"L. Xu, J. Neufeld, B. Larson, and D. Schuurmans, Maximum margin clustering. Adv. Neural Inf. Process. Syst. 17 (2004).","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"e_1_3_4_59_1","unstructured":"J. Zhang M. Hong and S. Zhang On lower iteration complexity bounds for the saddle point problems (2019). arXiv preprint arXiv:1912.07481 ."},{"key":"e_1_3_4_60_1","unstructured":"J. Zhang M. Wang M. Hong and S. Zhang Primal-dual first-order methods for affinely constrained multi-block saddle point problems (2021). arXiv preprint arXiv:2109.14212."}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2023.2280062","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T18:28:23Z","timestamp":1770920903000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2023.2280062"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,24]]},"references-count":59,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,9,3]]}},"alternative-id":["10.1080\/10556788.2023.2280062"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2023.2280062","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,24]]},"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-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-11-02","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-01-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}