{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:24:27Z","timestamp":1772119467094,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,12,16]],"date-time":"2023-12-16T00:00:00Z","timestamp":1702684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,16]],"date-time":"2023-12-16T00:00:00Z","timestamp":1702684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"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"}]},{"DOI":"10.13039\/501100018887","name":"Moscow Institute of Physics and Technology","doi-asserted-by":"publisher","award":["70-2021-00138"],"award-info":[{"award-number":["70-2021-00138"]}],"id":[{"id":"10.13039\/501100018887","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s10287-023-00493-9","type":"journal-article","created":{"date-parts":[[2023,12,16]],"date-time":"2023-12-16T06:01:51Z","timestamp":1702706511000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Decentralized convex optimization on time-varying networks with application to Wasserstein barycenters"],"prefix":"10.1007","volume":"21","author":[{"given":"Olga","family":"Yufereva","sequence":"first","affiliation":[]},{"given":"Michael","family":"Persiianov","sequence":"additional","affiliation":[]},{"given":"Pavel","family":"Dvurechensky","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Gasnikov","sequence":"additional","affiliation":[]},{"given":"Dmitry","family":"Kovalev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,16]]},"reference":[{"issue":"2","key":"493_CR1","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1137\/100805741","volume":"43","author":"M Agueh","year":"2011","unstructured":"Agueh M, Carlier G (2011) Barycenters in the Wasserstein space. SIAM J Math Anal 43(2):904\u2013924","journal-title":"SIAM J Math Anal"},{"issue":"2","key":"493_CR2","first-page":"1009","volume":"27","author":"E Barrio","year":"1999","unstructured":"Barrio E, Gine E, Matran C (1999) Central limit theorems for the Wasserstein distance between the empirical and the true distributions. Ann Probab 27(2):1009\u20131071","journal-title":"Ann Probab"},{"issue":"4","key":"493_CR3","first-page":"719","volume":"8","author":"J Bigot","year":"2019","unstructured":"Bigot J, Cazelles E, Papadakis N (2019) Data-driven regularization of Wasserstein barycenters with an application to multivariate density registration. Inf. Inference J IMA 8(4):719\u2013755","journal-title":"Inf. Inference J IMA"},{"issue":"5","key":"493_CR4","doi-asserted-by":"publisher","first-page":"3261","DOI":"10.1137\/19M1268252","volume":"59","author":"AN Bishop","year":"2021","unstructured":"Bishop AN, Doucet A (2021) Network consensus in the Wasserstein metric space of probability measures. SIAM J Control Optim 59(5):3261\u20133277","journal-title":"SIAM J Control Optim"},{"issue":"2","key":"493_CR5","doi-asserted-by":"publisher","first-page":"740","DOI":"10.3150\/13-BEJ585","volume":"21","author":"E Boissard","year":"2015","unstructured":"Boissard E, Le Gouic T, Loubes J-M (2015) Distribution\u2019s template estimate with Wasserstein metrics. Bernoulli 21(2):740\u2013759","journal-title":"Bernoulli"},{"issue":"1","key":"493_CR6","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1137\/15M1032600","volume":"9","author":"M Cuturi","year":"2015","unstructured":"Cuturi M, Peyr\u00e9 G (2015) A smoothed dual approach for variational Wasserstein problems. SIAM J. Imag. Sci. 9(1):320\u2013343","journal-title":"SIAM J. Imag. Sci."},{"key":"493_CR7","unstructured":"Cuturi M, Doucet A (2014) Fast computation of wasserstein barycenters. In: International Conference on Machine Learning. PMLR, pp. 685\u2013693"},{"issue":"2","key":"493_CR8","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1137\/110826102","volume":"22","author":"O Devolder","year":"2012","unstructured":"Devolder O, Glineur F, Nesterov Y (2012) Double smoothing technique for large-scale linearly constrained convex optimization. SIAM J Optim 22(2):702\u2013727","journal-title":"SIAM J Optim"},{"key":"493_CR9","unstructured":"Dvinskikh D (2021) Decentralized algorithms for wasserstein barycenters. PhD thesis, Humboldt Universitaet zu Berlin (Germany)"},{"key":"493_CR10","doi-asserted-by":"crossref","unstructured":"Dvinskikh D, Gorbunov E, Gasnikov A, Dvurechensky P, Uribe CA (2019) On primal and dual approaches for distributed stochastic convex optimization over networks. In: 2019 IEEE 58th Conference on Decision and Control (CDC), IEEE, pp. 7435\u2013 7440","DOI":"10.1109\/CDC40024.2019.9029798"},{"key":"493_CR11","unstructured":"Dvinskikh D, Tiapkin D (2021) Improved complexity bounds in Wasserstein barycenter problem. In: Proceedings of The 24th International Conference on Artificial Intelligence and Statistics, PMLR, pp. 1738\u2013 1746"},{"key":"493_CR12","unstructured":"Dvurechenskii P, Dvinskikh D, Gasnikov A, Uribe C, Nedich A (2018) Decentralize and randomize: faster algorithm for wasserstein barycenters. Advances in Neural Information Processing Systems 31"},{"issue":"78","key":"493_CR13","first-page":"1","volume":"22","author":"R Flamary","year":"2021","unstructured":"Flamary R, Courty N, Gramfort A, Alaya MZ, Boisbunon A, Chambon S, Chapel L, Corenflos A, Fatras K, Fournier N, Gautheron L, Gayraud NTH, Janati H, Rakotomamonjy A, Redko I, Rolet A, Schutz A, Seguy V, Sutherland DJ, Tavenard R, Tong A, Vayer T (2021) Pot: Python optimal transport. J Mach Learn Res 22(78):1\u20138","journal-title":"J Mach Learn Res"},{"issue":"4","key":"493_CR14","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1134\/S0965542516040084","volume":"56","author":"AV Gasnikov","year":"2016","unstructured":"Gasnikov AV, Gasnikova E, Nesterov YE, Chernov A (2016) Efficient numerical methods for entropy-linear programming problems. Comput Math Math Phys 56(4):514\u2013524","journal-title":"Comput Math Math Phys"},{"key":"493_CR15","doi-asserted-by":"publisher","unstructured":"Gorbunov E, Rogozin A, Beznosikov A, Dvinskikh D, Gasnikov A (2022). In: Nikeghbali A, Pardalos PM, Raigorodskii AM, Rassias MT (eds) Recent Theoretical Advances in Decentralized Distributed Convex Optimization. Springer, Cham, pp 253\u2013325. https:\/\/doi.org\/10.1007\/978-3-031-00832-0_8","DOI":"10.1007\/978-3-031-00832-0_8"},{"key":"493_CR16","first-page":"199","volume":"37","author":"L Kantorovich","year":"1942","unstructured":"Kantorovich L (1942) On the translocation of masses. (Doklady) Acad Sci URSS (N.S.) 37:199\u2013201","journal-title":"(Doklady) Acad Sci URSS (N.S.)"},{"key":"493_CR17","unstructured":"Kovalev D, Gasanov E, Gasnikov A, Richtarik P (2021) Lower bounds and optimal algorithms for smooth and strongly convex decentralized optimization over time-varying networks. Advances in Neural Information Processing Systems 34"},{"key":"493_CR18","unstructured":"Kovalev D, Shulgin E, Richt\u00e1rik P, Rogozin AV, Gasnikov A (2021) ADOM: accelerated decentralized optimization method for time-varying networks. In: International Conference on Machine Learning, pp. 5784\u2013 5793. PMLR"},{"key":"493_CR19","unstructured":"Krawtschenko R, Uribe CA, Gasnikov A, Dvurechensky P (2020) Distributed optimization with quantization for computing wasserstein barycenters. arXiv preprint arXiv:2010.14325"},{"key":"493_CR20","unstructured":"Kroshnin A, Tupitsa N, Dvinskikh D, Dvurechensky P, Gasnikov A, Uribe C (2019) On the complexity of approximating wasserstein barycenters. In: International Conference on Machine Learning, PMLR, pp. 3530\u2013 3540"},{"key":"493_CR21","unstructured":"LeCun, Y (1998) The mnist database of handwritten digits. http:\/\/yann. lecun.com\/exdb\/mnist\/"},{"issue":"2","key":"493_CR22","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1137\/S1052623494267127","volume":"7","author":"C Lemar\u00e9chal","year":"1997","unstructured":"Lemar\u00e9chal C, Sagastiz\u00e1bal C (1997) Practical aspects of the moreau-yosida regularization: theoretical preliminaries. SIAM J Optim 7(2):367\u2013385","journal-title":"SIAM J Optim"},{"key":"493_CR23","unstructured":"Li H, Lin Z (2021) Accelerated gradient tracking over time-varying graphs for decentralized optimization. arXiv preprint arXiv:2104.02596"},{"key":"493_CR24","unstructured":"Monge G (1781) M\u00e9moire sur la th\u00e9orie des d\u00e9blais et des remblais. Histoire de l\u2019Acad\u00e9mie Royale des Sciences de Paris"},{"issue":"5\u20136","key":"493_CR25","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1561\/2200000073","volume":"11","author":"G Peyr\u00e9","year":"2019","unstructured":"Peyr\u00e9 G, Cuturi M et al (2019) Computational optimal transport: with applications to data science. Found Trends\u00ae Mach Learn 11(5\u20136):355\u2013607","journal-title":"Found Trends\u00ae Mach Learn"},{"key":"493_CR26","doi-asserted-by":"crossref","unstructured":"Rabin J, Peyr\u00e9 G, Delon J, Bernot M (2011) Wasserstein barycenter and its application to texture mixing. In: International Conference on Scale Space and Variational Methods in Computer Vision, Springer, pp. 435\u2013 446","DOI":"10.1007\/978-3-642-24785-9_37"},{"key":"493_CR27","volume-title":"Convex analysis","author":"RT Rockafellar","year":"1997","unstructured":"Rockafellar RT (1997) Convex analysis, vol 11. Princeton University Press, Princeton"},{"key":"493_CR28","unstructured":"Rogozin A, Beznosikov A, Dvinskikh D, Kovalev D, Dvurechensky P, Gasnikov A (2021) Decentralized distributed optimization for saddle point problems. arXiv preprint arXiv:2102.07758"},{"key":"493_CR29","doi-asserted-by":"publisher","unstructured":"Rogozin A, Bochko M, Dvurechensky P, Gasnikov A, Lukoshkin V (2021) An accelerated method for decentralized distributed stochastic optimization over time-varying graphs. In: 2021 60th IEEE Conference on Decision and Control (CDC), pp. 3367\u2013 3373 . https:\/\/doi.org\/10.1109\/CDC45484.2021.9683110","DOI":"10.1109\/CDC45484.2021.9683110"},{"key":"493_CR30","unstructured":"Staib M, Claici S, Solomon JM, Jegelka, S (2017) Parallel streaming wasserstein barycenters. In: Guyon I, Luxburg UV, Bengio S, Wallach H, Fergus R, Vishwanathan S, Garnett R (eds) Advances in Neural Information Processing Systems 30. Curran Associates, Inc., pp. 2647\u2013 2658. http:\/\/papers.nips.cc\/paper\/6858-parallel-streaming-wasserstein-barycenters.pdf"},{"key":"493_CR31","doi-asserted-by":"crossref","unstructured":"Uribe CA, Dvinskikh D, Dvurechensky P, Gasnikov A, Nedi\u0107 A (2018) Distributed computation of Wasserstein barycenters over networks. In: 2018 IEEE Conference on Decision and Control (CDC), IEEE, pp. 6544\u2013 6549","DOI":"10.1109\/CDC.2018.8619160"},{"key":"493_CR32","doi-asserted-by":"crossref","unstructured":"Uribe CA, Lee S, Gasnikov A, Nedi\u0107 A (2020) A dual approach for optimal algorithms in distributed optimization over networks. In: 2020 Information Theory and Applications Workshop (ITA), IEEE, pp. 1\u2013 37","DOI":"10.1109\/ITA50056.2020.9244951"},{"key":"493_CR33","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-71050-9","volume-title":"Optimal transport: old and new","author":"C Villani","year":"2009","unstructured":"Villani C (2009) Optimal transport: old and new, vol 338. Springer, Cham"},{"issue":"11","key":"493_CR34","doi-asserted-by":"publisher","first-page":"4629","DOI":"10.1109\/TAC.2019.2901829","volume":"64","author":"X Wu","year":"2019","unstructured":"Wu X, Lu J (2019) Fenchel dual gradient methods for distributed convex optimization over time-varying networks. IEEE Trans Autom Control 64(11):4629\u20134636. https:\/\/doi.org\/10.1109\/TAC.2019.2901829","journal-title":"IEEE Trans Autom Control"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-023-00493-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10287-023-00493-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-023-00493-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,22]],"date-time":"2024-06-22T08:10:09Z","timestamp":1719043809000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10287-023-00493-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,16]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["493"],"URL":"https:\/\/doi.org\/10.1007\/s10287-023-00493-9","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3126039\/v1","asserted-by":"object"}]},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,16]]},"assertion":[{"value":"29 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interest"}}],"article-number":"12"}}