{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T08:18:30Z","timestamp":1768551510549,"version":"3.49.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T00:00:00Z","timestamp":1646352000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T00:00:00Z","timestamp":1646352000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10489-022-03319-4","type":"journal-article","created":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T20:02:35Z","timestamp":1646424155000},"page":"14233-14245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A faster stochastic alternating direction method for large scale convex composite problems"],"prefix":"10.1007","volume":"52","author":[{"given":"Jia","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tiande","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7587-3573","authenticated-orcid":false,"given":"Tong","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,4]]},"reference":[{"issue":"2","key":"3319_CR1","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou L, Curtis FE, Nocedal J (2018) Optimization methods for large-scale machine learning. SIAM Rev 60(2):223\u2013311","journal-title":"SIAM Rev"},{"key":"3319_CR2","unstructured":"Johnson R, Zhang T (2013) Accelerating stochastic gradient descent using predictive variance reduction. In: Advances in neural information processing systems, pp 315\u2013323"},{"issue":"4","key":"3319_CR3","doi-asserted-by":"publisher","first-page":"2057","DOI":"10.1137\/140961791","volume":"24","author":"L Xiao","year":"2014","unstructured":"Xiao L, Zhang T (2014) A proximal stochastic gradient method with progressive variance reduction. SIAM J Optim 24(4):2057\u20132075","journal-title":"SIAM J Optim"},{"key":"3319_CR4","unstructured":"Zheng S, Kwok JT (2016) Fast-and-light stochastic admm. In: International joint conference on artificial intelligence, pp 2407\u20132613"},{"issue":"2","key":"3319_CR5","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1109\/JSTSP.2015.2505682","volume":"10","author":"J Kone\u010dny\u0300","year":"2015","unstructured":"Kone\u010dny\u0300 J, Liu J, Richt\u00e1rik P, Tak\u00e1\u010d M (2015) Mini-batch semi-stochastic gradient descent in the proximal setting. IEEE J Sel Top Signal Process 10(2):242\u2013255","journal-title":"IEEE J Sel Top Signal Process"},{"issue":"4","key":"3319_CR6","doi-asserted-by":"publisher","first-page":"2341","DOI":"10.1137\/120880811","volume":"23","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi S, Lan G (2013) Stochastic first-and zeroth-order methods for nonconvex stochastic programming. SIAM J Optim 23(4):2341\u20132368","journal-title":"SIAM J Optim"},{"issue":"1-2","key":"3319_CR7","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10107-014-0846-1","volume":"155","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi S, Lan G, Zhang H (2016) Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization. Math Program 155(1-2):267\u2013305","journal-title":"Math Program"},{"issue":"2","key":"3319_CR8","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/080725891","volume":"2","author":"T Goldstein","year":"2009","unstructured":"Goldstein T, Osher S (2009) The split bregman method for l1-regularized problems. SIAM J Imag Sci 2(2):323\u2013343","journal-title":"SIAM J Imag Sci"},{"issue":"1-2","key":"3319_CR9","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1137\/090777761","volume":"33","author":"J Yang","year":"2011","unstructured":"Yang J, Zhang Y (2011) Alternating direction algorithms for l1-problem in compressive sensing. SIAM J Sci Comput 33(1-2):250\u2013278","journal-title":"SIAM J Sci Comput"},{"issue":"1","key":"3319_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd S, Parikh N, Chu E, Peleato B, Eckstein J, et al. (2011) Distributed optimization and statistical learning via the alternating direction method of multipliers. Found Trends Mach Learn 3 (1):1\u2013122","journal-title":"Found Trends Mach Learn"},{"issue":"R2","key":"3319_CR11","first-page":"41","volume":"9","author":"R Glowinski","year":"1975","unstructured":"Glowinski R, Marroco A (1975) Sur l\u2019approximation, par \u00e9l\u00e9ments finis d\u2019ordre un, et la r\u00e9solution, par p\u00e9nalisation-dualit\u00e9 d\u2019une classe de probl\u00e8mes de dirichlet non lin\u00e9aires. ESAIM: Math Modell Numer Anal-Mod\u00e9l Math Anal Num\u00e9r 9(R2):41\u201376","journal-title":"ESAIM: Math Modell Numer Anal-Mod\u00e9l Math Anal Num\u00e9r"},{"issue":"1","key":"3319_CR12","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay D, Mercier B (1976) A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Comput Math Appl 2(1):17\u201340","journal-title":"Comput Math Appl"},{"issue":"5","key":"3319_CR13","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF00927673","volume":"4","author":"MR Hestenes","year":"1969","unstructured":"Hestenes MR (1969) Multiplier and gradient methods. J Optim Theory Appl 4(5):303\u2013320","journal-title":"J Optim Theory Appl"},{"key":"3319_CR14","unstructured":"Powell MJD (1969) A method for nonlinear constraints in minimization problems. Optimization:283\u2013298"},{"issue":"2","key":"3319_CR15","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1090\/S0002-9947-1956-0084194-4","volume":"82","author":"J Douglas","year":"1956","unstructured":"Douglas J, Rachford HH (1956) On the numerical solution of heat conduction problems in two and three space variables. Trans Am Math Soc 82(2):421\u2013439","journal-title":"Trans Am Math Soc"},{"issue":"1-3","key":"3319_CR16","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein J, Bertsekas DP (1992) On the douglas-rachford splitting method and the proximal point algorithm for maximal monotone operators. Math Program 55(1-3):293\u2013318","journal-title":"Math Program"},{"issue":"2","key":"3319_CR17","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1137\/110836936","volume":"50","author":"B He","year":"2012","unstructured":"He B, Yuan X (2012) On the O(1\/n) convergence rate of the douglas\u2013rachford alternating direction method. SIAM J Numer Anal 50(2):700\u2013709","journal-title":"SIAM J Numer Anal"},{"issue":"1","key":"3319_CR18","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1137\/110849468","volume":"23","author":"RenatoDC Monteiro","year":"2013","unstructured":"Monteiro Renato DC, Svaiter BF (2013) Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers. SIAM J Optim 23(1):475\u2013507","journal-title":"SIAM J Optim"},{"issue":"3","key":"3319_CR19","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/s00211-014-0673-6","volume":"130","author":"B He","year":"2015","unstructured":"He B, Yuan X (2015) On non-ergodic convergence rate of douglas\u2013rachford alternating direction method of multipliers. Numer Math 130(3):567\u2013577","journal-title":"Numer Math"},{"issue":"3","key":"3319_CR20","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1007\/s10915-015-0048-x","volume":"66","author":"W Deng","year":"2016","unstructured":"Deng W, Yin W (2016) On the global and linear convergence of the generalized alternating direction method of multipliers. J Sci Comput 66(3):889\u2013916","journal-title":"J Sci Comput"},{"issue":"04","key":"3319_CR21","doi-asserted-by":"publisher","first-page":"1550024","DOI":"10.1142\/S0217595915500244","volume":"32","author":"M Li","year":"2015","unstructured":"Li M, Sun D, Toh K-C (2015) A convergent 3-block semi-proximal admm for convex minimization problems with one strongly convex block. Asia-Pac J Oper Res 32(04):1550024","journal-title":"Asia-Pac J Oper Res"},{"issue":"1","key":"3319_CR22","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10589-016-9860-y","volume":"66","author":"X Cai","year":"2017","unstructured":"Cai X, Han D, Yuan X (2017) On the convergence of the direct extension of admm for three-block separable convex minimization models with one strongly convex function. Comput Optim Appl 66(1):39\u201373","journal-title":"Comput Optim Appl"},{"issue":"1-2","key":"3319_CR23","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10107-016-1034-2","volume":"162","author":"M Hong","year":"2017","unstructured":"Hong M, Luo Z-Q (2017) On the linear convergence of the alternating direction method of multipliers. Math Program 162(1-2):165\u2013199","journal-title":"Math Program"},{"issue":"1-2","key":"3319_CR24","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10107-014-0826-5","volume":"155","author":"C Chen","year":"2016","unstructured":"Chen C, He B, Ye Y, Yuan X (2016) The direct extension of admm for multi-block convex minimization problems is not necessarily convergent. Math Program 155(1-2):57\u201379","journal-title":"Math Program"},{"issue":"3","key":"3319_CR25","doi-asserted-by":"publisher","first-page":"769","DOI":"10.5802\/aif.1638","volume":"48","author":"K Kurdyka","year":"1998","unstructured":"Kurdyka K (1998) On gradients of functions definable in o-minimal structures. Ann l\u2019inst Four 48(3):769\u2013783","journal-title":"Ann l\u2019inst Four"},{"key":"3319_CR26","first-page":"87","volume":"117","author":"S Lojasiewicz","year":"1963","unstructured":"Lojasiewicz S (1963) Une propri\u00e9t\u00e9 topologique des sous-ensembles analytiques r\u00e9els. Les \u00e9qu d\u00e9riv\u00e9es Partielles 117:87\u201389","journal-title":"Les \u00e9qu d\u00e9riv\u00e9es Partielles"},{"issue":"4","key":"3319_CR27","doi-asserted-by":"publisher","first-page":"2434","DOI":"10.1137\/140998135","volume":"25","author":"G Li","year":"2015","unstructured":"Li G, Pong TK (2015) Global convergence of splitting methods for nonconvex composite optimization. SIAM J Optim 25(4):2434\u20132460","journal-title":"SIAM J Optim"},{"issue":"1","key":"3319_CR28","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10915-018-0757-z","volume":"78","author":"Y Wang","year":"2019","unstructured":"Wang Y, Yin W, Zeng J (2019) Global convergence of admm in nonconvex nonsmooth optimization. J Sci Comput 78(1):29\u201363","journal-title":"J Sci Comput"},{"issue":"1","key":"3319_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-020-01782-y","volume":"188","author":"Z Jia","year":"2021","unstructured":"Jia Z, Gao X, Cai X, Han D (2021) Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems. J Optim Theory Appl 188(1):1\u201325","journal-title":"J Optim Theory Appl"},{"issue":"1","key":"3319_CR30","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10589-018-0034-y","volume":"72","author":"B Jiang","year":"2019","unstructured":"Jiang B, Lin T, Ma S, Zhang S (2019) Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis. Comput Optim Appl 72(1):115\u2013157","journal-title":"Comput Optim Appl"},{"issue":"3","key":"3319_CR31","doi-asserted-by":"publisher","first-page":"2272","DOI":"10.1137\/19M1242276","volume":"30","author":"J Zhang","year":"2020","unstructured":"Zhang J, Luo Z-Q (2020) A proximal alternating direction method of multiplier for linearly constrained nonconvex minimization. SIAM J Optim 30(3):2272\u20132302","journal-title":"SIAM J Optim"},{"key":"3319_CR32","doi-asserted-by":"crossref","unstructured":"Han D-R (2022) A survey on some recent developments of alternating direction method of multipliers. J Oper Res Soc China:1\u201352","DOI":"10.1007\/s40305-021-00368-3"},{"key":"3319_CR33","unstructured":"Ouyang H, He N, Tran L, Gray A (2013) Stochastic alternating direction method of multipliers. In: International conference on machine learning, pp 80\u201388"},{"key":"3319_CR34","unstructured":"Wang H, Banerjee A (2013) Online alternating direction method (longer version). arXiv:1306.3721"},{"key":"3319_CR35","unstructured":"Zhong W, Kwok J (2014) Fast stochastic alternating direction method of multipliers. In: International conference on machine learning, pp 46\u201354"},{"key":"3319_CR36","unstructured":"Zhao SY, Li WJ, Zhou ZH (2015) Scalable stochastic alternating direction method of multipliers. arXiv:1502.03529"},{"issue":"2","key":"3319_CR37","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1007\/s10957-018-1270-0","volume":"179","author":"C Chen","year":"2018","unstructured":"Chen C, Chen Y, Ouyang Y, Pasiliao E (2018) Stochastic accelerated alternating direction method of multipliers with importance sampling. J Optim Theory Appl 179(2):676\u2013695","journal-title":"J Optim Theory Appl"},{"key":"3319_CR38","doi-asserted-by":"crossref","unstructured":"Huang F, Chen S, Huang H (2019) Faster stochastic alternating direction method of multipliers for nonconvex optimization. In: International conference on machine learning, pp 2839\u20132848","DOI":"10.24963\/ijcai.2019\/354"},{"key":"3319_CR39","doi-asserted-by":"crossref","unstructured":"Liu Y, Shang F, Cheng J (2017) Accelerated variance reduced stochastic admm. In: Proceedings of the AAAI conference on artificial intelligence, vol 31","DOI":"10.1609\/aaai.v31i1.10843"},{"key":"3319_CR40","unstructured":"Xu Y, Liu M, Yang T, Lin Q (2017) No more fixed penalty parameter in admm: Faster convergence with new adaptive penalization. In: Advances in neural information processing systems, pp 1267\u20131277"},{"key":"3319_CR41","unstructured":"Zhao P, Yang J, Zhang T, Li P (2015) Adaptive stochastic alternating direction method of multipliers. In: International conference on machine learning, pp 69\u201377"},{"issue":"1","key":"3319_CR42","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10915-017-0621-6","volume":"76","author":"X Gao","year":"2018","unstructured":"Gao X, Jiang B, Zhang S (2018) On the information-adaptive variants of the admm: an iteration complexity perspective. J Sci Comput 76(1):327\u2013363","journal-title":"J Sci Comput"},{"issue":"6","key":"3319_CR43","doi-asserted-by":"publisher","first-page":"2355","DOI":"10.1109\/TAC.2019.2953209","volume":"65","author":"Y Xie","year":"2019","unstructured":"Xie Y, Shanbhag UV (2019) Si-admm: A stochastic inexact admm framework for stochastic convex programs. IEEE Trans Automat Control 65(6):2355\u20132370","journal-title":"IEEE Trans Automat Control"},{"key":"3319_CR44","unstructured":"Roux NL, Schmidt M, Bach FR (2012) A stochastic gradient method with an exponential convergence rate for finite training sets. In: Advances in neural information processing systems, pp 2663\u20132671"},{"key":"3319_CR45","first-page":"567","volume":"14","author":"S Shalev-Shwartz","year":"2013","unstructured":"Shalev-Shwartz S, Zhang T (2013) Stochastic dual coordinate ascent methods for regularized loss minimization. J Mach Learn Res 14:567\u2013599","journal-title":"J Mach Learn Res"},{"key":"3319_CR46","unstructured":"Nesterov Y (1983) A method of solving a convex programming problem with convergence rate o(1\/k2). In: Sov. Math. Doklady, vol 27, pp 372\u2013376"},{"key":"3319_CR47","volume-title":"Introductory lectures on convex optimization: A basic course, vol 87","author":"Y Nesterov","year":"2013","unstructured":"Nesterov Y (2013) Introductory lectures on convex optimization: A basic course, vol 87. Springer Science & Business Media, Berlin"},{"key":"3319_CR48","unstructured":"Zhou X, Yuan H, Li CJ, Sun Q (2020) Stochastic modified equations for continuous limit of stochastic admm. arXiv:2003.03532"},{"key":"3319_CR49","first-page":"485","volume":"9","author":"O Banerjee","year":"2008","unstructured":"Banerjee O, El Ghaoui L, d\u2019Aspremont A (2008) Model selection through sparse maximum likelihood estimation for multivariate gaussian or binary data. J Mach Learn Res 9:485\u2013 516","journal-title":"J Mach Learn Res"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03319-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-03319-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03319-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T09:31:42Z","timestamp":1664616702000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-03319-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,4]]},"references-count":49,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["3319"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-03319-4","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,4]]},"assertion":[{"value":"28 January 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}