{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T09:14:57Z","timestamp":1754558097866,"version":"3.37.3"},"reference-count":67,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Key Laboratory of Industrial Internet of Things & Networked Control, Ministry of Education","award":["2021FF09"],"award-info":[{"award-number":["2021FF09"]}]},{"name":"China Post doctoral Science Foundation","award":["2021M700588"],"award-info":[{"award-number":["2021M700588"]}]},{"name":"National Key R&D Program of China","award":["2018AAA0100101"],"award-info":[{"award-number":["2018AAA0100101"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Sci. Eng."],"published-print":{"date-parts":[[2022,5,1]]},"DOI":"10.1109\/tnse.2022.3153386","type":"journal-article","created":{"date-parts":[[2022,2,25]],"date-time":"2022-02-25T20:33:55Z","timestamp":1645821235000},"page":"1789-1801","source":"Crossref","is-referenced-by-count":6,"title":["ET-DASG: An Efficient Decentralized Algorithm for Convex Optimization Over Networks"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3602-0946","authenticated-orcid":false,"given":"Qingguo","family":"Lu","sequence":"first","affiliation":[{"name":"College of Computer Science, Chongqing University, Chongqing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3566-8161","authenticated-orcid":false,"given":"Xiaofeng","family":"Liao","sequence":"additional","affiliation":[{"name":"College of Computer Science, Chongqing University, Chongqing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1246-7399","authenticated-orcid":false,"given":"Shaojiang","family":"Deng","sequence":"additional","affiliation":[{"name":"College of Computer Science, Chongqing University, Chongqing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6310-8965","authenticated-orcid":false,"given":"Huaqing","family":"Li","sequence":"additional","affiliation":[{"name":"College of Electronic and Information Engineering, Southwest University, Chongqing, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2975212"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2019.2933177"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2691760"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2019.2923959"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2020.2975369"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2018.2859420"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2975210"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2014.2363554"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2016.2521377"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2017.2713396"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.2994024"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2020.3007472"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2018.2816902"},{"key":"ref15","first-page":"7505","article-title":"Provably accelerated randomized gossip algorithms","volume-title":"Proc. IEEE Int. Conf. Acoust., Speech, Signal Process.","author":"Zhu","year":"2019"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2298712"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-control-060117-105131"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2018.2848288"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/16M1084316"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2017.2698261"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.09.038"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2018.2834316"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/14096668X"},{"article-title":"Convergence rate of distributed optimization algorithms based on gradient tracking","year":"2019","author":"Sun","key":"ref24"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.2972824"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9029824"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-01357-w"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2020.3006420"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cta.2018.6026"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2019.2919941"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2981762"},{"article-title":"On privacy-preserving decentralized optimization through alternating direction method of multipliers","year":"2019","author":"Xiao","key":"ref32"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8683797"},{"issue":"159","key":"ref34","first-page":"1","article-title":"Optimal convergence rates for convex distributed optimization in networks","volume":"20","author":"Scaman","year":"2019","journal-title":"J. Mach. Learn. Res."},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ITA50056.2020.9244951"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3009363"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2019.2925537"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2019.2960770"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2942513"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2020.2965999"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/201"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2916985"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8618863"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2015.2479558"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijepes.2020.106159"},{"article-title":"Distributed stochastic gradient descent and convergence to local minima","year":"2020","author":"Swenson","key":"ref47"},{"key":"ref48","first-page":"344","article-title":"Stochastic gradient push for distributed deep learning","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Assran","year":"2019"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2017.12.053"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2505682"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1030-6"},{"key":"ref52","first-page":"1646","article-title":"SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Defazio","year":"2014"},{"key":"ref53","first-page":"685","article-title":"Barzilai-borwein step size for stochastic average gradient","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Tan","year":"2016"},{"key":"ref54","first-page":"2613","article-title":"SARAH: A novel method for machine learning problems using stochastic recursive gradient","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Nguyen","year":"2017"},{"issue":"1","key":"ref55","first-page":"2165","article-title":"DSA: Decentralized double stochastic averaging gradient algorithm","volume":"17","author":"Mokhtari","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref56","first-page":"4624","article-title":"Towards more efficient stochastic decentralized learning: Faster convergence and sparse communication","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","author":"Shen","year":"2019"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2872003"},{"issue":"32","key":"ref58","first-page":"1954","article-title":"An accelerated decentralized stochastic proximal algorithm for finite sums","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hendrikx","year":"2019"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2974267"},{"key":"ref60","first-page":"1662","article-title":"Communication-efficient distributed optimization in networks with gradient tracking and variance reduction","volume-title":"Proc. 23rd Int. Conf. Artif. Intell. Statist.","author":"Li","year":"2020"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2010.2079650"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636055"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2006.879312"},{"volume-title":"UCI Machine Learning Repository","year":"2017","author":"Dua","key":"ref64"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511810817"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2020.3028013"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1137\/21m1394308"}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6488902\/9781297\/09721638.pdf?arnumber=9721638","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T23:10:05Z","timestamp":1705533005000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9721638\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,1]]},"references-count":67,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tnse.2022.3153386","relation":{},"ISSN":["2327-4697","2334-329X"],"issn-type":[{"type":"electronic","value":"2327-4697"},{"type":"electronic","value":"2334-329X"}],"subject":[],"published":{"date-parts":[[2022,5,1]]}}}