{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T14:10:30Z","timestamp":1785420630470,"version":"3.56.0"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,7,6]],"date-time":"2016-07-06T00:00:00Z","timestamp":1467763200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s10107-016-1034-2","type":"journal-article","created":{"date-parts":[[2016,7,6]],"date-time":"2016-07-06T02:45:43Z","timestamp":1467773143000},"page":"165-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":342,"title":["On the linear convergence of the alternating direction method of multipliers"],"prefix":"10.1007","volume":"162","author":[{"given":"Mingyi","family":"Hong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhi-Quan","family":"Luo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,7,6]]},"reference":[{"key":"1034_CR1","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont (1999)"},{"key":"1034_CR2","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BFb0120965","volume":"17","author":"DP Bertsekas","year":"1982","unstructured":"Bertsekas, D.P., Gafni, E.: Projection methods for variational inequalities with application to the traffic assignment problem. Math. Prog. Study 17, 139\u2013159 (1982)","journal-title":"Math. Prog. Study"},{"key":"1034_CR3","doi-asserted-by":"crossref","first-page":"1219","DOI":"10.1137\/0325067","volume":"25","author":"DP Bertsekas","year":"1987","unstructured":"Bertsekas, D.P., Hosein, P.A., Tseng, P.: Relaxation methods for network flow problems with convex arc costs. SIAM J. Control Optim. 25, 1219\u20131243 (1987)","journal-title":"SIAM J. Control Optim."},{"key":"1034_CR4","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"DP Bertsekas","year":"1989","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"1034_CR5","doi-asserted-by":"crossref","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)","DOI":"10.1137\/120878951"},{"key":"1034_CR6","doi-asserted-by":"crossref","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.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3, 1\u2013122 (2011). (Michael Jordan, Editor in Chief)","journal-title":"Found. Trends Mach. Learn."},{"key":"1034_CR7","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"LM Bregman","year":"1967","unstructured":"Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 7, 200\u2013217 (1967)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"1034_CR8","unstructured":"Chen, C., He, B. , Yuan, X., Ye, Y.: The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent. Math. Prog. 155(1), 57\u201379 (2013)"},{"key":"1034_CR9","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/nav.3800330106","volume":"33","author":"RW Cottle","year":"1986","unstructured":"Cottle, R.W., Duvall, S.G., Zikan, K.: A Lagrangian relaxation algorithm for the constrained matrix problem. Nav. Res. Logist. Q. 33, 55\u201376 (1986)","journal-title":"Nav. Res. Logist. Q."},{"key":"1034_CR10","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF01580851","volume":"47","author":"AR Pierro De","year":"1990","unstructured":"De Pierro, A.R., Iusem, A.N.: On the convergence properties of Hildreth\u2019s quadratic programming algorithm. Math. Prog. 47, 37\u201351 (1990)","journal-title":"Math. Prog."},{"key":"1034_CR11","doi-asserted-by":"crossref","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 (2012)","DOI":"10.1007\/s10915-015-0048-x"},{"key":"1034_CR12","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1090\/S0002-9947-1956-0084194-4","volume":"82","author":"J Douglas","year":"1956","unstructured":"Douglas, J., Rachford, H.H.: On the numerical solution of the heat conduction problem in 2 and 3 space variables. Trans. Am. Math. Soc. 82, 421\u2013439 (1956)","journal-title":"Trans. Am. Math. Soc."},{"key":"1034_CR13","unstructured":"Eckstein, J.: Splitting Methods for Monotone Operators with Applications to Parallel Optimization. Ph.D. Thesis, Operations Research Center, MIT (1989)"},{"key":"1034_CR14","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.P.: 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":"1034_CR15","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1137\/070698816","volume":"48","author":"J Eckstein","year":"2010","unstructured":"Eckstein, J., Svaiter, B.F.: General projective splitting methods for sums of maximal monotone operators. SIAM J. Control Optim. 48, 787\u2013811 (2010)","journal-title":"SIAM J. Control Optim."},{"key":"1034_CR16","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0168-2024(08)70034-1","volume-title":"Augmented Lagrangian Methods: Application to the Numerical Solution of Boundary-Value Problem","author":"D Gabay","year":"1983","unstructured":"Gabay, D.: Application of the method of multipliers to varuational inequalities. In: Fortin, M., Glowinski, R. (eds.) Augmented Lagrangian Methods: Application to the Numerical Solution of Boundary-Value Problem, pp. 299\u2013331. North-Holland, Amsterdam (1983)"},{"key":"1034_CR17","doi-asserted-by":"crossref","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":"1034_CR18","doi-asserted-by":"crossref","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":"1034_CR19","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970838","volume-title":"Augmented Lagrangian and Operator Splitting Methods in Nonlinear Mechanics","author":"R Glowinski","year":"1989","unstructured":"Glowinski, R., Le Tallec, P.: Augmented Lagrangian and Operator Splitting Methods in Nonlinear Mechanics. SIAM Studies in Applied Mathematics, Philadelphia (1989)"},{"key":"1034_CR20","doi-asserted-by":"crossref","unstructured":"Goldfarb, D., Ma, S.: Fast multiple splitting algorithms for convex optimization. SIAM J. Optim. 22(2), 533\u2013556 (2012)","DOI":"10.1137\/090780705"},{"key":"1034_CR21","doi-asserted-by":"crossref","unstructured":"Goldfarb, D., Ma, S., Scheinberg, K.: Fast alternating linearization methods for minimizing the sum of two convex functions. Math. Prog. A. 141(1,2), 349\u2013382 (2013)","DOI":"10.1007\/s10107-012-0530-2"},{"key":"1034_CR22","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1090\/S0002-9904-1964-11178-2","volume":"70","author":"AA Goldstein","year":"1964","unstructured":"Goldstein, A.A.: Convex programming in hilbert space. Bull. Am. Math. Soc. 70, 709\u2013710 (1964)","journal-title":"Bull. Am. Math. Soc."},{"key":"1034_CR23","doi-asserted-by":"crossref","unstructured":"Goldstein, T., O\u2019Donoghue, B., Setzer, S.: Fast alternating direction optimization methods. SIAM J. Imaging Sci, 7(3), 1588\u20131623 (2014)","DOI":"10.1137\/120896219"},{"key":"1034_CR24","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1137\/110822347","volume":"22","author":"BS He","year":"2012","unstructured":"He, B.S., Tao, M., Yuan, X.M.: Alternating direction method with gaussian back substitution for separable convex programming. SIAM J. Optim. 22, 313\u2013340 (2012)","journal-title":"SIAM J. Optim."},{"key":"1034_CR25","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1137\/110836936","volume":"50","author":"BS He","year":"2012","unstructured":"He, B.S., Yuan, X.M.: On the $$O(1\/n)$$ 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":"1034_CR26","doi-asserted-by":"crossref","first-page":"263","DOI":"10.6028\/jres.049.027","volume":"49","author":"AJ Hoffman","year":"1952","unstructured":"Hoffman, A.J.: On approximate solutions of systems of linear inequalities. J. Res. Nat. Bur. Stand. 49, 263\u2013265 (1952)","journal-title":"J. Res. Nat. Bur. Stand."},{"key":"1034_CR27","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/0801025","volume":"1","author":"AN Iusem","year":"1991","unstructured":"Iusem, A.N.: On dual convergence and the rate of primal convergence of bregman\u2019s convex programming method. SIAM J. Control Optim. 1, 401\u2013423 (1991)","journal-title":"SIAM J. Control Optim."},{"key":"1034_CR28","first-page":"29","volume":"83","author":"S Kontogiorgis","year":"1998","unstructured":"Kontogiorgis, S., Meyer, R.R.: A variable-penalty alternating directions method for convex optimization. Math. Program. 83, 29\u201353 (1998)","journal-title":"Math. Program."},{"key":"1034_CR29","unstructured":"Levitin, E.S., Poljak, B.T.: Constrained minimization methods. Z. Vycisl. Mat. i Mat. Fiz. 6, 787\u2013823 (1965). English translation in USSR Comput. Math. Phys. 6, 1\u201350 (1965)"},{"key":"1034_CR30","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"PL Lions","year":"1979","unstructured":"Lions, P.L., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16, 964\u2013979 (1979)","journal-title":"SIAM J. Numer. Anal."},{"key":"1034_CR31","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1137\/0325023","volume":"18","author":"YY Lin","year":"1987","unstructured":"Lin, Y.Y., Pang, J.-S.: Iterative methods for large convex quadratic programs: a survey. SIAM J. Control Optim. 18, 383\u2013411 (1987)","journal-title":"SIAM J. Control Optim."},{"key":"1034_CR32","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00939948","volume":"72","author":"Z-Q Luo","year":"1992","unstructured":"Luo, Z.-Q., Tseng, P.: On the convergence of the coordinate descent method for convex differentiable minimization. J. Optim. Theory Appl. 72, 7\u201335 (1992)","journal-title":"J. Optim. Theory Appl."},{"key":"1034_CR33","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1137\/0330025","volume":"30","author":"Z-Q Luo","year":"1992","unstructured":"Luo, Z.-Q., Tseng, P.: On the Linear convergence of descent methods for convex essentially smooth minimization. SIAM J. Control Optim. 30, 408\u2013425 (1992)","journal-title":"SIAM J. Control Optim."},{"key":"1034_CR34","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1287\/moor.18.4.846","volume":"18","author":"Z-Q Luo","year":"1993","unstructured":"Luo, Z.-Q., Tseng, P.: On the convergence rate of dual ascent methods for strictly convex minimization. Math. Oper. Res. 18, 846\u2013867 (1993)","journal-title":"Math. Oper. Res."},{"key":"1034_CR35","doi-asserted-by":"publisher","unstructured":"Ma, S.: Alternating proximal gradient method for convex minimization. J. Sci. Comput. (2015). doi: 10.1007\/s10915-015-0150-0","DOI":"10.1007\/s10915-015-0150-0"},{"key":"1034_CR36","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1137\/0325033","volume":"25","author":"OL Mangasarian","year":"1987","unstructured":"Mangasarian, O.L., Shiau, T.-H.: Lipschitz continuity of solutions of linear inequalities, programs and complementarity problems. SIAM J. Control Optim. 25, 583\u2013595 (1987)","journal-title":"SIAM J. Control Optim."},{"key":"1034_CR37","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1137\/110849468","volume":"23","author":"R Monteiro","year":"2013","unstructured":"Monteiro, R., Svaiter, B.: Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers. SIAM J. Optim. 23, 475\u2013507 (2013)","journal-title":"SIAM J. Optim."},{"key":"1034_CR38","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1002\/net.3230140404","volume":"14","author":"A Ohuchi","year":"1984","unstructured":"Ohuchi, A., Kaji, I.: Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs. Networks 14, 515\u2013530 (1984)","journal-title":"Networks"},{"key":"1034_CR39","volume-title":"Iterative Solution of Nonlinear Equations in Several Variables","author":"JM Ortega","year":"1970","unstructured":"Ortega, J.M., Rheinboldt, W.C.: Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York (1970)"},{"key":"1034_CR40","volume-title":"On the Convergence of Dual Ascent Methods for Large Scale Linearly Constrained Optimization Problems","author":"J-S Pang","year":"1984","unstructured":"Pang, J.-S.: On the Convergence of Dual Ascent Methods for Large Scale Linearly Constrained Optimization Problems. The University of Texas, School of Management, Dallas (1984)"},{"key":"1034_CR41","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1287\/moor.12.3.474","volume":"12","author":"J-S Pang","year":"1987","unstructured":"Pang, J.-S.: A posteriori error bounds for the linearly-constrained variational inequality problem. Math. Oper. Res. 12, 474\u2013484 (1987)","journal-title":"Math. Oper. Res."},{"key":"1034_CR42","doi-asserted-by":"crossref","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":"1034_CR43","doi-asserted-by":"crossref","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":"1034_CR44","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0328011","volume":"28","author":"P Tseng","year":"1990","unstructured":"Tseng, P.: Dual ascent methods for problems with strictly convex costs and linear constraints: a unified approach. SIAM J. Control Optim. 28, 214\u2013242 (1990)","journal-title":"SIAM J. Control Optim."},{"key":"1034_CR45","doi-asserted-by":"crossref","unstructured":"Tseng, P.: Approximation accuracy, gradient methods, and error bound for structured convex optimization. Math. Prog. 125(2), 263\u2013295 (2010)","DOI":"10.1007\/s10107-010-0394-2"},{"key":"1034_CR46","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF02592017","volume":"38","author":"P Tseng","year":"1987","unstructured":"Tseng, P., Bertsekas, D.P.: Relaxation methods for problems with strictly convex separable costs and linear constraints. Math. Prog. 38, 303\u2013321 (1987)","journal-title":"Math. Prog."},{"key":"1034_CR47","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1287\/moor.16.3.462","volume":"16","author":"P Tseng","year":"1991","unstructured":"Tseng, P., Bertsekas, D.P.: Relaxation methods for problems with strictly convex costs and linear constraints. Math. Oper. Res. 16, 462\u2013481 (1991)","journal-title":"Math. Oper. Res."},{"key":"1034_CR48","doi-asserted-by":"crossref","unstructured":"Ventura, J.A., Hearn, D.W.: Computational Development of a Lagrangian Dual Approach for Quadratic Networks. 21(4), 469\u2013485 (1991)","DOI":"10.1002\/net.3230210407"},{"key":"1034_CR49","doi-asserted-by":"crossref","first-page":"2792","DOI":"10.1137\/110833543","volume":"34","author":"XF Wang","year":"2012","unstructured":"Wang, X.F., Yuan, X.M.: The linearized alternating direction method of multipliers for dantzig selector. SIAM J. Sci. Comput. 34, 2792\u20132811 (2012)","journal-title":"SIAM J. Sci. Comput."},{"key":"1034_CR50","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1137\/090777761","volume":"33","author":"JF Yang","year":"2011","unstructured":"Yang, J.F., Zhang, Y.: Alternating direction algorithms for $$l_1$$ l 1 -problems in compressive sensing. SIAM J. Sci. Comput. 33, 250\u2013278 (2011)","journal-title":"SIAM J. Sci. Comput."},{"key":"1034_CR51","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M Yuan","year":"2006","unstructured":"Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. J. R. Stat. Soc. Ser. B (Statistical Methodology) 68, 49\u201367 (2006)","journal-title":"J. R. Stat. Soc. Ser. B (Statistical Methodology)"},{"key":"1034_CR52","doi-asserted-by":"crossref","unstructured":"Zhang, H., Jiang, J.J., Luo, Z.-Q.: On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems. J. Oper. Res. Soc. Chin. 1(2), 163\u2013186 (2013)","DOI":"10.1007\/s40305-013-0015-x"},{"key":"1034_CR53","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/BF02739237","volume":"5","author":"SA Zenios","year":"1986","unstructured":"Zenios, S.A., Mulvey, J.M.: Relaxation techniques for strictly convex network problems. Ann. Oper. Res. 5, 517\u2013538 (1986)","journal-title":"Ann. Oper. Res."},{"key":"1034_CR54","doi-asserted-by":"crossref","unstructured":"Zhou, Z., Li, X., Wright, J., Candes, E.J., Ma, Y.: Stable principal component pursuit. In: Proceedings of 2010 IEEE International Symposium on Information Theory (2010)","DOI":"10.1109\/ISIT.2010.5513535"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1034-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-016-1034-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1034-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1034-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T19:21:41Z","timestamp":1568143301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-016-1034-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,6]]},"references-count":54,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["1034"],"URL":"https:\/\/doi.org\/10.1007\/s10107-016-1034-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,6]]}}}