{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,31]],"date-time":"2026-10-31T04:16:44Z","timestamp":1793420204699,"version":"4.5.0"},"reference-count":30,"publisher":"Informa UK Limited","issue":"4","funder":[{"DOI":"10.13039\/100012555","name":"Russian Foundation for Fundamental Investigations","doi-asserted-by":"publisher","award":["18-31-20005 mol-a-ved"],"award-info":[{"award-number":["18-31-20005 mol-a-ved"]}],"id":[{"id":"10.13039\/100012555","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012555","name":"Russian Foundation for Fundamental Investigations","doi-asserted-by":"publisher","award":["18-29-03071 mk"],"award-info":[{"award-number":["18-29-03071 mk"]}],"id":[{"id":"10.13039\/100012555","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":[[2021,7,4]]},"DOI":"10.1080\/10556788.2020.1712599","type":"journal-article","created":{"date-parts":[[2020,2,13]],"date-time":"2020-02-13T03:48:49Z","timestamp":1581565729000},"page":"720-754","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":11,"title":["Composite optimization for the resource allocation problem"],"prefix":"10.1080","volume":"36","author":[{"given":"Anastasiya","family":"Ivanova","sequence":"first","affiliation":[{"name":"Moscow Institute of Physics and Technology, Moscow, Russia"},{"name":"National Research University Higher School of Economics, Moscow, Russia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"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 Stochastics, Berlin, Germany"},{"name":"Institute for Information Transmission Problems RAS, Moscow, Russia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"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, Moscow, Russia"},{"name":"National Research University Higher School of Economics, Moscow, Russia"},{"name":"Institute for Information Transmission Problems RAS, Moscow, Russia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8488-9692","authenticated-orcid":false,"given":"Dmitry","family":"Kamzolov","sequence":"additional","affiliation":[{"name":"Moscow Institute of Physics and Technology, Moscow, Russia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2020,2,12]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542517080048"},{"key":"CIT0002","unstructured":"K.J. Arrow and L. Hurwicz, Decentralization and computation in resource allocation, Stanford University, Department of Economics;1958."},{"key":"CIT0003","volume-title":"L'analyse non-lin\u00e9aire et ses motivations \u00e9conomiques","author":"Aubin J.P.","year":"1984"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542519010020"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-97478-1_8"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139173476"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44914-2_31"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2161027"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9029798"},{"key":"CIT0011","unstructured":"P. Dvurechensky, A. Gasnikov and A. Kroshnin, Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn's Algorithm, Proceedings of the 35th International Conference on Machine Learning, Proceedings of Machine Learning Research, Vol. 80, arXiv:1802.04367, 2018, pp. 1367\u20131376."},{"key":"CIT0012","unstructured":"P. Dvurechensky, A. Gasnikov, E. Gasnikova, S. Matsievsky, A. Rodomanov and I. Usik, Primal-Dual Method for Searching Equilibrium in Hierarchical Congestion Population Games, Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016) Vladivostok, Russia, September 19\u201323, 2016, arXiv:1606.08988, 2016, pp. 584\u2013595."},{"key":"CIT0013","unstructured":"P. Dvurechensky, D. Dvinskikh, A. Gasnikov, C.A. Uribe and A. Nedi\u0107, Decentralize and Randomize: Faster Algorithm for Wasserstein Barycenters, Advances in Neural Information Processing Systems 31, NeurIPS 2018, arXiv:1806.03915, Curran Associates, Inc., 2018, pp. 10783\u201310793."},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1134\/S1995423918010044"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1007\/BF01212489"},{"key":"CIT0016","unstructured":"A. Gasnikov, Universal gradient descent, arXiv preprint arXiv:1711.00394 (2017)."},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1134\/S1064562419020042"},{"key":"CIT0018","first-page":"411","volume":"22","author":"Ivanova A.","year":"2019","journal-title":"Siberian J. Num. Math."},{"key":"CIT0019","author":"Ivanova A.","year":"2020","journal-title":"Comput. Math. Math. Phys."},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2298712"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6319-1"},{"key":"CIT0022","unstructured":"A. Kroshnin, N. Tupitsa, D. Dvinskikh, P. Dvurechensky, A. Gasnikov and C. Uribe, On the Complexity of Approximating Wasserstein Barycenters, Proceedings of the 36th International Conference on Machine Learning, Proceedings of Machine Learning Research, Vol. 97, 09\u201315 Jun, arXiv:1901.08686, PMLR, Long Beach, CA, 2019, pp. 3530\u20133540."},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0552-5"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.09.043"},{"key":"CIT0026","first-page":"593","volume":"8","author":"Polyak B.","year":"1967","journal-title":"Soviet Math. Doklady"},{"key":"CIT0027","author":"Rokhlin D.B.","year":"2019","journal-title":"Theory Probab. Appl."},{"key":"CIT0028","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, Proceedings of the 34th International Conference on Machine Learning, Proceedings of Machine Learning Research, Vol. 70, 06\u201311 Aug, PMLR, International Convention Centre, Sydney, Australia, 2017, pp. 3027\u20133036. Available at http:\/\/proceedings.mlr.press\/v70\/scaman17a.html."},{"key":"CIT0029","first-page":"1","volume":"20","author":"Scaman K.","year":"2019","journal-title":"J. Mach. Learn. Res."},{"key":"CIT0030","doi-asserted-by":"crossref","unstructured":"C.A. Uribe, D. Dvinskikh, P. Dvurechensky, A. Gasnikov and A. Nedi\u0107, Distributed Computation of Wasserstein Barycenters Over Networks, 2018 IEEE Conference on Decision and Control (CDC), arXiv:1803.02933, 2018, pp. 6544\u20136549.","DOI":"10.1109\/CDC.2018.8619160"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2020.1712599","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T12:13:12Z","timestamp":1662379992000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2020.1712599"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,12]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,7,4]]}},"alternative-id":["10.1080\/10556788.2020.1712599"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2020.1712599","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,12]]},"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":"2019-03-08","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-12-27","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-02-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}