{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T16:32:42Z","timestamp":1783787562280,"version":"3.55.0"},"reference-count":58,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"17","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"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","award":["DMS-1621798"],"award-info":[{"award-number":["DMS-1621798"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2019,9,1]]},"DOI":"10.1109\/tsp.2019.2926022","type":"journal-article","created":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T20:01:04Z","timestamp":1562702464000},"page":"4494-4506","source":"Crossref","is-referenced-by-count":184,"title":["A Decentralized Proximal-Gradient Method With Network Independent Step-Sizes and Separated Convergence Rates"],"prefix":"10.1109","volume":"67","author":[{"given":"Zhi","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9511-3838","authenticated-orcid":false,"given":"Wei","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8686-3530","authenticated-orcid":false,"given":"Ming","family":"Yan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2016.2524588"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2015.7402509"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483273"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2304432"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2673815"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2367458"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2009.10.021"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/14096668X"},{"key":"ref35","volume":"87","author":"nesterov","year":"2013","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2298712"},{"key":"ref28","author":"bertsekas","year":"1997","journal-title":"Parallel and Distributed Computation Numerical Methods"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.3182\/20110828-6-IT-1002.01959"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2013.6736937"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2006.08.010"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2461520"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/080726380"},{"key":"ref22","article-title":"Incremental constraint projection-proximal methods for nonsmooth convex optimization","author":"wang","year":"2013"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0472-0"},{"key":"ref24","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":"J Optim Theory Appl"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/130943170"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"1337","DOI":"10.1109\/TAC.2010.2079650","article-title":"Asynchronous broadcast-based convex optimization over a network","volume":"56","author":"nedi?","year":"2011","journal-title":"IEEE Trans Autom Control"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2875883"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2009.2031203"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557082"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144503423264"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-018-0680-3"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2017.2695121"},{"key":"ref54","article-title":"Optimal algorithms for distributed optimization","author":"uribe","year":"2017"},{"key":"ref53","first-page":"3027","article-title":"Optimal algorithms for smooth and strongly convex distributed optimization in networks","author":"scaman","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref52","first-page":"2260","article-title":"Accelerated distributed Nesterov gradient descent for convex and smooth functions","author":"qu","year":"0","journal-title":"Proc IEEE 56th Annu Conf Decis Control"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/984622.984626"},{"key":"ref11","first-page":"1663","article-title":"Consensus-based distributed support vector machines","volume":"59","author":"forero","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7798263"},{"key":"ref12","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 Trans Autom Control"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF02591967"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1986.1104412"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2329397"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6594-6_11"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623499362111"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S1570-579X(01)80023-9"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/16M1076629"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2305952"},{"key":"ref6","first-page":"4237","article-title":"Consensus based formation control strategies for multi-vehicle systems","author":"ren","year":"0","journal-title":"Proc Amer Control Conf"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2038417"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062275"},{"key":"ref7","article-title":"efficient information aggregation strategies for distributed control and signal processing","author":"olshevsky","year":"2010"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2875883"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2012.2210288"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2016.7869154"},{"key":"ref45","first-page":"381","article-title":"ExtraPush for convex smooth decentralized optimization over directed networks","volume":"35","author":"zeng","year":"2017","journal-title":"J Comput Math"},{"key":"ref48","article-title":"Linear convergence of primal-dual gradient methods and their performance in distributed optimization","author":"alghunaim","year":"2019"},{"key":"ref47","article-title":"A primal-dual algorithm with optimal stepsizes and its application in decentralized consensus optimization","author":"li","year":"2017"},{"key":"ref42","first-page":"3950","article-title":"Geometrically convergent distributed optimization with uncoordinated step-sizes","author":"nedi?","year":"0","journal-title":"Proc Amer Control Conf"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/16M1084316"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2672698"},{"key":"ref43","first-page":"6855","article-title":"Distributed optimization over time-varying directed graphs","author":"nedi?","year":"0","journal-title":"Proc 52nd IEEE Conf Decis Control"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/78\/8789628\/8752033-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/8789628\/08752033.pdf?arnumber=8752033","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:45:25Z","timestamp":1657745125000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8752033\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,1]]},"references-count":58,"journal-issue":{"issue":"17"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2019.2926022","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,1]]}}}