{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T18:36:16Z","timestamp":1780511776043,"version":"3.54.1"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"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":["CIF 1719205"],"award-info":[{"award-number":["CIF 1719205"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI 1832688"],"award-info":[{"award-number":["CMMI 1832688"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ARO","award":["W911NF1810238"],"award-info":[{"award-number":["W911NF1810238"]}]},{"name":"OP VVV","award":["CZ.02.1.01\/0.0\/0.0\/16_019\/0000765"],"award-info":[{"award-number":["CZ.02.1.01\/0.0\/0.0\/16_019\/0000765"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1109\/tac.2020.3033490","type":"journal-article","created":{"date-parts":[[2020,10,23]],"date-time":"2020-10-23T19:24:26Z","timestamp":1603481066000},"page":"4604-4619","source":"Crossref","is-referenced-by-count":16,"title":["Asynchronous Optimization Over Graphs: Linear Convergence Under Error Bound Conditions"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7161-6414","authenticated-orcid":false,"given":"Loris","family":"Cannelli","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7714-1210","authenticated-orcid":false,"given":"Francisco","family":"Facchinei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6453-6870","authenticated-orcid":false,"given":"Gesualdo","family":"Scutari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2229-8824","authenticated-orcid":false,"given":"Vyacheslav","family":"Kungurtsev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2017.2657460"},{"key":"ref38","article-title":"Newton-Raphson consensus under asynchronous and lossy communications for peer-to-peer networks","author":"bof","year":"2017"},{"key":"ref33","article-title":"Impact of communication delays on the convergence rate of distributed optimization algorithms","author":"doan","year":"2017"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2015.11.014"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120272"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2012.6315289"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/15M1024950"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2017.2695121"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2016.2593896"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2385046"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2014.2332306"},{"key":"ref27","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":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2015.12.017"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2012.2219629"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2013.6760336"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2013.6760448"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2015.2512043"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2013.6736937"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2607023"},{"key":"ref23","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 Top Signal Process"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7798262"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2730481"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3033490"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.2977940"},{"key":"ref11","article-title":"Distributed optimization based on gradient-tracking revisited: Enhancing convergence rate via surrogation","author":"sun","year":"2020"},{"key":"ref40","article-title":"Linearly convergent asynchronous distributed ADMM via Markov sampling","author":"shah","year":"2020"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/14096668X"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1986.1104412"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/140961134"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01408-w"},{"key":"ref16","first-page":"226","article-title":"The sound of APALM clapping: Faster nonsmooth nonconvex optimization with stochastic asynchronous PALM","author":"davis","year":"2016","journal-title":"Proc 30th Conf Adv Neural Inf Process Syst 29"},{"key":"ref17","volume":"23","author":"bertsekas","year":"1989","journal-title":"Parallel and Distributed Computation Numerical Methods"},{"key":"ref18","first-page":"693","article-title":"HOGWILD: A lock-free approach to parallelizing stochastic gradient descent","author":"niu","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst 24"},{"key":"ref19","first-page":"2719","article-title":"Asynchronous parallel stochastic gradient for nonconvex optimization","author":"lian","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst 28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF02096261"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2012.2207719"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/0801036"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/0330025"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-013-0015-x"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0170-0"},{"key":"ref49","article-title":"Asynchronous parallel algorithms for nonconvex big-data optimization Part II: Complexity and numerical results","author":"cannelli","year":"2017"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2017.0889"},{"key":"ref46","first-page":"1329","article-title":"Maximum-margin matrix factorization","author":"rennie","year":"2005","journal-title":"Proc Adv Neural Inf Process Syst 17"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/HPCC\/SmartCity\/DSS.2019.00016"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2399858"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2537271"},{"key":"ref41","article-title":"A block-wise, asynchronous and distributed ADMM algorithm for general form consensus optimization","author":"zhu","year":"2018"},{"key":"ref44","first-page":"1701","article-title":"Asynchronous distributed ADMM for consensus optimization","author":"zhang","year":"2014","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2018.8646514"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/9\/9547356\/9238434-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/9547356\/09238434.pdf?arnumber=9238434","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:53:09Z","timestamp":1652194389000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9238434\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10]]},"references-count":50,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tac.2020.3033490","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,10]]}}}