{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T10:22:32Z","timestamp":1760523752178,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,2,7]],"date-time":"2019-02-07T00:00:00Z","timestamp":1549497600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,2,7]],"date-time":"2019-02-07T00:00:00Z","timestamp":1549497600000},"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":["1522629","1522654"],"award-info":[{"award-number":["1522629","1522654"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-15-1-2048"],"award-info":[{"award-number":["N00014-15-1-2048"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1819002","1819161"],"award-info":[{"award-number":["1819002","1819161"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006146","name":"Office of Naval Reactors","doi-asserted-by":"publisher","award":["N00014-18-1-2100"],"award-info":[{"award-number":["N00014-18-1-2100"]}],"id":[{"id":"10.13039\/100006146","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":[[2019,5]]},"DOI":"10.1007\/s10589-019-00072-2","type":"journal-article","created":{"date-parts":[[2019,2,7]],"date-time":"2019-02-07T12:01:33Z","timestamp":1549540893000},"page":"201-235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Inexact alternating direction methods of multipliers for separable convex optimization"],"prefix":"10.1007","volume":"73","author":[{"given":"William W.","family":"Hager","sequence":"first","affiliation":[]},{"given":"Hongchao","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,7]]},"reference":[{"key":"72_CR1","doi-asserted-by":"publisher","first-page":"2345","DOI":"10.1109\/TIP.2010.2047910","volume":"19","author":"M Afonso","year":"2010","unstructured":"Afonso, M., Bioucas-Dias, J., Figueiredo, M.: Fast image recovery using variable splitting and constrained optimization. IEEE Trans. Image Process. 19, 2345\u20132356 (2010)","journal-title":"IEEE Trans. Image Process."},{"key":"72_CR2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two point step size gradient methods. IMA J. Numer. Anal. 8, 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"72_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2010","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Mach. Learn. 3, 1\u2013122 (2010)","journal-title":"Mach. Learn."},{"key":"72_CR4","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.: 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, 39\u201373 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"72_CR5","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, 57\u201379 (2016)","journal-title":"Math. Program."},{"key":"72_CR6","unstructured":"Chen, C., Li, M., Liu, X., Ye, Y.: On the convergence of multi-block alternating direction method of multipliers and block coordinate descent method (2015). \n                    arXiv:1508.00193"},{"key":"72_CR7","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/183961","author":"C Chen","year":"2013","unstructured":"Chen, C., Shen, Y., You, Y.: On the convergence analysis of the alternating direction method of multipliers with three blocks. Abstr. Appl. Anal. (2013). \n                    https:\/\/doi.org\/10.1155\/2013\/183961","journal-title":"Abstr. Appl. Anal."},{"key":"72_CR8","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF01582566","volume":"64","author":"G Chen","year":"1994","unstructured":"Chen, G., Teboulle, M.: A proximal-based decomposition method for convex minimization problems. Math. Program. 64, 81\u2013101 (1994)","journal-title":"Math. Program."},{"key":"72_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10107-016-1007-5","volume":"161","author":"L Chen","year":"2017","unstructured":"Chen, L., Sun, D., Toh, K.: An efficient inexact symmetric Gauss\u2013Seidel based majorized ADMM for high-dimensional convex composite conic programming. Math. Program. 161, 237\u2013270 (2017)","journal-title":"Math. Program."},{"key":"72_CR10","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10589-012-9519-2","volume":"54","author":"Y Chen","year":"2013","unstructured":"Chen, Y., Hager, W.W., Yashtini, M., Ye, X., Zhang, H.: Bregman operator splitting with variable stepsize for total variation image reconstruction. Comput. Optim. Appl. 54, 317\u2013342 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"72_CR11","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1007\/s11228-017-0421-z","volume":"25","author":"D Davis","year":"2017","unstructured":"Davis, D., Yin, W.: A three-operator splitting scheme and its optimization applications. Set Valued Var. Anal. 25, 829\u2013858 (2017)","journal-title":"Set Valued Var. Anal."},{"key":"72_CR12","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.: On the Douglas\u2013Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55, 293\u2013318 (1992)","journal-title":"Math. Program."},{"key":"72_CR13","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10107-012-0528-9","volume":"141","author":"J Eckstein","year":"2013","unstructured":"Eckstein, J., Silva, P.J.S.: A practical relative error criterion for augmented Lagrangians. Math. Program. 141, 319\u2013348 (2013)","journal-title":"Math. Program."},{"key":"72_CR14","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10589-017-9911-z","volume":"68","author":"J Eckstein","year":"2017","unstructured":"Eckstein, J., Yao, W.: Approximate ADMM algorithms derived from Lagrangian splitting. Comput. Optim. Appl. 68, 363\u2013405 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"72_CR15","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10107-017-1160-5","volume":"170","author":"J Eckstein","year":"2018","unstructured":"Eckstein, J., Yao, W.: Relative-error approximate versions of Douglas\u2013Rachford splitting and special cases of the ADMM. Math. Program. 170, 417\u2013444 (2018)","journal-title":"Math. Program."},{"key":"72_CR16","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 approximations. Comput. Math. Appl. 2, 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"key":"72_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12613-4","volume-title":"Numerical Methods for Nonlinear Variational Problems","author":"R Glowinski","year":"1984","unstructured":"Glowinski, R.: Numerical Methods for Nonlinear Variational Problems. Springer, New York (1984)"},{"key":"72_CR18","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1137\/090780705","volume":"22","author":"D Goldfarb","year":"2012","unstructured":"Goldfarb, D., Ma, S.: Fast multiple-splitting algorithms for convex optimization. SIAM J. Optim. 22, 533\u2013556 (2012)","journal-title":"SIAM J. Optim."},{"key":"72_CR19","first-page":"86","volume-title":"Mathematical Programming Studies","author":"E Golshtein","year":"1979","unstructured":"Golshtein, E., Tretyakov, N.: Modified Lagrangians in convex programming and their generalizations, in point-to-set maps and mathematical programming. In: Huard, P. (ed.) Mathematical Programming Studies, vol. 10, pp. 86\u201397. Springer, Berlin (1979)"},{"key":"72_CR20","doi-asserted-by":"publisher","first-page":"1535","DOI":"10.1137\/15100401X","volume":"54","author":"WW Hager","year":"2016","unstructured":"Hager, W.W., Yashtini, M., Zhang, H.: An O(1\/k) convergence rate for the variable stepsize Bregman operator splitting algorithm. SIAM J. Numer. Anal. 54, 1535\u20131556 (2016)","journal-title":"SIAM J. Numer. Anal."},{"key":"72_CR21","doi-asserted-by":"publisher","first-page":"1773","DOI":"10.1137\/15M102825X","volume":"29","author":"WW Hager","year":"2016","unstructured":"Hager, W.W., Zhang, H.: Projection onto a polyhedron that exploits sparsity. SIAM J. Optim. 29, 1773\u20131798 (2016)","journal-title":"SIAM J. Optim."},{"key":"72_CR22","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s10957-012-0003-z","volume":"155","author":"D Han","year":"2012","unstructured":"Han, D., Yuan, X.: A note on the alternating direction method of multipliers. J. Optim. Theory Appl. 155, 227\u2013238 (2012)","journal-title":"J. Optim. Theory Appl."},{"key":"72_CR23","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s101070100280","volume":"92","author":"B He","year":"2002","unstructured":"He, B., Liao, L., Han, D., Yan, H.: A new inexact alternating directions method for monotone variational inequalities. Math. Program. 92, 103\u2013118 (2002)","journal-title":"Math. Program."},{"key":"72_CR24","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1080\/02331934.2011.611885","volume":"62","author":"B He","year":"2013","unstructured":"He, B., Tao, M., Xu, M., Yuan, X.: An alternating direction-based contraction method for linearly constrained separable convex programming problems. Optimization 62, 573\u2013596 (2013)","journal-title":"Optimization"},{"key":"72_CR25","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, 313\u2013340 (2012)","journal-title":"SIAM J. Optim."},{"key":"72_CR26","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 $${\\cal{O}}(1\/n)$$ convergence rate of the Douglas\u2013Rachford alternating direction method. SIAM J. Numer. Anal. 50, 700\u2013709 (2012)","journal-title":"SIAM J. Numer. Anal."},{"key":"72_CR27","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.: On the linear convergence of the alternating direction method of multipliers. Math. Program. 162, 165\u2013199 (2017)","journal-title":"Math. Program."},{"key":"72_CR28","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/s10589-016-9826-0","volume":"64","author":"J Li","year":"2016","unstructured":"Li, J., Chen, G., Dong, Z., Wu, Z.: A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints. Comput. Optim. Appl. 64, 671\u2013697 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"72_CR29","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/s10957-013-0334-4","volume":"159","author":"M Li","year":"2013","unstructured":"Li, M., Liao, L., Yuan, X.: Inexact alternating direction methods of multipliers with logarithmic\u2013quadratic proximal regularization. J. Optim. Theory Appl. 159, 412\u2013436 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"72_CR30","first-page":"1","volume":"32","author":"M Li","year":"2015","unstructured":"Li, M., Sun, D., Toh, K.C.: A convergent 3-block semi-proximal ADMM for for convex minimization problems with one strongly convex block. Asia Pac. J. Oper. Res. 32, 1\u201319 (2015)","journal-title":"Asia Pac. J. Oper. Res."},{"key":"72_CR31","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, 1478\u20131497 (2015)","journal-title":"SIAM J. Optim."},{"key":"72_CR32","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"72_CR33","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1287\/moor.25.2.214.12222","volume":"25","author":"MV Solodov","year":"2000","unstructured":"Solodov, M.V., Svaiter, B.F.: An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions. Math. Oper. Res. 25, 214\u2013230 (2000)","journal-title":"Math. Oper. Res."},{"key":"72_CR34","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/100781894","volume":"21","author":"M Tao","year":"2011","unstructured":"Tao, M., Yuan, X.M.: Recovering low-rank and sparse components of matrices from incomplete and noisy observations. SIAM J. Optim. 21, 57\u201381 (2011)","journal-title":"SIAM J. Optim."},{"key":"72_CR35","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s12532-010-0017-1","volume":"2","author":"Z Wen","year":"2010","unstructured":"Wen, Z., Goldfarb, D., Yin, W.: Alternating direction augmented Lagrangian methods for semidefinite programming. Math. Program. Comput. 2, 203\u2013230 (2010)","journal-title":"Math. Program. Comput."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00072-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00072-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00072-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T11:02:32Z","timestamp":1589713352000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00072-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,7]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["72"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00072-2","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2019,2,7]]},"assertion":[{"value":"21 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}