{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T16:09:12Z","timestamp":1761840552788,"version":"build-2065373602"},"reference-count":20,"publisher":"Informa UK Limited","issue":"5","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"}]},{"name":"Ivannikov Institute for System Programming of the Russian Academy of Sciences","award":["70-2021-00142"],"award-info":[{"award-number":["70-2021-00142"]}]}],"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.2024.2396295","type":"journal-article","created":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T10:28:51Z","timestamp":1743244131000},"page":"1197-1221","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":0,"title":["The mirror-prox sliding method for non-smooth decentralized saddle-point problems"],"prefix":"10.1080","volume":"40","author":[{"given":"Ilya","family":"Kuruzov","sequence":"first","affiliation":[{"name":"Moscow Institute of Physics and Technology","place":["Dolgoprudny, Russia"]},{"name":"Institute for Information Transmission Problems","place":["Moscow, Russia"]},{"name":"National Research University Higher School of Economics","place":["Moscow, Russia"]},{"name":"Innopolis University","place":["Innopolis, Russia"]}]},{"given":"Alexander","family":"Rogozin","sequence":"additional","affiliation":[{"name":"Moscow Institute of Physics and Technology","place":["Dolgoprudny, Russia"]},{"name":"Skolkovo Institute of Science and Technology","place":["Moscow, Russia"]}]},{"given":"Demyan","family":"Yarmoshik","sequence":"additional","affiliation":[{"name":"Moscow Institute of Physics and Technology","place":["Dolgoprudny, Russia"]},{"name":"Innopolis University","place":["Innopolis, Russia"]}]},{"given":"Alexander","family":"Gasnikov","sequence":"additional","affiliation":[{"name":"Moscow Institute of Physics and Technology","place":["Dolgoprudny, Russia"]},{"name":"National Research University Higher School of Economics","place":["Moscow, Russia"]},{"name":"Innopolis University","place":["Innopolis, Russia"]},{"name":"Skolkovo Institute of Science and Technology","place":["Moscow, Russia"]},{"name":"ISP RAS Research Center for Trusted Artificial Intelligence","place":["Moscow, Russia"]}]}],"member":"301","published-online":{"date-parts":[[2025,3,28]]},"reference":[{"key":"e_1_3_4_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9414476"},{"key":"e_1_3_4_3_1","unstructured":"A. Beznosikov V. Samokhin and A. Gasnikov Distributed saddle-point problems: Lower bounds optimal algorithms and federated gans preprint (2022). Available at arXiv:2010.13112 2020."},{"key":"e_1_3_4_4_1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/7496.003.0003"},{"key":"e_1_3_4_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(67)90040-7"},{"key":"e_1_3_4_6_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013912006537"},{"key":"e_1_3_4_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2015.02.001"},{"key":"e_1_3_4_8_1","doi-asserted-by":"publisher","DOI":"10.1515\/jiip-2020-0068"},{"key":"e_1_3_4_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3422622"},{"key":"e_1_3_4_10_1","unstructured":"E. Gorbunov D. Dvinskikh and A. Gasnikov Optimal decentralized distributed algorithms for stochastic convex optimization preprint (2019). Available at arXiv:1911.07363."},{"key":"e_1_3_4_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-00832-0_8"},{"key":"e_1_3_4_12_1","unstructured":"D. Kovalev A. Beznosikov A. Sadiev M. Persiianov P. Richtarik and A. Gasnikov Optimal algorithms for decentralized stochastic variational inequalities preprint (2022). Available at arXiv preprint arXiv:2202.02771."},{"key":"e_1_3_4_13_1","unstructured":"A. Kurakin I.J. Goodfellow and S. Bengio Adversarial machine learning at scale in International Conference on Learning Representations 2017. Available at https:\/\/openreview.net\/forum?id=BJm4T4Kgx."},{"key":"e_1_3_4_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-39568-1"},{"key":"e_1_3_4_15_1","unstructured":"G. Lan and Y. Ouyang Mirror-prox sliding methods for solving a class of monotone variational inequalities preprint (2021). Available at arXiv:2111.00996."},{"key":"e_1_3_4_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1355-4"},{"key":"e_1_3_4_17_1","unstructured":"X. Lian C. Zhang H. Zhang C.J. Hsieh W. Zhang and J. Liu Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descent Advances in Neural Information Processing Systems Vol. 30 2017."},{"key":"e_1_3_4_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCVW.2019.00369"},{"key":"e_1_3_4_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553463"},{"key":"e_1_3_4_20_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 2017."},{"key":"e_1_3_4_21_1","unstructured":"O. Yufereva M. Persiianov P. Dvurechensky A. Gasnikov and D. Kovalev Decentralized computation of wasserstein barycenter over time-varying networks preprint (2022). Available at arXiv:2205.15669."}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2024.2396295","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T16:06:14Z","timestamp":1761840374000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2024.2396295"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,28]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,9,3]]}},"alternative-id":["10.1080\/10556788.2024.2396295"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2024.2396295","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"type":"print","value":"1055-6788"},{"type":"electronic","value":"1029-4937"}],"subject":[],"published":{"date-parts":[[2025,3,28]]},"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":"2024-07-31","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-03-28","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}