{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T15:13:27Z","timestamp":1784646807718,"version":"3.55.0"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF Career Award","award":["CCF-1350264"],"award-info":[{"award-number":["CCF-1350264"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Control Syst. Lett."],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1109\/lcsys.2018.2834316","type":"journal-article","created":{"date-parts":[[2018,5,8]],"date-time":"2018-05-08T19:07:17Z","timestamp":1525806437000},"page":"315-320","source":"Crossref","is-referenced-by-count":239,"title":["A Linear Algorithm for Optimization Over Directed Graphs With Geometric Convergence"],"prefix":"10.1109","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1697-9116","authenticated-orcid":false,"given":"Ran","family":"Xin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0853-6518","authenticated-orcid":false,"given":"Usman A.","family":"Khan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2472372"},{"key":"ref11","article-title":"Approximate projection methods for decentralized optimization with functional constraints","author":"lee","year":"0","journal-title":"IEEE Trans Autom Control"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2017.8264076"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2017.10.007"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3166\/EJC.18.539-557"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426375"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2364096"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238221"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.06.038"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2615066"},{"key":"ref28","doi-asserted-by":"crossref","DOI":"10.1561\/9781601988614","author":"bubeck","year":"2015","journal-title":"Convex optimization Algorithms and complexity"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2015.7402509"},{"key":"ref27","author":"horn","year":"2013","journal-title":"Matrix Analysis"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/14096668X"},{"key":"ref6","author":"qu","year":"2017","journal-title":"Accelerated distributed nesterov gradient descent"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7798263"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2182347"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2009.10.021"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/130943170"},{"key":"ref9","author":"jakovetic","year":"2017","journal-title":"A Unification Generalization and Acceleration of Exact Distributed First Order Methods"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2012.08.003"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2737582"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2672698"},{"key":"ref24","article-title":"Linear convergence in optimization over directed graphs with row-stochastic matrices","author":"xi","year":"0","journal-title":"IEEE Trans Autom Control"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/16M1084316"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831470"},{"key":"ref25","author":"xin","year":"2018","journal-title":"FROST—Fast Row-Stochastic Optimization With Uncoordinated Step-Sizes"}],"container-title":["IEEE Control Systems Letters"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/7782633\/8361597\/8355917-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7782633\/8361597\/08355917.pdf?arnumber=8355917","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:55:08Z","timestamp":1649444108000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8355917\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":28,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/lcsys.2018.2834316","relation":{},"ISSN":["2475-1456"],"issn-type":[{"value":"2475-1456","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7]]}}}