{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T14:22:13Z","timestamp":1774966933330,"version":"3.50.1"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1350264"],"award-info":[{"award-number":["1350264"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1903972"],"award-info":[{"award-number":["1903972"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1935555"],"award-info":[{"award-number":["1935555"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1109\/tac.2020.2969721","type":"journal-article","created":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T20:33:46Z","timestamp":1580157226000},"page":"4769-4780","source":"Crossref","is-referenced-by-count":109,"title":["Decentralized Optimization Over Time-Varying Directed Graphs With Row and Column-Stochastic Matrices"],"prefix":"10.1109","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3973-5763","authenticated-orcid":false,"given":"Fakhteh","family":"Saadatniaki","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1697-9116","authenticated-orcid":false,"given":"Ran","family":"Xin","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","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1016\/j.ins.2017.09.038","article-title":"Geometrical convergence rate for distributed optimization with time-varying directed graphs and uncoordinated step-sizes","volume":"422","author":"l\u00fc","year":"2018","journal-title":"Inf Sci"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2010.2091295"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2018.2834316"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2672698"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/14096668X"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1186\/s13634-018-0596-y"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636055"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2942513"},{"key":"ref35","article-title":"Momentum and stochastic momentum for stochastic gradient, newton, proximal point and subspace descent methods","author":"loizou","year":"0","journal-title":"arXiv 1712 09677"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2937496"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2737582"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2009.10.021"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2797164"},{"key":"ref2","first-page":"887","article-title":"Distributed optimization in adaptive networks","author":"moallemi","year":"0","journal-title":"Proc 16th Adv Neural Inf Process Syst"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2013.2260813"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513273"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2615066"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.06.038"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2015.7402509"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2012.08.003"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/16M1084316"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2017.2698261"},{"key":"ref50","author":"horn","year":"2013","journal-title":"Matrix Analysis"},{"key":"ref51","article-title":"UCI Machine Learning Repository","author":"dorksen","year":"2013"},{"key":"ref57","author":"powell","year":"0","journal-title":"arXiv 1112 4379"},{"key":"ref56","author":"bertsekas","year":"1999","journal-title":"Nonlinear Programming"},{"key":"ref55","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1109\/TAC.2016.2572004","article-title":"On convergence rate of weighted-averaging dynamics for consensus problems","volume":"62","author":"nedi?","year":"2017","journal-title":"IEEE Trans Autom Control"},{"key":"ref54","article-title":"Problems in decentralized decision making and computation","author":"tsitsiklis","year":"1984"},{"key":"ref53","author":"seneta","year":"2006","journal-title":"Non-Negative Matrices and Markov Chains"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/BF01565412"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1986.1104412"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2730481"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2161027"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/130943170"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6425904"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2254478"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426375"},{"key":"ref17","article-title":"The role of the network in distributed optimization algorithms: Convergence rates, scalability, communication\/computation tradeoffs and communication delays","author":"tsianos","year":"2013"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2364096"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238221"},{"key":"ref4","first-page":"2013","article-title":"Online learning of dynamic parameters in social networks","author":"shahrampour","year":"0","journal-title":"Proc 26th Adv Neural Inf Process Syst"},{"key":"ref3","first-page":"550","article-title":"Distributed dual averaging in networks","author":"agarwal","year":"0","journal-title":"Proc 23rd Adv Neural Inf Process Syst"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2472372"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/984622.984626"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2875883"},{"key":"ref7","first-page":"9649","article-title":"Multi-agent reinforcement learning via double averaging primal-dual optimization","author":"wai","year":"0","journal-title":"Proc 31st Adv Neural Inf Process Syst"},{"key":"ref49","article-title":"Asynchronous subgradient-push","author":"assran","year":"2019","journal-title":"arXiv 1803 08950"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2823638"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/0724077"},{"key":"ref45","first-page":"53","article-title":"Some global convergence properties of a variable metric algorithm for minimization without exact line searches","author":"powell","year":"0","journal-title":"Nonlinear Programming"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2017.2695121"},{"key":"ref47","author":"nocedal","year":"2006","journal-title":"Numerical Optimization"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2291221"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0467-x"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2666776"},{"key":"ref43","article-title":"Convergence rates for distributed stochastic optimization over random networks","author":"jakoveti?","year":"0","journal-title":"Proc 57th IEEE Conf Decis Control"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/9\/9240131\/8970578-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/9240131\/08970578.pdf?arnumber=8970578","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T16:07:28Z","timestamp":1651075648000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8970578\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11]]},"references-count":57,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tac.2020.2969721","relation":{},"ISSN":["0018-9286","1558-2523","2334-3303"],"issn-type":[{"value":"0018-9286","type":"print"},{"value":"1558-2523","type":"electronic"},{"value":"2334-3303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11]]}}}