{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:25:45Z","timestamp":1740122745911,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,10,22]],"date-time":"2018-10-22T00:00:00Z","timestamp":1540166400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,10,22]],"date-time":"2018-10-22T00:00:00Z","timestamp":1540166400000},"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":["DMS-1407241"],"award-info":[{"award-number":["DMS-1407241"]}],"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":[[2019,1]]},"DOI":"10.1007\/s10589-018-0039-6","type":"journal-article","created":{"date-parts":[[2018,10,22]],"date-time":"2018-10-22T07:12:11Z","timestamp":1540192331000},"page":"179-213","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Convergence of the augmented decomposition algorithm"],"prefix":"10.1007","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0509-7967","authenticated-orcid":false,"given":"Hongsheng","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shu","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,22]]},"reference":[{"issue":"7","key":"39_CR1","first-page":"1","volume":"12","author":"J Bai","year":"2017","unstructured":"Bai, J., Zhang, H., Li, J.: A parameterized proximal point algorithm for separable convex optimization. Optim. Lett. 12(7), 1\u201320 (2017)","journal-title":"Optim. Lett."},{"issue":"1","key":"39_CR2","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/TCNS.2014.2309751","volume":"1","author":"A Beck","year":"2014","unstructured":"Beck, A., Nedic, A., Ozdaglar, A., Teboulle, M.: An $$O (1\/k) $$ gradient method for network resource allocation problems. IEEE Trans. Control Netw. Syst. 1(1), 64\u201373 (2014)","journal-title":"IEEE Trans. Control Netw. Syst."},{"key":"39_CR3","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$${\\textregistered }$$ Mach. Learn. 3(1), 1\u2013122 (2011)"},{"issue":"6","key":"39_CR4","doi-asserted-by":"publisher","first-page":"1524","DOI":"10.1109\/TAC.2014.2308612","volume":"59","author":"TH Chang","year":"2014","unstructured":"Chang, T.H., Nedic, A., Scaglione, A.: Distributed constrained optimization by consensus-based primal-dual perturbation method. IEEE Trans. Autom. Control 59(6), 1524\u20131538 (2014)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1\u20132","key":"39_CR5","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10107-014-0808-7","volume":"152","author":"N Chatzipanagiotis","year":"2015","unstructured":"Chatzipanagiotis, N., Dentcheva, D., Zavlanos, M.M.: An augmented Lagrangian method for distributed optimization. Math. Program. 152(1\u20132), 405\u2013434 (2015)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"39_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\u20133","key":"39_CR7","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(1\u20133), 81\u2013101 (1994)","journal-title":"Math. Program."},{"key":"39_CR8","unstructured":"Cui, Y., Sun, D., Toh, K.C.: On the R-superlinear convergence of the KKT residues generated by the augmented Lagrangian method for convex composite conic programming (2017). arXiv preprint \n                    arXiv:1706.08800"},{"issue":"2","key":"39_CR9","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1007\/s10915-016-0318-2","volume":"71","author":"W Deng","year":"2017","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)","journal-title":"J. Sci. Comput."},{"issue":"3","key":"39_CR10","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.: On the global and linear convergence of the generalized alternating direction method of multipliers. J. Sci. Comput. 66(3), 889\u2013916 (2016)","journal-title":"J. Sci. Comput."},{"key":"39_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-87821-8","volume-title":"Implicit Functions and Solution Mappings","author":"AL Dontchev","year":"2009","unstructured":"Dontchev, A.L.: Implicit Functions and Solution Mappings. Springer, New York (2009)"},{"issue":"1","key":"39_CR12","doi-asserted-by":"publisher","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(1), 293\u2013318 (1992)","journal-title":"Math. Program."},{"issue":"4","key":"39_CR13","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1137\/0802032","volume":"2","author":"O G\u00fcler","year":"1992","unstructured":"G\u00fcler, O.: New proximal point algorithms for convex minimization. SIAM J. Optim. 2(4), 649\u2013664 (1992)","journal-title":"SIAM J. Optim."},{"key":"39_CR14","unstructured":"Han, D., Sun, D., Zhang, L.: Linear rate convergence of the alternating direction method of multipliers for convex composite quadratic and semi-definite programming (2015). arXiv preprint \n                    arXiv:1508.02134"},{"issue":"1","key":"39_CR15","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(1), 227\u2013238 (2012)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"39_CR16","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s101070100280","volume":"92","author":"B He","year":"2002","unstructured":"He, B., Liao, L.Z., Han, D., Yang, H.: A new inexact alternating directions method for monotone variational inequalities. Math. Program. 92(1), 103\u2013118 (2002)","journal-title":"Math. Program."},{"key":"39_CR17","unstructured":"He, B., Yuan, X.: On the acceleration of augmented lagrangian method for linearly constrained optimization. Optimization online 3 (2010)"},{"issue":"2","key":"39_CR18","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\u2013Rachford alternating direction method. SIAM J. Numer. Anal. 50(2), 700\u2013709 (2012)","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"39_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.: On non-ergodic convergence rate of Douglas\u2013Rachford alternating direction method of multipliers. Numer. Math. 130(3), 567\u2013577 (2015)","journal-title":"Numer. Math."},{"key":"39_CR20","doi-asserted-by":"crossref","unstructured":"Hoffman, A.J.: On approximate solutions of systems of linear inequalities. Selected Papers Of Alan J Hoffman: With Commentary, pp. 174\u2013176 (2003)","DOI":"10.1142\/9789812796936_0018"},{"issue":"1\u20132","key":"39_CR21","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(1\u20132), 165\u2013199 (2017)","journal-title":"Math. Program."},{"key":"39_CR22","unstructured":"Li, X., Sun, D., Toh, K.C.: A highly efficient semismooth Newton augmented Lagrangian method for solving Lasso problems (2016). arXiv preprint \n                    arXiv:1607.05428"},{"issue":"1","key":"39_CR23","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10107-010-0437-8","volume":"133","author":"YJ Liu","year":"2012","unstructured":"Liu, Y.J., Sun, D., Toh, K.C.: An implementable proximal point algorithmic framework for nuclear norm minimization. Math. Program. 133(1), 399\u2013436 (2012)","journal-title":"Math. Program."},{"issue":"4","key":"39_CR24","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1287\/moor.18.4.846","volume":"18","author":"ZQ Luo","year":"1993","unstructured":"Luo, Z.Q., Tseng, P.: On the convergence rate of dual ascent methods for linearly constrained convex minimization. Math. Oper. Res. 18(4), 846\u2013867 (1993)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"39_CR25","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0322019","volume":"22","author":"FJ Luque","year":"1984","unstructured":"Luque, F.J.: Asymptotic convergence analysis of the proximal point algorithm. SIAM J. Control Optim. 22(2), 277\u2013293 (1984)","journal-title":"SIAM J. Control Optim."},{"issue":"2","key":"39_CR26","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/s10915-015-0150-0","volume":"68","author":"S Ma","year":"2016","unstructured":"Ma, S.: Alternating proximal gradient method for convex minimization. J. Sci. Comput. 68(2), 546\u2013572 (2016)","journal-title":"J. Sci. Comput."},{"issue":"4","key":"39_CR27","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0167-6377(92)90046-6","volume":"12","author":"JM Mulvey","year":"1992","unstructured":"Mulvey, J.M., Ruszczyn, A.: A diagonal quadratic approximation method for large scale linear programs. Oper. Res. Lett. 12(4), 205\u2013215 (1992)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"39_CR28","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\/k2). Sov. Math. Dokl. 27(2), 372\u2013376 (1983)","journal-title":"Sov. Math. Dokl."},{"key":"39_CR29","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/BFb0120929","volume-title":"Mathematical Programming at Oberwolfach","author":"SM Robinson","year":"1981","unstructured":"Robinson, S.M.: Some continuity properties of polyhedral multifunctions. In: K\u00f6nig, H., Korte, B., Ritter, K. (eds.) Mathematical Programming at Oberwolfach, pp. 206\u2013214. Springer, Berlin (1981)"},{"issue":"2","key":"39_CR30","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 1(2), 97\u2013116 (1976)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"39_CR31","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14(5), 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"key":"39_CR32","unstructured":"Rockafellar, R.T.: Problem decomposition in block-separable convex optimization: ideas old and new (2017). \n                    https:\/\/www.washington.edu\/"},{"issue":"1","key":"39_CR33","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1137\/130910774","volume":"24","author":"R Shefi","year":"2014","unstructured":"Shefi, R., Teboulle, M.: Rate of convergence analysis of decomposition methods based on the proximal method of multipliers for convex minimization. SIAM J. Optim. 24(1), 269\u2013297 (2014)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"39_CR34","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01586091","volume":"32","author":"JE Spingarn","year":"1985","unstructured":"Spingarn, J.E.: Applications of the method of partial inverses to convex programming: decomposition. Math. Program. 32(2), 199\u2013223 (1985)","journal-title":"Math. Program."},{"issue":"1","key":"39_CR35","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1137\/0329006","volume":"29","author":"P Tseng","year":"1991","unstructured":"Tseng, P.: Applications of a splitting algorithm to decomposition in convex programming and variational inequalities. SIAM J. Control Optim. 29(1), 119\u2013138 (1991)","journal-title":"SIAM J. Control Optim."},{"key":"39_CR36","unstructured":"Wang, X., Hong, M., Ma, S., Luo, Z.Q.: Solving multiple-block separable convex minimization problems using two-block alternating direction method of multipliers (2013). arXiv preprint \n                    arXiv:1308.5294"},{"issue":"1","key":"39_CR37","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1137\/100808563","volume":"22","author":"SJ Wright","year":"2012","unstructured":"Wright, S.J.: Accelerated block-coordinate relaxation for regularized optimization. SIAM J. Optim. 22(1), 159\u2013186 (2012)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"39_CR38","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s10957-006-9080-1","volume":"129","author":"L Xiao","year":"2006","unstructured":"Xiao, L., Boyd, S.: Optimal scaling of a gradient method for distributed resource allocation. J. Optim. Theory Appl. 129(3), 469\u2013488 (2006)","journal-title":"J. Optim. Theory Appl."},{"issue":"10","key":"39_CR39","doi-asserted-by":"publisher","first-page":"2262","DOI":"10.1109\/TAC.2011.2164017","volume":"56","author":"K You","year":"2011","unstructured":"You, K., Xie, L.: Network topology and communication data rate for consensusability of discrete-time multi-agent systems. IEEE Trans. Autom. Control 56(10), 2262\u20132275 (2011)","journal-title":"IEEE Trans. Autom. Control"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-018-0039-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0039-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0039-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T11:00:25Z","timestamp":1589713225000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-018-0039-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,22]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["39"],"URL":"https:\/\/doi.org\/10.1007\/s10589-018-0039-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2018,10,22]]},"assertion":[{"value":"22 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}