{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T06:22:01Z","timestamp":1769581321734,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,6,29]],"date-time":"2023-06-29T00:00:00Z","timestamp":1687996800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,29]],"date-time":"2023-06-29T00:00:00Z","timestamp":1687996800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s11075-023-01582-1","type":"journal-article","created":{"date-parts":[[2023,6,29]],"date-time":"2023-06-29T07:02:15Z","timestamp":1688022135000},"page":"575-603","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A relaxed proximal ADMM method for block separable convex programming"],"prefix":"10.1007","volume":"95","author":[{"given":"Min","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiju","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,29]]},"reference":[{"key":"1582_CR1","volume-title":"Convex programming","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex programming. Cambridge University Press, Cambridge (2004)"},{"key":"1582_CR2","doi-asserted-by":"crossref","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning, Jordan, M. (ed) in Chief, 3, pp 1-122. (2011)","DOI":"10.1561\/2200000016"},{"key":"1582_CR3","doi-asserted-by":"crossref","unstructured":"Lin, Z.C., Li, H., Fang, C.: Alternating Direction Method of Multipliers for Machine Learning, Springer, (2022)","DOI":"10.1007\/978-981-16-9840-8"},{"key":"1582_CR4","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, 303\u2013320 (1969)","journal-title":"J. Optim. Theory Appl."},{"key":"1582_CR5","unstructured":"Powell, M.J.D.: A method for nonlinear constraints in minimization problems, Optimization Fletcher, R. (ed.) New York: Academic Press, pp 283-298. (1969)"},{"issue":"2","key":"1582_CR6","first-page":"41","volume":"9","author":"R Glowinski","year":"1975","unstructured":"Glowinski, R., Marrocco, 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. Mathematical Modelling and Numerical Analysis-Mod\u00e9lisation Math\u00e9matique et Analyse Num\u00e9rique. 9(2), 41\u201376 (1975)","journal-title":"Mathematical Modelling and Numerical Analysis-Mod\u00e9lisation Math\u00e9matique et Analyse Num\u00e9rique."},{"key":"1582_CR7","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 fnite-element approximations. Computers and Mathematics with Applications. 2, 17\u201340 (1976)","journal-title":"Computers and Mathematics with Applications."},{"key":"1582_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0168-2024(08)70028-6","volume-title":"Augmented Lagrangian Methods: Applications to the Solution of Boundary Problems","author":"M Fortin","year":"1983","unstructured":"Fortin, M., Glowinski, R.: On decomposition-coordination methods using an augmented Lagrangian. In: Fortin, M., Glowinski, R. (eds.) Augmented Lagrangian Methods: Applications to the Solution of Boundary Problems, pp. 97\u2013146. Elsevier, Amsterdam (1983)"},{"issue":"4","key":"1582_CR9","doi-asserted-by":"publisher","first-page":"2274","DOI":"10.1137\/130922793","volume":"25","author":"BS He","year":"2015","unstructured":"He, B.S., Hou, L.S., Yuan, X.M.: On full Jacobian decomposition of the augmented Lagrangian method for separable convex programming. SIAM J. Optim. 25(4), 2274\u20132312 (2015)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1582_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10107-014-0826-5","volume":"155","author":"CH Chen","year":"2016","unstructured":"Chen, C.H., He, B.S., Ye, Y.Y., Yuan, X.M.: The direct extension of ADMM for multi-blockconvex minimization problems is not necessarily convergent. Mathematical Programming. 155(1), 57\u201379 (2016)","journal-title":"Mathematical Programming."},{"issue":"2","key":"1582_CR11","doi-asserted-by":"publisher","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(2), 313\u2013340 (2012)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1582_CR12","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1093\/imanum\/drt060","volume":"35","author":"BS He","year":"2015","unstructured":"He, B.S., Tao, M., Yuan, X.M.: A splitting method for separable convex programming. IMA J. Numer Anal. 35(1), 394\u2013426 (2015)","journal-title":"IMA J. Numer Anal."},{"key":"1582_CR13","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. Computational Optimization and Applications 75, 361\u2013388 (2020)","journal-title":"Computational Optimization and Applications"},{"key":"1582_CR14","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s40305-017-0186-y","volume":"6","author":"BS He","year":"2018","unstructured":"He, B.S., Xu, M.H., Yuan, X.M.: Block-wise ADMM with a relaxation factor for multiple-block convex programming. Journal of Operational Resarch Society of China 6, 485\u2013505 (2018)","journal-title":"Journal of Operational Resarch Society of China"},{"key":"1582_CR15","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-981-16-2701-9_8","volume":"360","author":"BS He","year":"2018","unstructured":"He, B.S., Yuan, X.M.: On the optimal proximal parameter of an ADMM-like splitting method for separable convex programming. Mathematical Methods in Image Processing and Inverse Problems 360, 139\u2013163 (2018)","journal-title":"Mathematical Methods in Image Processing and Inverse Problems"},{"issue":"3","key":"1582_CR16","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1137\/15M1044448","volume":"9","author":"BS He","year":"2016","unstructured":"He, B.S., Ma, F., Yuan, X.M.: Convergence study on the symmetric version of ADMM with larger step sizes. SIAM Journal on Imaging Sciences 9(3), 1467\u20131501 (2016)","journal-title":"SIAM Journal on Imaging Sciences"},{"issue":"2","key":"1582_CR17","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.1093\/imanum\/dry092","volume":"40","author":"BS He","year":"2020","unstructured":"He, B.S., Ma, F., Yuan, X.M.: Optimal proximal augmented Lagrangian method and its application to full Jacobian splitting for multi-block separable convex minimization problems. IMA Journal of Numerical Analysis 40(2), 1188\u20131216 (2020)","journal-title":"IMA Journal of Numerical Analysis"},{"key":"1582_CR18","doi-asserted-by":"publisher","first-page":"1415","DOI":"10.1007\/s11075-019-00731-9","volume":"83","author":"J Chen","year":"2020","unstructured":"Chen, J., Wang, Y., He, H., Lv, Y.: Convergence analysis of positive-indefnite proximal ADMM with a Glowinski relaxation factor. Numberical Algorithms 83, 1415\u20131440 (2020)","journal-title":"Numberical Algorithms"},{"key":"1582_CR19","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s11075-019-00819-2","volume":"85","author":"F Ma","year":"2020","unstructured":"Ma, F.: Convergence study on the proximal alternating direction method with larger step size. Numerical Algorithms 85, 399\u2013425 (2020)","journal-title":"Numerical Algorithms"},{"issue":"1","key":"1582_CR20","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10589-020-00206-x","volume":"77","author":"M Tao","year":"2021","unstructured":"Tao, M.: Convergence study of indefinite proximal ADMM with a relaxation factor. Computational Optimization and Applications 77(1), 91\u2013123 (2021)","journal-title":"Computational Optimization and Applications"},{"key":"1582_CR21","doi-asserted-by":"crossref","unstructured":"Cand\u00e9s, E., Li, X., Ma, Y., Wright, J.: Robust principal component analysis? J. ACM, 58(3): 1-37. (2011)","DOI":"10.1145\/1970392.1970395"},{"key":"1582_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, M., Huang, Z.H., Li, Y.F.: The sparsest solution to the system of absolute value equations. Journal of the Operations Research Society of China 3, 31\u201351 (2015)","DOI":"10.1007\/s40305-014-0067-6"},{"key":"1582_CR23","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":"1582_CR24","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10092-016-0177-0","volume":"54","author":"M Sun","year":"2017","unstructured":"Sun, M., Wang, Y.J., Liu, J.: Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA. Calcolo 54, 77\u201394 (2017)","journal-title":"Calcolo"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01582-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-023-01582-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01582-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T08:10:38Z","timestamp":1705479038000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-023-01582-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,29]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["1582"],"URL":"https:\/\/doi.org\/10.1007\/s11075-023-01582-1","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,29]]},"assertion":[{"value":"28 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2023","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":"Competing interests"}}]}}