{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T23:55:13Z","timestamp":1775519713795,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T00:00:00Z","timestamp":1710115200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T00:00:00Z","timestamp":1710115200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171021"],"award-info":[{"award-number":["12171021"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s11075-024-01796-x","type":"journal-article","created":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T09:01:32Z","timestamp":1710147692000},"page":"325-345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["$$O(1\/k^2)$$ convergence rates of (dual-primal) balanced augmented Lagrangian methods for linearly constrained convex programming"],"prefix":"10.1007","volume":"98","author":[{"given":"Tao","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiru","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,11]]},"reference":[{"issue":"1","key":"1796_CR1","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."},{"key":"1796_CR2","unstructured":"Eckstein, J.: Splitting methods for monotone operators with applications to parallel optimization. PH.D. Thesis, MIT (1989)"},{"issue":"1","key":"1796_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1080\/10556789408805578","volume":"4","author":"J Eckstein","year":"1994","unstructured":"Eckstein, J.: Some saddle-function splitting methods for convex programming. Optim. Method Softw. 4(1), 75\u201383 (1994)","journal-title":"Optim. Method Softw."},{"issue":"1","key":"1796_CR4","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. with Appl. 2(1), 17\u201340 (1976)","journal-title":"Comput. Math. with Appl."},{"issue":"R2","key":"1796_CR5","first-page":"41","volume":"9","author":"R Glowinski","year":"1975","unstructured":"Glowinski, R., Marroco, A.: Sur l\u2019approximation, par\u00e9l\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. Model. Num. 9(R2), 41\u201376 (1975)","journal-title":"Esaim-Math. Model. Num."},{"issue":"2","key":"1796_CR6","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10589-019-00152-3","volume":"75","author":"BS He","year":"2020","unstructured":"He, B.S., Ma, F., Yuan, X.M.: Optimally linearizing the alternating direction method of multipliers for convex programming. Comput. Optim. Appl. 75(2), 361\u2013388 (2020)","journal-title":"Comput. Optim. Appl."},{"key":"1796_CR7","unstructured":"He, B.S., Yuan, X.M.: Balanced augmented Lagrangian method for convex programming. arXiv:2108.08554 (2021)"},{"key":"1796_CR8","unstructured":"He, B.S., Yuan, X.M.: On the acceleration of augmented Lagrangian method for linearly constrained optimization. Optimization online (2010)"},{"issue":"5","key":"1796_CR9","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 Appl. 4(5), 303\u2013320 (1969)","journal-title":"J. Optim. Theory Appl."},{"key":"1796_CR10","unstructured":"Powell, M.J.D.: A method for nonlinear constraints in minimization problems. Optimization, 283\u2013298 (1969)"},{"issue":"2","key":"1796_CR11","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":"318","key":"1796_CR12","doi-asserted-by":"publisher","first-page":"1685","DOI":"10.1090\/mcom\/3388","volume":"88","author":"WY Tian","year":"2019","unstructured":"Tian, W.Y., Yuan, X.M.: An alternating direction method of multipliers with a worst-case $${O}(1\/n^2)$$ convergence rate. Math. Comput. 88(318), 1685\u20131713 (2019)","journal-title":"Math. Comput."},{"issue":"3","key":"1796_CR13","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1137\/16M1082305","volume":"27","author":"YY Xu","year":"2017","unstructured":"Xu, Y.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."},{"issue":"1","key":"1796_CR14","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1007\/s12190-022-01779-y","volume":"69","author":"SJ Xu","year":"2023","unstructured":"Xu, S.J.: Dual-primal balanced augmented Lagrangian method for linearly constrained convex programming. J. Appl. Math. Comput. 69(1), 1015\u20131035 (2023)","journal-title":"J. Appl. Math. Comput."},{"issue":"281","key":"1796_CR15","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1090\/S0025-5718-2012-02598-1","volume":"82","author":"JF Yang","year":"2012","unstructured":"Yang, J.F., Yuan, X.M.: Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization. Math. Comput. 82(281), 301\u2013329 (2012)","journal-title":"Math. Comput."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01796-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-024-01796-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01796-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T16:57:43Z","timestamp":1735837063000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-024-01796-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,11]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["1796"],"URL":"https:\/\/doi.org\/10.1007\/s11075-024-01796-x","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,11]]},"assertion":[{"value":"13 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}