{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:49:06Z","timestamp":1757544546523,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,9,25]],"date-time":"2021-09-25T00:00:00Z","timestamp":1632528000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,25]],"date-time":"2021-09-25T00:00:00Z","timestamp":1632528000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871029"],"award-info":[{"award-number":["11871029"]}],"id":[{"id":"10.13039\/501100001809","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":[[2021,12]]},"DOI":"10.1007\/s10589-021-00321-3","type":"journal-article","created":{"date-parts":[[2021,9,25]],"date-time":"2021-09-25T13:02:26Z","timestamp":1632574946000},"page":"831-851","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A parallel splitting ALM-based algorithm for separable convex programming"],"prefix":"10.1007","volume":"80","author":[{"given":"Shengjie","family":"Xu","sequence":"first","affiliation":[]},{"given":"Bingsheng","family":"He","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,25]]},"reference":[{"issue":"1","key":"321_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10589-017-9971-0","volume":"70","author":"J Bai","year":"2018","unstructured":"Bai, J., Li, J., Xu, F., Zhang, H.: Generalized symmetric ADMM for separable convex optimization. Comput. Optim. Appl. 70(1), 129\u2013170 (2018). https:\/\/doi.org\/10.1007\/s10589-017-9971-0","journal-title":"Comput. Optim. Appl."},{"key":"321_CR2","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, vol. 25. SIAM, Philadelphia (2017)"},{"key":"321_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-66156-3","volume-title":"Mathematische Optimierung. Grundlagen und Verfahren. \u00d6konometrie und Unternehmensforschung","author":"E Blum","year":"1975","unstructured":"Blum, E., Oettli, W.: Mathematische Optimierung. Grundlagen und Verfahren. \u00d6konometrie und Unternehmensforschung. Springer, Berlin (1975)"},{"issue":"4","key":"321_CR4","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1002\/(SICI)1098-1098(1998)9:4<294::AID-IMA11>3.0.CO;2-X","volume":"9","author":"N Bose","year":"1998","unstructured":"Bose, N., Boo, K.: High-resolution image reconstruction with multisensors. Int. J. Imaging Syst. Technol. 9(4), 294\u2013304 (1998) https:\/\/doi.org\/10.1002\/(SICI)1098-1098(1998)9:4%3c294::AID-IMA11%3e3.0.CO;2-X","journal-title":"Int. J. Imaging Syst. Technol."},{"issue":"1","key":"321_CR5","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":"321_CR6","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."},{"issue":"1\u20132","key":"321_CR7","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). https:\/\/doi.org\/10.1007\/s10107-014-0826-5","journal-title":"Math. Program."},{"key":"321_CR8","series-title":"Springer Series in Operations Research","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2003","unstructured":"Facchinei, F., Pang, J.S.: Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer Series in Operations Research, vol. I. Springer, New York (2003)"},{"issue":"1","key":"321_CR9","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. Appl. 2(1), 17\u201340 (1976). https:\/\/doi.org\/10.1016\/0898-1221(76)90003-1","journal-title":"Comput. Math. Appl."},{"key":"321_CR10","doi-asserted-by":"publisher","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, Berlin (1984)"},{"issue":"3","key":"321_CR11","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10589-017-9971-0","volume":"77","author":"WW Hager","year":"2020","unstructured":"Hager, W.W., Zhang, H.: Convergence rates for an inexact ADMM applied to separable convex optimization. Comput. Optim. Appl. 77(3), 729\u2013754 (2020). https:\/\/doi.org\/10.1007\/s10589-017-9971-0","journal-title":"Comput. Optim. Appl."},{"key":"321_CR12","first-page":"1","volume":"22","author":"B He","year":"2018","unstructured":"He, B.: My 20 years research on alternating directions method of multipliers. Oper. Res. Trans. 22, 1\u201331 (2018)","journal-title":"Oper. Res. Trans."},{"key":"321_CR13","doi-asserted-by":"publisher","first-page":"262","DOI":"10.4208\/ata.OA-SU13","volume":"36","author":"B He","year":"2020","unstructured":"He, B.: Study on the splitting methods for separable convex optimization in a unified algorithmic framework. Anal. Theory Appl. 36, 262\u2013282 (2020). https:\/\/doi.org\/10.4208\/ata.OA-SU13","journal-title":"Anal. Theory Appl."},{"issue":"4","key":"321_CR14","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":"2","key":"321_CR15","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. Numer. Anal. 40(2), 1188\u20131216 (2020). https:\/\/doi.org\/10.1093\/imanum\/dry092","journal-title":"IMA J. Numer. Anal."},{"issue":"2","key":"321_CR16","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10589-019-00152-3","volume":"75","author":"B He","year":"2020","unstructured":"He, B., Ma, F., Yuan, X.: Optimally linearizing the alternating direction method of multipliers for convex programming. Comput. Optim. Appl. 75(2), 361\u2013388 (2020). https:\/\/doi.org\/10.1007\/s10589-019-00152-3","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"321_CR17","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1137\/110822347","volume":"22","author":"B He","year":"2012","unstructured":"He, B., Tao, M., Yuan, X.: Alternating direction method with Gaussian back substitution for separable convex programming. SIAM J. Optim. 22(2), 313\u2013340 (2012). https:\/\/doi.org\/10.1137\/110822347","journal-title":"SIAM J. Optim."},{"issue":"1","key":"321_CR18","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1093\/imanum\/drt060","volume":"35","author":"B He","year":"2015","unstructured":"He, B., Tao, M., Yuan, X.: A splitting method for separable convex programming. IMA J. Numer. Anal. 35(1), 394\u2013426 (2015). https:\/\/doi.org\/10.1093\/imanum\/drt060","journal-title":"IMA J. Numer. Anal."},{"issue":"3","key":"321_CR19","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1287\/moor.2016.0822","volume":"42","author":"B He","year":"2017","unstructured":"He, B., Tao, M., Yuan, X.: Convergence rate analysis for the alternating direction method of multipliers with a substitution procedure for separable convex programming. Math. Oper. Res. 42(3), 662\u2013691 (2017). https:\/\/doi.org\/10.1287\/moor.2016.0822","journal-title":"Math. Oper. Res."},{"key":"321_CR20","unstructured":"He, B., Xu, S., Yuan, J.: Indefinite linearized augmented Lagrangian method for convex optimization with linear inequality constraints. arXiv preprint arXiv:2105.02425 (2021)"},{"issue":"1","key":"321_CR21","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":"321_CR22","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":"321_CR23","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1007\/s10589-018-9994-1","volume":"70","author":"B He","year":"2018","unstructured":"He, B., Yuan, X.: A class of ADMM-based algorithms for three-block separable convex programming. Comput. Optim. Appl. 70(3), 791\u2013826 (2018). https:\/\/doi.org\/10.1007\/s10589-018-9994-1","journal-title":"Comput. Optim. Appl."},{"issue":"5","key":"321_CR24","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). https:\/\/doi.org\/10.1007\/BF00927673","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"321_CR25","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1137\/S1052623495288064","volume":"9","author":"KC Kiwiel","year":"1999","unstructured":"Kiwiel, K.C., Rosa, C.H., Ruszczynski, A.: Proximal decomposition via alternating linearization. SIAM J. Optim. 9(3), 668\u2013689 (1999). https:\/\/doi.org\/10.1137\/S1052623495288064","journal-title":"SIAM J. Optim."},{"issue":"R3","key":"321_CR26","first-page":"154","volume":"4","author":"B Martinet","year":"1970","unstructured":"Martinet, B.: R\u00e9gularisation d'in\u00e9quations variationnelles par approximations successives. Rev. Fr. Inform. Rech. Oper. 4(R3), 154\u2013158 (1970)","journal-title":"Rev. Fr. Inform. Rech. Oper."},{"issue":"3","key":"321_CR27","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."},{"issue":"11","key":"321_CR28","doi-asserted-by":"publisher","first-page":"2233","DOI":"10.1109\/TPAMI.2011.282","volume":"34","author":"Y Peng","year":"2012","unstructured":"Peng, Y., Ganesh, A., Wright, J., Xu, W., Ma, Y.: RASL: robust alignment by sparse and low-rank decomposition for linearly correlated images. IEEE Trans. Pattern Anal. Mach. Intell. 34(11), 2233\u20132246 (2012)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"321_CR29","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)"},{"issue":"5","key":"321_CR30","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":"3","key":"321_CR31","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.jvcir.2009.10.006","volume":"21","author":"S Setzer","year":"2010","unstructured":"Setzer, S., Steidl, G., Teuber, T.: Deblurring Poissonian images by split Bregman techniques. J. Visual Commun. Image Represent. 21(3), 193\u2013199 (2010). https:\/\/doi.org\/10.1016\/j.jvcir.2009.10.006","journal-title":"J. Visual Commun. Image Represent."},{"issue":"1","key":"321_CR32","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/100781894","volume":"21","author":"M Tao","year":"2011","unstructured":"Tao, M., Yuan, X.: Recovering low-rank and sparse components of matrices from incomplete and noisy observations. SIAM J. Optim. 21(1), 57\u201381 (2011). https:\/\/doi.org\/10.1137\/100781894","journal-title":"SIAM J. Optim."},{"issue":"1","key":"321_CR33","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1111\/j.1467-9868.2005.00490.x","volume":"67","author":"R Tibshirani","year":"2005","unstructured":"Tibshirani, R., Saunders, M., Rosset, S., Zhu, J., Knight, K.: Sparsity and smoothness via the fused lasso. J. R. Stat. Soc. 67(1), 91\u2013108 (2005). https:\/\/doi.org\/10.1111\/j.1467-9868.2005.00490.x","journal-title":"J. R. Stat. Soc."},{"key":"321_CR34","doi-asserted-by":"crossref","unstructured":"Yuan, J., Bae, E., Tai, X.C.: A study on continuous max-flow and min-cut approaches. In: 2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 2217\u20132224. IEEE (2010)","DOI":"10.1109\/CVPR.2010.5539903"},{"key":"321_CR35","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 (2010)","DOI":"10.1007\/978-3-642-15567-3_28"},{"key":"321_CR36","unstructured":"Yuan, J., Fenster, A.: Modern convex optimization to medical image analysis. arXiv preprint arXiv:1809.08734 (2018)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00321-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-021-00321-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00321-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T17:37:57Z","timestamp":1637257077000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-021-00321-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,25]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["321"],"URL":"https:\/\/doi.org\/10.1007\/s10589-021-00321-3","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2021,9,25]]},"assertion":[{"value":"9 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}