{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,18]],"date-time":"2026-09-18T09:28:54Z","timestamp":1789723734390,"version":"4.0.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,11,28]],"date-time":"2017-11-28T00:00:00Z","timestamp":1511827200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,11,28]],"date-time":"2017-11-28T00:00:00Z","timestamp":1511827200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1462408"],"award-info":[{"award-number":["CMMI-1462408"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1719549"],"award-info":[{"award-number":["DMS-1719549"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s10589-017-9972-z","type":"journal-article","created":{"date-parts":[[2017,11,27]],"date-time":"2017-11-27T21:47:43Z","timestamp":1511819263000},"page":"91-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Accelerated primal\u2013dual proximal block coordinate updating methods for constrained convex optimization"],"prefix":"10.1007","volume":"70","author":[{"given":"Yangyang","family":"Xu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuzhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,11,28]]},"reference":[{"issue":"1","key":"9972_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"4","key":"9972_CR2","doi-asserted-by":"publisher","first-page":"2183","DOI":"10.1137\/120878951","volume":"23","author":"D Boley","year":"2013","unstructured":"Boley, D.: Local linear convergence of the alternating direction method of multipliers on quadratic or linear programs. SIAM J. Optim. 23(4), 2183\u20132207 (2013)","journal-title":"SIAM J. Optim."},{"key":"9972_CR3","doi-asserted-by":"crossref","unstructured":"Bredies, K., Sun, H.: Accelerated douglas-rachford methods for the solution of convex-concave saddle-point problems. arXiv preprint arXiv:1604.06282 (2016)","DOI":"10.1137\/140965028"},{"key":"9972_CR4","unstructured":"Cai, X., Han, D., Yuan, X.: The direct extension of admm for three-block separable convex minimization models is convergent when one function is strongly convex. Optim. Online (2014)"},{"issue":"1","key":"9972_CR5","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40(1), 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vis."},{"issue":"1\u20132","key":"9972_CR6","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.: The direct extension of admm for multi-block convex minimization problems is not necessarily convergent. Math. Program. 155(1\u20132), 57\u201379 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"9972_CR7","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/S003614450037906X","volume":"43","author":"SS Chen","year":"2001","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM Rev. 43(1), 129\u2013159 (2001)","journal-title":"SIAM Rev."},{"issue":"4","key":"9972_CR8","doi-asserted-by":"publisher","first-page":"1779","DOI":"10.1137\/130919362","volume":"24","author":"Y Chen","year":"2014","unstructured":"Chen, Y., Lan, G., Ouyang, Y.: Optimal primal-dual methods for a class of saddle point problems. SIAM J. Optim. 24(4), 1779\u20131814 (2014)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9972_CR9","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1137\/140971233","volume":"25","author":"PL Combettes","year":"2015","unstructured":"Combettes, P.L., Pesquet, J.-C.: Stochastic quasi-fej\u00e9r block-coordinate fixed point iterations with random sweeping. SIAM J. Optim. 25(2), 1221\u20131248 (2015)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9972_CR10","first-page":"273","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes, C., Vapnik, V.: Support-vector networks. Mach. Learn. 20(3), 273\u2013297 (1995)","journal-title":"Mach. Learn."},{"key":"9972_CR11","unstructured":"Dang, C., Lan, G.: Randomized methods for saddle point computation. arXiv preprint arXiv:1409.8625 (2014)"},{"key":"9972_CR12","unstructured":"Deng, W., Lai, M.-J., Peng, Z., Yin, W.: Parallel multi-block admm with $$o (1\/k)$$ convergence. J. Sci. Comput. 71(2), 712\u2013736 (2017)"},{"issue":"3","key":"9972_CR13","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1007\/s10915-015-0048-x","volume":"66","author":"W Deng","year":"2015","unstructured":"Deng, W., Yin, W.: On the global and linear convergence of the generalized alternating direction method of multipliers. J. Sci. Comput. 66(3), 889\u2013916 (2015)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"9972_CR14","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.: A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Comput. Math. Appl. 2(1), 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"key":"9972_CR15","unstructured":"Gao, X., Xu, Y., Zhang, S.: Randomized primal-dual proximal block coordinate updates. arXiv preprint arXiv:1605.05969 (2016)"},{"key":"9972_CR16","unstructured":"Gao, X., Zhang, S.-Z.: First-order algorithms for convex optimization with nonseparable objective and coupled onstraints. J. Oper. Res. Soc. China 5(2), 131\u2013159 (2017)"},{"issue":"R2","key":"9972_CR17","first-page":"41","volume":"9","author":"R Glowinski","year":"1975","unstructured":"Glowinski, R., Marrocco, A.: Sur l\u2019approximation, par el\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. 9(R2), 41\u201376 (1975)","journal-title":"ESAIM. Math. Modell. Numer. Anal."},{"issue":"3","key":"9972_CR18","doi-asserted-by":"publisher","first-page":"1588","DOI":"10.1137\/120896219","volume":"7","author":"T Goldstein","year":"2014","unstructured":"Goldstein, T., O\u2019Donoghue, B., Setzer, S., Baraniuk, R.: Fast alternating direction optimization methods. SIAM J. Imaging Sci. 7(3), 1588\u20131623 (2014)","journal-title":"SIAM J. Imaging Sci."},{"issue":"4","key":"9972_CR19","doi-asserted-by":"publisher","first-page":"2274","DOI":"10.1137\/130922793","volume":"25","author":"B He","year":"2015","unstructured":"He, B., Hou, L., Yuan, X.: On full Jacobian decomposition of the augmented Lagrangian method for separable convex programming. SIAM J. Optim. 25(4), 2274\u20132312 (2015)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9972_CR20","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1137\/110822347","volume":"22","author":"B He","year":"2012","unstructured":"He, B., Tao, M., Yuan, X.: Alternating direction method with gaussian back substitution for separable convex programming. SIAM J. Optim. 22(2), 313\u2013340 (2012)","journal-title":"SIAM J. Optim."},{"key":"9972_CR21","unstructured":"He, B., Yuan, X.: On the acceleration of augmented lagrangian method for linearly constrained optimization. Optim. Online (2010)"},{"issue":"2","key":"9972_CR22","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1137\/110836936","volume":"50","author":"B He","year":"2012","unstructured":"He, B., Yuan, X.: On the $$O(1\/n)$$ convergence rate of the Douglas-Rachford alternating direction method. SIAM J. Numer. Anal. 50(2), 700\u2013709 (2012)","journal-title":"SIAM J. Numer. Anal."},{"key":"9972_CR23","unstructured":"James, G.\u00a0M., Paulson, C., Rusmevichientong, P.: Penalized and constrained regression. Technical report (2013)"},{"key":"9972_CR24","unstructured":"Li, H., Lin, Z.: Optimal nonergodic $$ o (1\/k) $$ convergence rate: when linearized adm meets nesterov\u2019s extrapolation. arXiv preprint arXiv:1608.06366 (2016)"},{"issue":"04","key":"9972_CR25","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.: A convergent 3-block semi-proximal ADMM for convex minimization problems with one strongly convex block. Asia-Pac. J. Oper. Res. 32(04), 1550024 (2015)","journal-title":"Asia-Pac. J. Oper. Res."},{"issue":"3","key":"9972_CR26","doi-asserted-by":"publisher","first-page":"1478","DOI":"10.1137\/140971178","volume":"25","author":"T Lin","year":"2015","unstructured":"Lin, T., Ma, S., Zhang, S.: On the global linear convergence of the admm with multiblock variables. SIAM J. Optim. 25(3), 1478\u20131497 (2015)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"9972_CR27","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s10107-014-0800-2","volume":"152","author":"Z Lu","year":"2015","unstructured":"Lu, Z., Xiao, L.: On the complexity analysis of randomized block-coordinate descent methods. Math. Program. 152(1\u20132), 615\u2013642 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"9972_CR28","first-page":"77","volume":"7","author":"H Markowitz","year":"1952","unstructured":"Markowitz, H.: Portfolio selection. J. Finance 7(1), 77\u201391 (1952)","journal-title":"J. Finance"},{"issue":"1","key":"9972_CR29","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1137\/110849468","volume":"23","author":"RD Monteiro","year":"2013","unstructured":"Monteiro, R.D., Svaiter, B.F.: Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers. SIAM J. Optim. 23(1), 475\u2013507 (2013)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9972_CR30","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate $${O}(1\/k^2)$$. Soviet Math. Doklady 27(2), 372\u2013376 (1983)","journal-title":"Soviet Math. Doklady"},{"issue":"2","key":"9972_CR31","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/100802001","volume":"22","author":"Y Nesterov","year":"2012","unstructured":"Nesterov, Y.: Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J. Optim. 22(2), 341\u2013362 (2012)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9972_CR32","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"issue":"1","key":"9972_CR33","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1137\/14095697X","volume":"8","author":"Y Ouyang","year":"2015","unstructured":"Ouyang, Y., Chen, Y., Lan, G., Pasiliao Jr., E.: An accelerated linearized alternating direction method of multipliers. SIAM J. Imaging Sci. 8(1), 644\u2013681 (2015)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"9972_CR34","doi-asserted-by":"crossref","first-page":"57","DOI":"10.4310\/AMSA.2016.v1.n1.a2","volume":"1","author":"Z Peng","year":"2016","unstructured":"Peng, Z., Wu, T., Xu, Y., Yan, M., Yin, W.: Coordinate friendly structures, algorithms and applications. Ann. Math. Sci. Appl. 1(1), 57\u2013119 (2016)","journal-title":"Ann. Math. Sci. Appl."},{"issue":"5","key":"9972_CR35","doi-asserted-by":"publisher","first-page":"A2851","DOI":"10.1137\/15M1024950","volume":"38","author":"Z Peng","year":"2016","unstructured":"Peng, Z., Xu, Y., Yan, M., Yin, W.: Arock: an algorithmic framework for asynchronous parallel coordinate updates. SIAM J. Sci. Comput. 38(5), A2851\u2013A2879 (2016)","journal-title":"SIAM J. Sci. Comput."},{"key":"9972_CR36","unstructured":"Pesquet, J.-C.,\u00a0Repetti, A.: A class of randomized primal-dual algorithms for distributed optimization. arXiv preprint arXiv:1406.6404 (2014)"},{"key":"9972_CR37","doi-asserted-by":"crossref","unstructured":"Richt\u00e1rik, P., Tak\u00e1\u010d, M.: Parallel coordinate descent methods for big data optimization. Math. Program. 156(1\u20132), 433\u2013484 (2016)","DOI":"10.1007\/s10107-015-0901-6"},{"issue":"1\u20132","key":"9972_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-012-0614-z","volume":"144","author":"P Richt\u00e1rik","year":"2014","unstructured":"Richt\u00e1rik, P., Tak\u00e1\u010d, M.: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Math. Program. 144(1\u20132), 1\u201338 (2014)","journal-title":"Math. Program."},{"key":"9972_CR39","unstructured":"Xu, Y.: Hybrid jacobian and gauss-seidel proximal block coordinate update methods for linearly constrained convex programming. arXiv preprint arXiv:1608.03928 (2016)"},{"issue":"3","key":"9972_CR40","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1137\/16M1082305","volume":"27","author":"Y Xu","year":"2017","unstructured":"Xu, Y.: Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming. SIAM J. Optim. 27(3), 1459\u20131484 (2017)","journal-title":"SIAM J. Optim."},{"key":"9972_CR41","unstructured":"Xu, Y.: Asynchronous parallel primal-dual block update methods. arXiv preprint arXiv:1705.06391 (2017)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-017-9972-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9972-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9972-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,9]],"date-time":"2022-08-09T00:01:50Z","timestamp":1660003310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-017-9972-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,28]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["9972"],"URL":"https:\/\/doi.org\/10.1007\/s10589-017-9972-z","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,28]]},"assertion":[{"value":"7 April 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2017","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}