{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T07:34:52Z","timestamp":1763105692581,"version":"3.37.3"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61806096"],"award-info":[{"award-number":["61806096"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2967843","type":"journal-article","created":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T12:32:14Z","timestamp":1579609934000},"page":"20607-20615","source":"Crossref","is-referenced-by-count":6,"title":["A Fast Alternating Direction Method of Multipliers Algorithm for Big Data Applications"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7954-3125","authenticated-orcid":false,"given":"Huihui","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingguo","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"2595","article-title":"Parallelized stochastic gradient descent","author":"zinkevich","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1023\/A:1004603514434"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1137\/120896219"},{"key":"ref32","first-page":"629","article-title":"Trading computation for communication: Distributed stochastic dual coordinate ascent","author":"yang","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1137\/110836936"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1109\/TSP.2014.2304432"},{"key":"ref37","first-page":"753","article-title":"Fast ADMM algorithm for distributed optimization with adaptive penalty","volume":"2016","author":"song","year":"0","journal-title":"Proc AAAI"},{"key":"ref36","article-title":"Adaptive ADMM with spectral penalty parameter selection","author":"xu","year":"2016","journal-title":"arXiv 1605 07246"},{"key":"ref35","first-page":"736","article-title":"Stochastic dual coordinate ascent with alternating direction method of multipliers","author":"suzuki","year":"2014","journal-title":"Proc ICML"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1145\/2783258.2783400"},{"key":"ref28","first-page":"1701","article-title":"Asynchronous distributed ADMM for consensus optimization","author":"zhang","year":"2014","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref27","first-page":"46","article-title":"Fast stochastic alternating direction method of multipliers","author":"zhong","year":"2014","journal-title":"Proc 31th Int Conf Mach Learn"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1109\/TSP.2013.2254478"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/TCSS.2019.2906925"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1016\/j.future.2019.01.012"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1145\/3323926"},{"key":"ref22","article-title":"Distributed training of structured SVM","author":"lee","year":"2015","journal-title":"arXiv 1506 02620"},{"key":"ref21","article-title":"Large-scale supervised hierarchical feature learning for face recognition","author":"li","year":"2014","journal-title":"arXiv 1407 1490"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1109\/TCYB.2016.2570808"},{"key":"ref23","first-page":"1","article-title":"Distributed box-constrained quadratic optimization for dual linear SVM","author":"lee","year":"2015","journal-title":"Proc 32nd Int Conf Mach Learn"},{"key":"ref26","first-page":"1398","article-title":"Efficient distributed linear classification algorithms via the alternating direction method of multipliers","author":"zhang","year":"2012","journal-title":"Proc Int Conf Artif Intell Statist"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1109\/JPROC.2012.2188013"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1145\/1791212.1791218"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1016\/j.jnca.2019.02.008"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1109\/CDC.2012.6426691"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1007\/s11280-019-00684-y"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1016\/j.jnca.2018.09.006"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1155\/2018\/3075849"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/TC.2019.2935042"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/TSC.2019.2963301"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/WI-IAT.2010.30"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1016\/j.jpdc.2007.06.014"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1561\/2200000016"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/MNET.2018.1800192"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1145\/3330139"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1016\/j.future.2018.12.055"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1007\/s11265-016-1114-9"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1186\/s13638-019-1561-7"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/MCOM.2017.1700360"},{"doi-asserted-by":"publisher","key":"ref49","DOI":"10.1145\/1383422.1383459"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/JIOT.2019.2944007"},{"doi-asserted-by":"publisher","key":"ref46","DOI":"10.1109\/TAC.2014.2354892"},{"doi-asserted-by":"publisher","key":"ref45","DOI":"10.1007\/s10107-014-0826-5"},{"doi-asserted-by":"publisher","key":"ref48","DOI":"10.1145\/1390156.1390208"},{"key":"ref47","first-page":"2089","article-title":"Adaptive primal-dual splitting methods for statistical learning and image processing","author":"goldstein","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref42","first-page":"19","article-title":"Communication efficient distributed machine learning with the parameter server","author":"li","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref41","first-page":"165","article-title":"Optimal distributed online prediction using mini-batches","volume":"13","author":"dekel","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref44","article-title":"L1-regularized distributed optimization: A communication-efficient primal-dual framework","author":"smith","year":"2015","journal-title":"arXiv 1512 04011"},{"key":"ref43","first-page":"3068","article-title":"Communication-efficient distributed dual coordinate ascent","author":"jaggi","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/08963624.pdf?arnumber=8963624","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:51:02Z","timestamp":1639770662000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8963624\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2967843","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}