{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T10:10:05Z","timestamp":1790763005322,"version":"4.1.0"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1109\/tac.2020.2981035","type":"journal-article","created":{"date-parts":[[2020,3,16]],"date-time":"2020-03-16T22:17:41Z","timestamp":1584397061000},"page":"168-183","source":"Crossref","is-referenced-by-count":58,"title":["Asynchronous Gradient Push"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9159-8447","authenticated-orcid":false,"given":"Mahmoud S.","family":"Assran","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0536-7904","authenticated-orcid":false,"given":"Michael G.","family":"Rabbat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.2977940"},{"key":"ref38","article-title":"Asynchronous subgradient push: Fast, robust, and scalable multi-agent optimization","author":"assran","year":"2018"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2013.6736937"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2013.6760448"},{"key":"ref31","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":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2052531"},{"key":"ref37","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":"ref36","doi-asserted-by":"publisher","DOI":"10.2307\/2034984"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100033399"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2015.2512043"},{"key":"ref10","article-title":"Asynchronous parallel algorithms for nonconvex big-data optimization. Part II: Complexity and numerical results","author":"cannelli","year":"2017"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/356068.356075"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2662019"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2016.2593896"},{"key":"ref13","article-title":"Asynchronous algorithms for large-scale optimization: Analysis and implementation","author":"aytekin","year":"2017"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2016.7869516"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(96)00024-5"},{"key":"ref16","first-page":"4711","article-title":"On the rate of convergence of distributed subgradient methods for multi-agent optimization","author":"nedi?","year":"0","journal-title":"Proc 46th IEEE Conf Decis Control"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513273"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2015.2426732"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2275669"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2017.8264076"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483403"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2666776"},{"key":"ref3","first-page":"1943","article-title":"Communication\/computation tradeoffs in consensus-based distributed optimization","author":"tsianos","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874516"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238221"},{"key":"ref8","first-page":"3049","article-title":"Asynchronous decentralized parallel stochastic gradient descent","author":"lian","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2014.7039532"},{"key":"ref2","volume":"23","author":"bertsekas","year":"1989","journal-title":"Parallel and Distributed Computation Numerical Methods"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2017.8309024"},{"key":"ref1","first-page":"953","article-title":"Network topology and communication-computation tradeoffs in decentralized optimization","volume":"106","author":"nedi?","year":"0","journal-title":"Proc IEEE"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426375"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2930234"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2672698"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2364096"},{"key":"ref42","article-title":"UCI machine learning repository","author":"dua","year":"2019"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/16M1084316"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-1699(99)00046-0"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"383","DOI":"10.4208\/jcm.1606-m2015-0452","article-title":"Extrapush for convex smooth decentralized optimization over directed networks","volume":"35","author":"zeng","year":"2017","journal-title":"J Comput Math"},{"key":"ref44","article-title":"Asynchronous subgradient-push","author":"assran","year":"2018"},{"key":"ref26","first-page":"612","article-title":"Asymptotic agreement and convergence of asynchronous stochastic algorithms","volume":"ac 32","author":"li","year":"1987","journal-title":"IEEE Trans Autom Control"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2015.2471695"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1986.1104412"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/9306029\/09036910.pdf?arnumber=9036910","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T10:53:03Z","timestamp":1652179983000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9036910\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":45,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tac.2020.2981035","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":[[2021,1]]}}}