{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T16:20:19Z","timestamp":1782318019844,"version":"3.54.5"},"reference-count":61,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"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":["CCF-1553746"],"award-info":[{"award-number":["CCF-1553746"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1531050"],"award-info":[{"award-number":["CCF-1531050"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006021","name":"Direction G\u00e9n\u00e9rale de l\u2019Armement","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006021","id-type":"DOI","asserted-by":"publisher"}]},{"name":"labex LMH","award":["ANR-11-LABX-0056-LMH"],"award-info":[{"award-number":["ANR-11-LABX-0056-LMH"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1109\/tac.2017.2685559","type":"journal-article","created":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T01:53:20Z","timestamp":1490147600000},"page":"5522-5537","source":"Crossref","is-referenced-by-count":89,"title":["Decentralized Frank\u2013Wolfe Algorithm for Convex and Nonconvex Problems"],"prefix":"10.1109","volume":"62","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4796-4483","authenticated-orcid":false,"given":"Hoi-To","family":"Wai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean","family":"Lafond","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anna","family":"Scaglione","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eric","family":"Moulines","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","article-title":"On the online Frank-Wolfe algorithms for convex and non-convex optimizations","volume":"abs 1510 1171v2","author":"lafond","year":"2016","journal-title":"CoRR"},{"key":"ref38","article-title":"Convergence rate of Frank-Wolfe for non-convex objectives","volume":"abs 1607 345","author":"lacoste-julien","year":"2016","journal-title":"CoRR"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10599-4_17"},{"key":"ref32","first-page":"471","article-title":"A simple algorithm for nuclear norm regularized problems","author":"jaggi","year":"0","journal-title":"Proc 27th Int Conf Mach Learn"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(83)90159-2"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030109"},{"key":"ref37","article-title":"Computing worst-case input models in stochastic simulation","volume":"abs 1507 5609","author":"ghosh","year":"2015","journal-title":"CoRR"},{"key":"ref36","first-page":"427","article-title":"Revisiting Frank-Wolfe: Projection-free sparse convex optimization","author":"jaggi","year":"0","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2615(84)90029-8"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2016.2582903"},{"key":"ref60","author":"horn","year":"1994","journal-title":"Topics in Matrix Analysis"},{"key":"ref61","author":"massart","year":"2003","journal-title":"Concentration Inequalities and Model Selection"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2416687"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2016.2524588"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2015.7178631"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2016.7905887"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7472457"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2015.2449811"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2161027"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2308612"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-015-0758-0"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2013.6736937"},{"key":"ref26","article-title":"A parallel stochastic approximation method for nonconvex multi-agent optimization problems","volume":"abs 1410 5076","author":"yang","year":"2014","journal-title":"CoRR"},{"key":"ref25","article-title":"Decomposing linearly constrained nonconvex problems by a proximal primal dual approach: Algorithms, convergence, and applications","volume":"abs 1604 543","author":"hong","year":"2016","journal-title":"CoRR"},{"key":"ref50","first-page":"389","article-title":"Fast sparse representation based on smoothed L0 norm","author":"mohimani","year":"0","journal-title":"Proc Int Conf Independent Component Anal Signal Separation"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2011.01.036"},{"key":"ref59","first-page":"79","article-title":"Convergence conditions for nonlinear programming algorithms","author":"nirminskii","year":"1972","journal-title":"Cybernetics"},{"key":"ref58","author":"polyak","year":"1987","journal-title":"Introduction to Optimization"},{"key":"ref57","article-title":"Sparco: A testing framework for sparse reconstruction","author":"berg","year":"2007"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2004.02.022"},{"key":"ref54","doi-asserted-by":"crossref","DOI":"10.1002\/0471478210","author":"attiya","year":"2004","journal-title":"Distributed Computing Fundamentals Simulations and Advanced Topics"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.919636"},{"key":"ref52","article-title":"Iterative hard thresholding for compressed sensing","volume":"abs 805 510","author":"blumensath","year":"2008","journal-title":"CoRR"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2052531"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2012.2209984"},{"key":"ref40","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10107-015-0871-8","article-title":"Accelerated gradient methods for nonconvex nonlinear and stochastic programming","volume":"156","author":"ghadimi","year":"2015","journal-title":"Math Program"},{"key":"ref12","article-title":"Fast distributed first-order methods","author":"chen","year":"2012"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7798263"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2008.4739339"},{"key":"ref15","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":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2461520"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2298712"},{"key":"ref18","article-title":"Achieving geometric convergence for distributed optimization over time-varying graphs","volume":"abs 1607 3218","author":"nedi?","year":"2016","journal-title":"CoRR"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2276440"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2231991"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2329397"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/090755436"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2340812"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2500887"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394889"},{"key":"ref9","article-title":"Problems in decentralized decision making and computation","author":"tsitsiklis","year":"1984"},{"key":"ref46","first-page":"913","article-title":"Distributed matrix completion and robust factorization","volume":"16","author":"mackey","year":"2015","journal-title":"J Mach Learn Res"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2012.6288528"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-013-0053-8"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.168"},{"key":"ref42","doi-asserted-by":"crossref","DOI":"10.56021\/9781421407944","author":"golub","year":"2013","journal-title":"Matrix Computations"},{"key":"ref41","first-page":"272","article-title":"Efficient projections onto the $\\ell _1$-ball for learning in high dimensions","author":"duchi","year":"0","journal-title":"Proc 25th Int Conf Mach Learn"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2008.5074720"},{"key":"ref43","first-page":"1646","article-title":"SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives","author":"defazio","year":"0","journal-title":"Proc Adv Neur Inf Process Syst"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/9\/8082390\/7883821-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/8082390\/07883821.pdf?arnumber=7883821","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T04:54:09Z","timestamp":1719118449000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7883821\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11]]},"references-count":61,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tac.2017.2685559","relation":{},"ISSN":["0018-9286","1558-2523"],"issn-type":[{"value":"0018-9286","type":"print"},{"value":"1558-2523","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11]]}}}