{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T22:21:12Z","timestamp":1780698072941,"version":"3.54.1"},"reference-count":89,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,2,2]],"date-time":"2020-02-02T00:00:00Z","timestamp":1580601600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,2,2]],"date-time":"2020-02-02T00:00:00Z","timestamp":1580601600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,2,2]],"date-time":"2020-02-02T00:00:00Z","timestamp":1580601600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,2,2]]},"DOI":"10.1109\/ita50056.2020.9244951","type":"proceedings-article","created":{"date-parts":[[2020,11,6]],"date-time":"2020-11-06T22:10:58Z","timestamp":1604700658000},"page":"1-37","source":"Crossref","is-referenced-by-count":30,"title":["A Dual Approach for Optimal Algorithms in Distributed Optimization over Networks"],"prefix":"10.1109","author":[{"given":"Cesar A.","family":"Uribe","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Soomin","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Gasnikov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Angelia","family":"Nedic","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref73","volume":"317","author":"rockafellar","year":"2011","journal-title":"Variational Analysis"},{"key":"ref72","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1007\/s10957-010-9737-7","article-title":"Distributed stochastic subgradient projection algorithms for convex optimization","volume":"147","author":"ram","year":"2010","journal-title":"Journal of Optimization Theory and Applications"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426639"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2004.1326696"},{"key":"ref76","author":"scaman","year":"2018","journal-title":"Optimal algorithms for non-smooth distributed optimization in networks"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1137\/14096668X"},{"key":"ref74","author":"rogozin","year":"2018","journal-title":"Optimal distributed optimization on slowly time-varying graphs"},{"key":"ref39","author":"lan","year":"2017","journal-title":"Communication-efficient algorithms for decentralized and stochastic optimization"},{"key":"ref75","first-page":"3027","article-title":"Optimal Algorithms for Smooth and Strongly Convex Distributed Optimization in Networks","author":"scaman","year":"2017","journal-title":"International Conference on Machine Learning"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0955-5"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-015-0758-0"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262874"},{"key":"ref33","article-title":"Applications of strong convexity&#x2013;strong smoothness duality to learning with matrices","author":"kakade","year":"2009","journal-title":"CoRR"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1287\/10-SSY010"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2018.2846183"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2211593"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/060662228"},{"key":"ref36","first-page":"2","article-title":"MLbase: A Distributed Machine-learning System","volume":"1","author":"kraska","year":"2013","journal-title":"CIDR"},{"key":"ref35","author":"kone?n?","year":"2015","journal-title":"Federated optimization Distributed optimization beyond the datacenter"},{"key":"ref34","author":"khuzani","year":"2016","journal-title":"Distributed Regularized Primal-Dual Method Convergence Analysis and Trade-Offs"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0790-0"},{"key":"ref61","volume":"87","author":"nesterov","year":"2013","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542516040084"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-013-9150-3"},{"key":"ref27","author":"gasnikov","year":"2017","journal-title":"Convex optimization in hilbert space with applications to inverse problems"},{"key":"ref65","article-title":"Linear time average consensus on fixed graphs and implications for decentralized optimization and multi-agent control","author":"olshevsky","year":"2014"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2043127"},{"key":"ref29","author":"hiriart-urruty","year":"2012","journal-title":"Fundamentals of Convex Analysis"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-013-0061-8"},{"key":"ref68","author":"qu","year":"2017","journal-title":"Accelerated distributed nesterov gradient descent"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2017.2698261"},{"key":"ref2","author":"anikin","year":"2015","journal-title":"Efficient numerical algorithms for regularized regression problem with applications to traffic matrix estimations"},{"key":"ref1","first-page":"3243","article-title":"Tensor Flow: Large-Scale Machine Learning on Heterogeneous Distributed Systems. CoRR, abs\/1603.04467","author":"abadi","year":"2016","journal-title":"Language Resources and Evaluation Conference"},{"key":"ref20","first-page":"57","volume":"99","author":"doan","year":"2017","journal-title":"Distributed resource allocation on dynamic networks in quadratic time Systems & Control Letters"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2161027"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/110831659"},{"key":"ref24","first-page":"10760","article-title":"Decentralize and randomize: Faster algorithm for wasserstein barycenters","volume":"31","author":"dvurechenskii","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref23","first-page":"783","article-title":"Primal-dual Rates and Certificates","author":"d\u00fcnner","year":"2016","journal-title":"Proceedings of the 33rd International Conference on International Conference on Machine Learning - Volume 48 ICML&#x2019;16"},{"key":"ref26","author":"fercoq","year":"2016","journal-title":"Restarting accelerated gradient methods with a rough strong convexity estimate"},{"key":"ref25","author":"dvurechensky","year":"2017","journal-title":"Gradient method with inexact oracle for composite non-convex optimization"},{"key":"ref50","author":"nedi?","year":"2017","journal-title":"Improved convergence rates for distributed resource allocation"},{"key":"ref51","article-title":"Distributed learning for cooperative inference","author":"nedi?","year":"2017"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0552-5"},{"key":"ref58","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate $\\mathcal{O}\\left( {1\/{k^2}} \\right)$","volume":"27","author":"nesterov","year":"1983","journal-title":"Soviet Mathematics Doklady"},{"key":"ref57","author":"nemirovskii","year":"1983","journal-title":"Problem Complexity and Method Efficiency in Optimization"},{"key":"ref56","first-page":"3950","article-title":"Geometrically convergent distributed optimization with uncoordinated step-sizes","volume":"2017","author":"nedi?","year":"2017","journal-title":"American Control Conference (ACC)"},{"key":"ref55","doi-asserted-by":"crossref","first-page":"2506","DOI":"10.1109\/TAC.2009.2031203","article-title":"On distributed averaging algorithms and quantization effects","volume":"54","author":"nedi?","year":"2009","journal-title":"IEEE Transactions on Automatic Control"},{"key":"ref54","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TAC.2008.2009515","article-title":"Distributed subgradient methods for multi-agent optimization","volume":"54","author":"nedi?","year":"2009","journal-title":"IEEE Transactions on Automatic Control"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-45076-4"},{"key":"ref52","doi-asserted-by":"crossref","first-page":"5538","DOI":"10.1109\/TAC.2017.2690401","article-title":"Fast convergence rates for distributed non-Bayesian learning","volume":"62","author":"nedi?","year":"2017","journal-title":"IEEE Transactions on Automatic Control"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-008-0261-6"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1561\/2200000050"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44914-2_31"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/15M1032600"},{"key":"ref82","first-page":"2015","article-title":"Splitting the smoothed primal-dual gap: Optimal alternating direction methods","author":"tran dinh","year":"2015","journal-title":"Tech Rep Tech Report LIONS-EPFL"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.2307\/2285509"},{"key":"ref81","first-page":"721","article-title":"Constrained convex minimization via model-based excessive gap","author":"tran-dinh","year":"2014","journal-title":"Advances in neural information processing systems"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/110826102"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1984.1103385"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0677-5"},{"key":"ref83","article-title":"A smooth primal-dual optimization framework for non-smooth composite convex minimization","author":"tran-dinh","year":"2015"},{"key":"ref19","first-page":"2013016","article-title":"First-order methods with inexact oracle: the strongly convex case","author":"devolder","year":"2013","journal-title":"CORE Discussion Papers"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.3182\/20140824-6-ZA-1003.02428"},{"key":"ref89","first-page":"2434","article-title":"On distributed optimization under inequality and equality constraints via penalty primal-dual methods","volume":"2010","author":"zhu","year":"2010","journal-title":"American Control Conference (ACC)"},{"key":"ref4","author":"bansal","year":"2017","journal-title":"Potential-function proofs for first-order methods"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542517080048"},{"key":"ref6","first-page":"1","volume":"42","author":"beck","year":"2014","journal-title":"A fast dual proximal gradient algorithm for convex minimization and applications Operations Research Letters"},{"key":"ref5","first-page":"183","volume":"2","author":"beck","year":"2009","journal-title":"A fast iterative shrinkage-thresholding algorithm for linear inverse problems SIAM Journal on Imaging Sciences"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619160"},{"key":"ref8","author":"bertsekas","year":"2003","journal-title":"Convex Analysis and Optimization"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-006-9080-1"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2014.2309751"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1137\/16M1084316"},{"key":"ref87","first-page":"3150","article-title":"A universal primal-dual convex optimization framework","author":"yurtsever","year":"2015","journal-title":"Advances in neural information processing systems"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2017.2672403"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1982.1102982"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2007159"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2015.02.038"},{"key":"ref48","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1109\/TAC.2014.2364096","article-title":"Distributed optimization over time-varying directed graphs","volume":"60","author":"nedi?","year":"2015","journal-title":"IEEE Transactions on Automatic Control"},{"key":"ref47","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1109\/JPROC.2018.2817461","article-title":"Network topology and communication-computation trade-offs in decentralized optimization","volume":"106","author":"nedi?","year":"2018","journal-title":"Proceedings of the IEEE"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2013.01.001"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7798551"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2250071"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619626"}],"event":{"name":"2020 Information Theory and Applications Workshop (ITA)","location":"San Diego, CA, USA","start":{"date-parts":[[2020,2,2]]},"end":{"date-parts":[[2020,2,7]]}},"container-title":["2020 Information Theory and Applications Workshop (ITA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9244865\/9244867\/09244951.pdf?arnumber=9244951","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T21:51:09Z","timestamp":1656453069000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9244951\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,2]]},"references-count":89,"URL":"https:\/\/doi.org\/10.1109\/ita50056.2020.9244951","relation":{},"subject":[],"published":{"date-parts":[[2020,2,2]]}}}