{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:14:55Z","timestamp":1771611295287,"version":"3.50.1"},"reference-count":91,"publisher":"Informa UK Limited","issue":"1","funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CPS 15-44953 and no. CCF-1717391"],"award-info":[{"award-number":["CPS 15-44953 and no. CCF-1717391"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002261","name":"RFBR","doi-asserted-by":"publisher","award":["18-29-03071 mk"],"award-info":[{"award-number":["18-29-03071 mk"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002261","name":"RFBR","doi-asserted-by":"publisher","award":["RFBR 19-31-51001"],"award-info":[{"award-number":["RFBR 19-31-51001"]}],"id":[{"id":"10.13039\/501100002261","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,1,2]]},"DOI":"10.1080\/10556788.2020.1750013","type":"journal-article","created":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T07:17:03Z","timestamp":1587107823000},"page":"171-210","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":30,"title":["A dual approach for optimal algorithms in distributed optimization over networks"],"prefix":"10.1080","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7080-9724","authenticated-orcid":false,"given":"C\u00e9sar A.","family":"Uribe","sequence":"first","affiliation":[{"name":"Laboratory for Information and Decision Systems, and the Institute for Data, Systems, and Society, Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3959-6473","authenticated-orcid":false,"given":"Soomin","family":"Lee","sequence":"additional","affiliation":[{"name":"Yahoo! Research, Sunnyvale, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"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, and Institute for Information Transmission, Dolgoprudnyi, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9365-6321","authenticated-orcid":false,"given":"Angelia","family":"Nedi\u0107","sequence":"additional","affiliation":[{"name":"School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, AZ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2020,4,17]]},"reference":[{"key":"CIT0001","unstructured":"M. Abadi , \n                     A. Agarwal , \n                     P. Barham , \n                     E. Brevdo , \n                     Z. Chen , \n                     C. Citro , \n                     G.S. Corrado , \n                     A. Davis , \n                     J. Dean , \n                     M. Devin , and \n                     S. Ghemawat  ,  TensorFlow: Large-scale machine learning on heterogeneous distributed systems. CoRR, abs\/1603.04467, in Conference on Language Resources and Evaluation (LREC'08), 2016, pp. 3243\u20133249."},{"key":"CIT0002","unstructured":"A. Anikin , \n                     P. Dvurechensky , \n                     A. Gasnikov , \n                     A. Golov , \n                     A. Gornov , \n                     Y. Maximov , \n                     M. Mendel , and \n                     V. Spokoiny  ,  Efficient numerical algorithms for regularized regression problem with applications to traffic matrix estimations, preprint (2015). Available at arXiv:1508.00858."},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542517080048"},{"key":"CIT0004","unstructured":"N. Bansal  and \n                     A. Gupta  ,  Potential-function proofs for first-order methods, preprint (2017). Available at arXiv:1712.04581."},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2013.10.007"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2014.2309751"},{"key":"CIT0008","volume-title":"Convex Analysis and Optimization","author":"Bertsekas D.P.","year":"2003"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1982.1102982"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1561\/2200000050"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"CIT0014","doi-asserted-by":"crossref","unstructured":"A. Chernov , \n                     P. Dvurechensky , and \n                     A. Gasnikov  ,  Fast primal\u2013dual gradient method for strongly convex minimization problems with linear constraints, in Discrete Optimization and Operations Research, Springer International Publishing, Y. Kochetov, M. Khachay, V. Beresnev, E. Nurminski, and P. Pardalos, eds., Cham, 2016, pp. 391\u2013403.","DOI":"10.1007\/978-3-319-44914-2_31"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1137\/15M1032600"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1974.10480137"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1137\/110826102"},{"key":"CIT0018","unstructured":"O. Devolder , \n                     F. Glineur , and \n                     Y. Nesterov  ,  First-order methods with inexact oracle: The strongly convex case, CORE Discussion Papers 2013016, 2013."},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0677-5"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2016.11.006"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1137\/110831659"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2161027"},{"key":"CIT0023","unstructured":"C. D\u00fcnner , \n                     S. Forte , \n                     M. Tak\u00e1\u010d , and \n                     M. Jaggi  ,  Primal\u2013dual rates and certificates, in Proceedings of the 33rd International Conference on International Conference on Machine Learning \u2013 Volume 48, ICML'16, New York, NY, JMLR.org, 2016, pp. 783\u2013792."},{"key":"CIT0024","unstructured":"P. Dvurechensky  ,  Gradient Method With Inexact Oracle for Composite Non-Convex Optimization, preprint (2017). Available at arXiv:1703.09180."},{"key":"CIT0025","unstructured":"P. Dvurechenskii , \n                     D. Dvinskikh , \n                     A. Gasnikov , \n                     C. Uribe , and \n                     A. Nedich  ,  Decentralize and randomize: Faster algorithm for Wasserstein Barycenters, in Advances in Neural Information Processing Systems 31, 2018, pp. 10760\u201310770."},{"key":"CIT0026","unstructured":"O. Fercoq  and \n                     Z. Qu  ,  Restarting accelerated gradient methods with a rough strong convexity estimate, preprint (2016). Available at arXiv:1609.07358."},{"key":"CIT0027","unstructured":"A. Gasnikov  ,  Universal gradient descent, preprint (2017). Available at arXiv:1711.00394."},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542516040084"},{"key":"CIT0029","unstructured":"A. Gasnikov , \n                     S. Kabanikhin , \n                     A. Mohamed , and \n                     M. Shishlenin  ,  Convex optimization in hilbert space with applications to inverse problems, preprint (2017). Available at arXiv:1703.00267."},{"key":"CIT0030","unstructured":"E. Gorbunov , \n                     D. Dvinskikh , and \n                     A. Gasnikov  ,  Optimal decentralized distributed algorithms for stochastic convex optimization, preprint (2019). arXiv:1911.07363."},{"key":"CIT0031","volume-title":"Fundamentals of Convex Analysis","author":"Hiriart-Urruty J.B.","year":"2012"},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2211593"},{"key":"CIT0033","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2018.2846183"},{"key":"CIT0034","doi-asserted-by":"publisher","DOI":"10.1287\/10-SSY010"},{"key":"CIT0035","unstructured":"S. Kakade , \n                     S. Shalev-Shwartz , and \n                     A. Tewari  ,  Applications of strong convexity\u2013strong smoothness duality to learning with matrices, CoRR, abs\/0910.0610 (2009)."},{"key":"CIT0036","unstructured":"M.B. Khuzani  and \n                     N. Li  ,  Distributed regularized primal\u2013dual method: Convergence analysis and trade-offs, preprint (2016). Available at arXiv:1609.08262."},{"key":"CIT0037","unstructured":"J. Kone\u010dn\u00fd , \n                     B. McMahan , and \n                     D. Ramage  ,  Federated optimization: Distributed optimization beyond the datacenter, preprint (2015). Available at arXiv:1511.03575."},{"key":"CIT0038","unstructured":"T. Kraska , \n                     A. Talwalkar , \n                     J.C. Duchi , \n                     R. Griffith , \n                     M.J. Franklin , and \n                     M.I. Jordan  ,  MLbase: A distributed machine-learning system., in CIDR, Vol. 1, 2013, pp. 2\u20131."},{"key":"CIT0039","doi-asserted-by":"publisher","DOI":"10.1137\/060662228"},{"key":"CIT0040","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0955-5"},{"key":"CIT0041","unstructured":"G. Lan , \n                     S. Lee , and \n                     Y. Zhou  ,  Communication-efficient algorithms for decentralized and stochastic optimization, preprint (2017). Available at arXiv:1701.03961."},{"key":"CIT0042","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-008-0261-6"},{"key":"CIT0043","doi-asserted-by":"crossref","unstructured":"P. Latafat , \n                     L. Stella , and \n                     P. Patrinos  ,  New primal\u2013dual proximal algorithm for distributed optimization, in Proc. IEEE 55th Conf. Decision and Control (CDC), Dec., 2016, pp. 1959\u20131964.","DOI":"10.1109\/CDC.2016.7798551"},{"key":"CIT0044","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2013.01.001"},{"key":"CIT0045","doi-asserted-by":"crossref","unstructured":"M. Maros  and \n                     J. Jald\u00e9n  ,  PANDA: A dual linearly converging method for distributed optimization over time-varying undirected graphs, in 2018 IEEE Conference on Decision and Control (CDC), Dec, 2018, pp. 6520\u20136525.","DOI":"10.1109\/CDC.2018.8619626"},{"key":"CIT0046","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2250071"},{"key":"CIT0047","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2015.02.038"},{"key":"CIT0048","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2007159"},{"key":"CIT0049","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2817461"},{"key":"CIT0050","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2364096"},{"key":"CIT0051","doi-asserted-by":"publisher","DOI":"10.1137\/16M1084316"},{"key":"CIT0052","unstructured":"A. Nedi\u0107 , \n                     A. Olshevsky , and \n                     W. Shi  ,  Improved convergence rates for distributed resource allocation, preprint (2017). Available at arXiv:1706.05441."},{"key":"CIT0053","unstructured":"A. Nedi\u0107 , \n                     A. Olshevsky , and \n                     C.A. Uribe  ,  Distributed learning for cooperative inference, preprint (2017). Available at arXiv:1704.02718."},{"key":"CIT0054","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2690401"},{"key":"CIT0055","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-45076-4"},{"key":"CIT0056","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"CIT0057","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2009.2031203"},{"key":"CIT0058","doi-asserted-by":"crossref","unstructured":"A. Nedi\u0107 , \n                     A. Olshevsky , \n                     W. Shi , and \n                     C.A. Uribe  ,  Geometrically convergent distributed optimization with uncoordinated step-sizes, in American Control Conference (ACC), 2017, 2017, pp. 3950\u20133955.","DOI":"10.23919\/ACC.2017.7963560"},{"key":"CIT0059","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"Nemirovskii A.","year":"1983"},{"key":"CIT0060","unstructured":"Y. Nesterov  ,  A method of solving a convex programming problem with convergence rate      O  ( 1  \/   k 2  )    , in Soviet Mathematics Doklady, Vol. 27, 1983, pp. 372\u2013376."},{"key":"CIT0061","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0552-5"},{"key":"CIT0062","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"key":"CIT0063","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","volume":"87","author":"Nesterov Y.","year":"2013"},{"key":"CIT0064","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0790-0"},{"key":"CIT0065","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791"},{"key":"CIT0066","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-013-9150-3"},{"key":"CIT0067","unstructured":"A. Olshevsky  ,  Linear time average consensus on fixed graphs and implications for decentralized optimization and multi-agent control, preprint (2014). Available at arXiv:1411.4186."},{"key":"CIT0068","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2043127"},{"key":"CIT0069","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-013-0061-8"},{"key":"CIT0070","unstructured":"G. Qu  and \n                     N. Li  ,  Accelerated distributed Nesterov gradient descent, preprint (2017). Available at arXiv:1705.07176."},{"key":"CIT0071","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2017.2698261"},{"key":"CIT0072","unstructured":"M. Rabbat  and \n                     R. Nowak  ,  Decentralized source localization and tracking wireless sensor networks, in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, Vol. 3, 2004, pp. 921\u2013924."},{"key":"CIT0073","doi-asserted-by":"crossref","unstructured":"M. Raginsky  and \n                     J. Bouvrie  ,  Continuous-time stochastic mirror descent on a network: Variance reduction, consensus, convergence, in Proc. IEEE 51st IEEE Conf. Decision and Control (CDC), Dec., 2012, pp. 6793\u20136800.","DOI":"10.1109\/CDC.2012.6426639"},{"key":"CIT0074","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-010-9737-7"},{"key":"CIT0075","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3"},{"key":"CIT0076","unstructured":"A. Rogozin , \n                     C.A. Uribe , \n                     A. Gasnikov , \n                     N. Malkovsky , and \n                     A. Nedi\u0107  ,  Optimal distributed optimization on slowly time-varying graphs, preprint (2018). Available at arXiv:1805.06045."},{"key":"CIT0077","unstructured":"K. Scaman , \n                     F. Bach , \n                     S. Bubeck , \n                     Y.T. Lee , and \n                     L. Massouli\u00e9  ,  Optimal algorithms for smooth and strongly convex distributed optimization in networks, in International Conference on Machine Learning, 2017, pp. 3027\u20133036."},{"key":"CIT0078","unstructured":"K. Scaman , \n                     F. Bach , \n                     S. Bubeck , \n                     Y.T. Lee , and \n                     L. Massouli\u00e9  ,  Optimal algorithms for non-smooth distributed optimization in networks, preprint (2018). Available at arXiv:1806.00291."},{"key":"CIT0079","doi-asserted-by":"publisher","DOI":"10.1137\/14096668X"},{"key":"CIT0080","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-015-0758-0"},{"key":"CIT0081","doi-asserted-by":"crossref","unstructured":"A. Sundararajan , \n                     B. Hu , and \n                     L. Lessard  ,  Robust convergence analysis of distributed optimization algorithms, in 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Oct, 2017, pp. 1206\u20131212.","DOI":"10.1109\/ALLERTON.2017.8262874"},{"key":"CIT0082","doi-asserted-by":"publisher","DOI":"10.3182\/20140824-6-ZA-1003.02428"},{"key":"CIT0083","unstructured":"Q. Tran-Dinh  and \n                     V. Cevher  ,  Constrained convex minimization via model-based excessive gap, in Advances in Neural Information Processing Systems, 2014, pp. 721\u2013729."},{"key":"CIT0084","unstructured":"Q. Tran Dinh  and \n                     V. Cevher  ,  Splitting the smoothed primal\u2013dual gap: Optimal alternating direction methods, Tech. Rep., Tech. Report. LIONS-EPFL (2015), 2015."},{"key":"CIT0085","unstructured":"Q. Tran-Dinh , \n                     O. Fercoq , and \n                     V. Cevher  ,  A smooth primal\u2013dual optimization framework for nonsmooth composite convex minimization, preprint (2015). Available at arXiv:1507.06243."},{"key":"CIT0086","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1984.1103385"},{"key":"CIT0087","doi-asserted-by":"crossref","unstructured":"C.A. Uribe , \n                     D. Dvinskikh , \n                     P. Dvurechensky , \n                     A. Gasnikov , and \n                     A. Nedi\u0107  ,  Distributed computation of Wasserstein Barycenters over networks, in 2018 IEEE Conference on Decision and Control (CDC), Dec, 2018, pp. 6544\u20136549.","DOI":"10.1109\/CDC.2018.8619160"},{"key":"CIT0088","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-006-9080-1"},{"key":"CIT0089","unstructured":"A. Yurtsever , \n                     Q.T. Dinh , and \n                     V. Cevher  ,  A universal primal\u2013dual convex optimization framework, in Advances in Neural Information Processing Systems, 2015, pp. 3150\u20133158."},{"key":"CIT0090","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2017.2672403"},{"key":"CIT0091","unstructured":"M. Zhu  and \n                     S. Mart\u00ednez  ,  On distributed optimization under inequality and equality constraints via penalty primal\u2013dual methods, in American Control Conference (ACC), 2010, 2010, pp. 2434\u20132439."}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2020.1750013","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,18]],"date-time":"2021-01-18T08:36:16Z","timestamp":1610958976000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2020.1750013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,17]]},"references-count":91,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1,2]]}},"alternative-id":["10.1080\/10556788.2020.1750013"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2020.1750013","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,17]]},"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-09-20","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-03-26","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-04-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}