{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:34:50Z","timestamp":1773930890021,"version":"3.50.1"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"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":["1903972"],"award-info":[{"award-number":["1903972"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1350264"],"award-info":[{"award-number":["1350264"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Signal Process. Lett."],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1109\/lsp.2019.2925537","type":"journal-article","created":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T19:47:27Z","timestamp":1561751247000},"page":"1247-1251","source":"Crossref","is-referenced-by-count":62,"title":["Distributed Nesterov Gradient Methods Over Arbitrary Graphs"],"prefix":"10.1109","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1697-9116","authenticated-orcid":false,"given":"Ran","family":"Xin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3497-5589","authenticated-orcid":false,"given":"Dusan","family":"Jakovetic","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0853-6518","authenticated-orcid":false,"given":"Usman A.","family":"Khan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","article-title":"Second-order guarantees of distributed gradient algorithms","author":"daneshmand","year":"2018"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619047"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2018.2834316"},{"key":"ref32","article-title":"Distributed heavy-ball: A generalization and acceleration of first-order methods with gradient tracking","author":"xin","year":"2018"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2012.08.003"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513273"},{"key":"ref37","article-title":"Optimization over time-varying directed graphs with row and column-stochastic matrices","author":"saadatniaki","year":"2018"},{"key":"ref36","article-title":"Accelerated distributed Nesterov gradient descent","author":"qu","year":"2017"},{"key":"ref35","author":"polyak","year":"1987","journal-title":"Introduction to Optimization"},{"key":"ref34","volume":"87","author":"nesterov","year":"2013","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"key":"ref10","first-page":"2745","article-title":"Optimal algorithms for non-smooth distributed optimization in networks","author":"scaman","year":"0","journal-title":"Proc Annu Conf Neural Inf Process Syst"},{"key":"ref40","author":"horn","year":"2013","journal-title":"Matrix Analysis"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2009.4960418"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1109\/JSTSP.2011.2118740","article-title":"Distributed asynchronous constrained stochastic optimization","volume":"5","author":"nedi?","year":"2011","journal-title":"IEEE J Sel Topics Signal Process"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2013.2247023"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2014.2346657"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2004.834113"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2004.02.022"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2015.7402509"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2017.2698261"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1186\/s13634-018-0596-y"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2823638"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2797164"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2016.2613678"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238221"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1791212.1791218"},{"key":"ref8","first-page":"5330","article-title":"Can decentralized algorithms outperform centralized algorithms? A case study for decentralized parallel stochastic gradient descent","author":"lian","year":"0","journal-title":"Proc Annu Conf Neural Inf Process Syst"},{"key":"ref7","first-page":"9649","article-title":"Multi-agent reinforcement learning via double averaging primal-dual optimization","author":"wai","year":"0","journal-title":"Proc Annu Conf Neural Inf Process Syst"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2198470"},{"key":"ref9","first-page":"1529","article-title":"Prox-PDA: The proximal primal-dual algorithm for fast distributed nonconvex optimization and learning over networks","author":"hong","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/984622.984626"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/14096668X"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2364096"},{"key":"ref21","article-title":"The role of the network in distributed optimization algorithms: Convergence rates, scalability, communication\/computation tradeoffs and communication delays","author":"tsianos","year":"0"},{"key":"ref42","article-title":"ASY-SONATA: Achieving geometric convergence for distributed asynchronous optimization","author":"tian","year":"2018"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.06.038"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2017.2695121"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2615066"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/16M1084316"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2737582"}],"container-title":["IEEE Signal Processing Letters"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/97\/8737789\/8750869-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/97\/8737789\/08750869.pdf?arnumber=8750869","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:52:02Z","timestamp":1657745522000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8750869\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":42,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/lsp.2019.2925537","relation":{},"ISSN":["1070-9908","1558-2361"],"issn-type":[{"value":"1070-9908","type":"print"},{"value":"1558-2361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8]]}}}