{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T10:03:06Z","timestamp":1769076186957,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T00:00:00Z","timestamp":1661126400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T00:00:00Z","timestamp":1661126400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100021171","name":"Basic and Applied Basic Research Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2018A0303130123"],"award-info":[{"award-number":["2018A0303130123"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s12190-022-01779-y","type":"journal-article","created":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T08:03:58Z","timestamp":1661155438000},"page":"1015-1035","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A dual-primal balanced augmented Lagrangian method for linearly constrained convex programming"],"prefix":"10.1007","volume":"69","author":[{"given":"Shengjie","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,22]]},"reference":[{"issue":"5","key":"1779_CR1","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF00927673","volume":"4","author":"MR Hestenes","year":"1969","unstructured":"Hestenes, M.R.: Multiplier and gradient methods. J. Optim. Theory Appli. 4(5), 303\u2013320 (1969). https:\/\/doi.org\/10.1007\/BF00927673","journal-title":"J. Optim. Theory Appli."},{"key":"1779_CR2","first-page":"283","volume-title":"Optimization","author":"MJ Powell","year":"1969","unstructured":"Powell, M.J.: A method for nonlinear constraints in minimization problems. In: Fletcher, R. (ed.) Optimization, pp. 283\u2013298. Academic Press, New York (1969)"},{"key":"1779_CR3","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"DP Bertsekas","year":"1982","unstructured":"Bertsekas, D.P.: Constrained Optimization and Lagrange Multiplier Methods. Academic Press, New York (1982)"},{"key":"1779_CR4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973365","volume-title":"Practical Augmented Lagrangian Methods for Constrained Optimization","author":"EG Birgin","year":"2014","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: Practical Augmented Lagrangian Methods for Constrained Optimization. SIAM, Philadelphia (2014)"},{"key":"1779_CR5","volume-title":"Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems","author":"M Fortin","year":"1983","unstructured":"Fortin, M., Glowinski, R.: Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems. North-Holland, Amsterdam (1983)"},{"key":"1779_CR6","doi-asserted-by":"publisher","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, Philadelphia (1989)"},{"key":"1779_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718614","volume-title":"Lagrange Multiplier Approach to Variational Problems and Applications","author":"K Ito","year":"2008","unstructured":"Ito, K., Kunisch, K.: Lagrange Multiplier Approach to Variational Problems and Applications. SIAM, Philadelphia (2008)"},{"issue":"5","key":"1779_CR8","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). https:\/\/doi.org\/10.1137\/0314056","journal-title":"SIAM J. Control Optim."},{"issue":"2","key":"1779_CR9","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). https:\/\/doi.org\/10.1287\/moor.1.2.97","journal-title":"Math. Oper. Res."},{"key":"1779_CR10","first-page":"154","volume":"4","author":"B Martinet","year":"1970","unstructured":"Martinet, B.: R\u00e9gularisation d\u2019in\u00e9quations variationnelles par approximations successives. Rev. Fran\u00e7aise Informat. Recherche Op\u00e9rationnelle. 4, 154\u2013158 (1970)","journal-title":"Rev. Fran\u00e7aise Informat. Recherche Op\u00e9rationnelle."},{"issue":"2","key":"1779_CR11","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.1093\/imanum\/dry092","volume":"40","author":"B He","year":"2020","unstructured":"He, B., Ma, F., Yuan, X.: Optimal proximal augmented Lagrangian method and its application to full Jacobian splitting for multi-block separable convex minimization problems. IMA J. Num. Anal. 40(2), 1188\u20131216 (2020)","journal-title":"IMA J. Num. Anal."},{"key":"1779_CR12","unstructured":"He, B., Yuan, X.: Balanced augmented Lagrangian method for convex programming. arXiv preprint. arXiv:2108.08554 (2021)"},{"issue":"281","key":"1779_CR13","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1090\/S0025-5718-2012-02598-1","volume":"82","author":"J Yang","year":"2013","unstructured":"Yang, J., Yuan, X.: Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization. Math. Comp. 82(281), 301\u2013329 (2013). https:\/\/doi.org\/10.1090\/S0025-5718-2012-02598-1","journal-title":"Math. Comp."},{"issue":"6","key":"1779_CR14","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9(6), 717\u2013772 (2009). https:\/\/doi.org\/10.1007\/s10208-009-9045-5","journal-title":"Found. Comput. Math."},{"issue":"1","key":"1779_CR15","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). https:\/\/doi.org\/10.1137\/S003614450037906X","journal-title":"SIAM Rev."},{"issue":"3","key":"1779_CR16","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 127\u2013239 (2014). https:\/\/doi.org\/10.1561\/2400000003","journal-title":"Found. Trends Optim."},{"key":"1779_CR17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-Order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Order Methods in Optimization. SIAM, Philadelphia (2017)"},{"issue":"1","key":"1779_CR18","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10589-013-9616-x","volume":"59","author":"G Gu","year":"2014","unstructured":"Gu, G., He, B., Yuan, X.: Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach. Comput. Optim. Appl. 59(1), 135\u2013161 (2014). https:\/\/doi.org\/10.1007\/s10589-013-9616-x","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1779_CR19","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1137\/100814494","volume":"5","author":"B He","year":"2012","unstructured":"He, B., Yuan, X.: Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective. SIAM J. Imaging Sci. 5(1), 119\u2013149 (2012). https:\/\/doi.org\/10.1137\/100814494","journal-title":"SIAM J. Imaging Sci."},{"issue":"2","key":"1779_CR20","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). https:\/\/doi.org\/10.1137\/110836936","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"1779_CR21","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). https:\/\/doi.org\/10.1007\/s00211-014-0673-6","journal-title":"Numer. Math."},{"issue":"1","key":"1779_CR22","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. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2010). https:\/\/doi.org\/10.1561\/2200000016","journal-title":"Found. Trends Mach. Learn."},{"issue":"4","key":"1779_CR23","doi-asserted-by":"publisher","first-page":"1935","DOI":"10.1214\/11-AOS949","volume":"40","author":"V Chandrasekaran","year":"2012","unstructured":"Chandrasekaran, V., Parrilo, P.A., Willsky, A.S.: Latent variable graphical model selection via convex optimization. Ann. Stat. 40(4), 1935\u20131967 (2012). https:\/\/doi.org\/10.1214\/11-AOS949","journal-title":"Ann. Stat."},{"key":"1779_CR24","volume-title":"Discriminant Analysis and Statistical Pattern Recognition","author":"GJ McLachlan","year":"2004","unstructured":"McLachlan, G.J.: Discriminant Analysis and Statistical Pattern Recognition. Wiley Interscience, New York (2004)"},{"issue":"2","key":"1779_CR25","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/20M1343956","volume":"43","author":"H Sun","year":"2021","unstructured":"Sun, H., Tai, X.-C., Yuan, J.: Efficient and convergent preconditioned ADMM for the Potts models. SIAM J. Sci. Comput. 43(2), 455\u2013478 (2021). https:\/\/doi.org\/10.1137\/20M1343956","journal-title":"SIAM J. Sci. Comput."},{"key":"1779_CR26","doi-asserted-by":"crossref","unstructured":"Yuan, J., Bae, E., Tai, X.-C., Boykov, Y.: A continuous max-flow approach to Potts model. In: Computer Vision-ECCV 2010, pp. 379\u2013392. Springer, New York (2010)","DOI":"10.1007\/978-3-642-15567-3_28"},{"key":"1779_CR27","volume-title":"Matrix Computations","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations. Johns Hopkins University Press, Baltimore (1996)"},{"key":"1779_CR28","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (2006)"},{"issue":"1","key":"1779_CR29","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1137\/060657704","volume":"51","author":"AM Bruckstein","year":"2009","unstructured":"Bruckstein, A.M., Donoho, D.L., Elad, M.: From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM Rev. 51(1), 34\u201381 (2009). https:\/\/doi.org\/10.1137\/060657704","journal-title":"SIAM Rev."},{"issue":"1","key":"1779_CR30","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). https:\/\/doi.org\/10.1007\/s10851-010-0251-1","journal-title":"J. Math. Imaging Vis."},{"issue":"2","key":"1779_CR31","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). https:\/\/doi.org\/10.1007\/s10915-016-0318-2","journal-title":"J. Sci. Comput."},{"issue":"4","key":"1779_CR32","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). https:\/\/doi.org\/10.1137\/130922793","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1779_CR33","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1007\/s10915-015-0060-1","volume":"66","author":"B He","year":"2016","unstructured":"He, B., Xu, H.-K., Yuan, X.: On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM. J. Sci. Comput. 66(3), 1204\u20131217 (2016). https:\/\/doi.org\/10.1007\/s10915-015-0060-1","journal-title":"J. Sci. Comput."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-022-01779-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-022-01779-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-022-01779-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T22:44:52Z","timestamp":1674859492000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-022-01779-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,22]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["1779"],"URL":"https:\/\/doi.org\/10.1007\/s12190-022-01779-y","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,22]]},"assertion":[{"value":"12 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}