{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:38:20Z","timestamp":1767141500650,"version":"build-2238731810"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771113"],"award-info":[{"award-number":["11771113"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LY17A010028"],"award-info":[{"award-number":["LY17A010028"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11471156"],"award-info":[{"award-number":["11471156"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11571087"],"award-info":[{"award-number":["11571087"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Comput Math"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s10444-017-9574-4","type":"journal-article","created":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T02:19:14Z","timestamp":1512094754000},"page":"1091-1115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A partially isochronous splitting algorithm for three-block separable convex minimization problems"],"prefix":"10.1007","volume":"44","author":[{"given":"Hongjin","family":"He","sequence":"first","affiliation":[]},{"given":"Liusheng","family":"Hou","sequence":"additional","affiliation":[]},{"given":"Hong-Kun","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,1]]},"reference":[{"key":"9574_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"H Bauschke","year":"2011","unstructured":"Bauschke, H., Combettes, P.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, New York (2011)"},{"key":"9574_CR2","volume-title":"Parallel and Distributed Computation, Numerical Methods","author":"D Bertsekas","year":"1989","unstructured":"Bertsekas, D., Tsitsiklis, J.: Parallel and Distributed Computation, Numerical Methods. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"9574_CR3","doi-asserted-by":"crossref","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\u2013122 (2010)","journal-title":"Found. Trends Mach. Learn."},{"key":"9574_CR4","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J Cai","year":"2010","unstructured":"Cai, J., Cand\u00e9s, E., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20, 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"key":"9574_CR5","doi-asserted-by":"crossref","first-page":"187","DOI":"10.3934\/ipi.2008.2.187","volume":"2","author":"J Cai","year":"2008","unstructured":"Cai, J., Chan, R., Nikolova, M.: Two-phase approach for deblurring images corrupted by impulse plus gaussian noise. Inverse Prob. Imag. 2, 187\u2013204 (2008)","journal-title":"Inverse Prob. Imag."},{"key":"9574_CR6","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s10589-016-9860-y","volume":"66","author":"X Cai","year":"2017","unstructured":"Cai, X., Han, D., Yuan, X.: On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function. Comput. Optim. Appl. 66, 39\u201373 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"9574_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1970392.1970395","volume":"58","author":"E Cand\u0117s","year":"2011","unstructured":"Cand\u0117s, E., Li, X., Ma, Y., Wright, J.: Robust principal component analysis? J. ACM 58, 1\u201337 (2011)","journal-title":"J. ACM"},{"key":"9574_CR8","doi-asserted-by":"crossref","first-page":"1935","DOI":"10.1214\/11-AOS949","volume":"40","author":"V Chandrasekaran","year":"2012","unstructured":"Chandrasekaran, V., Parrilo, P., Willskyc, A.: Latent variable graphical model selection via convex optimization. Ann. Statist. 40, 1935\u20131967 (2012)","journal-title":"Ann. Statist."},{"key":"9574_CR9","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1137\/090761793","volume":"21","author":"V Chandrasekaran","year":"2011","unstructured":"Chandrasekaran, V., Sanghavi, S., Parrilo, P., Willskyc, A.: Rank-sparsity incoherence for matrix decomposition. SIAM J. Optim. 21, 572\u2013596 (2011)","journal-title":"SIAM J. Optim."},{"key":"9574_CR10","doi-asserted-by":"crossref","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. Ser. A 155, 57\u201379 (2016)","journal-title":"Math. Program. Ser. A"},{"issue":"2","key":"9574_CR11","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10589-016-9864-7","volume":"66","author":"L Chen","year":"2017","unstructured":"Chen, L., Sun, D., Toh, K.C.: A note on the convergence of admm for linearly constrained convex optimization problems. Comput. Optim. Appl. 66(2), 327\u2013343 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"9574_CR12","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"P Combettes","year":"2005","unstructured":"Combettes, P., Wajs, V.: Signal recovery by proximal forward-backward splitting. Multiscale Model Simul. 4, 1168\u20131200 (2005)","journal-title":"Multiscale Model Simul."},{"key":"9574_CR13","unstructured":"Eckstein, J.: Splitting methods for monotone operators with applications to parallel optimization. Ph.D. thesis Massachusetts Institute of Technology (1989)"},{"key":"9574_CR14","unstructured":"Eckstein, J.: Augmented Lagrangian and alternating direction methods for convex optimization: A tutorial and some illustrative computational results. Tech. Rep. 32\u20132012 Rutgers University (2012)"},{"key":"9574_CR15","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2003","unstructured":"Facchinei, F., Pang, J.: Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer, New York (2003)"},{"key":"9574_CR16","doi-asserted-by":"crossref","first-page":"16","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 approximations. Comput. Math. Appl. 2, 16\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"key":"9574_CR17","doi-asserted-by":"crossref","unstructured":"Glowinski, R.: On alternating direction methods of multipliers: a historical perspective. In: Fitzgibbon, W., Kuznetsov, Y.A., Neittaanm\u00e4ki, P., Pironneau, O. (eds.) Modeling, Simulation and Optimization for Science and Technology, Computational Methods in Applied Sciences, chap. 4, vol. 34, pp. 59\u201382. Springer, New York (2014)","DOI":"10.1007\/978-94-017-9054-3_4"},{"key":"9574_CR18","first-page":"41","volume":"R2","author":"R Glowinski","year":"1975","unstructured":"Glowinski, R., Marrocco, A.: Approximation par \u00e9l\u00e9ments finis d\u2019ordre un et r\u00e9solution par p\u00e9nalisation-dualit\u00e9 d\u2019une classe de probl\u00e8mes non lin\u00e9aires. R.A.I.R.O. R2, 41\u201376 (1975)","journal-title":"R.A.I.R.O."},{"key":"9574_CR19","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s00211-013-0580-2","volume":"127","author":"D Han","year":"2014","unstructured":"Han, D., He, H., Yang, H., Yuan, X.: A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints. Numer. Math. 127, 167\u2013200 (2014)","journal-title":"Numer. Math."},{"issue":"1","key":"9574_CR20","doi-asserted-by":"crossref","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."},{"key":"9574_CR21","doi-asserted-by":"crossref","first-page":"2263","DOI":"10.1090\/S0025-5718-2014-02829-9","volume":"83","author":"D Han","year":"2014","unstructured":"Han, D., Yuan, X., Zhang, W.: An augmented-Lagrangian-based parallel splitting method for separable convex minimization with applications to image processing. Math. Comput. 83, 2263\u20132291 (2014)","journal-title":"Math. Comput."},{"key":"9574_CR22","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10589-012-9510-y","volume":"54","author":"D Han","year":"2013","unstructured":"Han, D., Yuan, X., Zhang, W., Cai, X.: An ADM-based splitting method for separable convex programming. Comput. Optim. Appl. 54, 343\u2013369 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"9574_CR23","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10589-007-9109-x","volume":"42","author":"B He","year":"2009","unstructured":"He, B.: Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities. Comput. Optim. Appl. 42, 195\u2013212 (2009)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"9574_CR24","doi-asserted-by":"crossref","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)","journal-title":"SIAM J. Optim."},{"key":"9574_CR25","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1080\/02331934.2011.611885","volume":"62","author":"B He","year":"2013","unstructured":"He, B., Tao, M., Xu, M., Yuan, X.: Alternating directions based contraction method for generally separable linearly constrained convex programming problems. Optimizaition 62, 573\u2013596 (2013)","journal-title":"Optimizaition"},{"key":"9574_CR26","doi-asserted-by":"crossref","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, 313\u2013340 (2012)","journal-title":"SIAM J. Optim."},{"key":"9574_CR27","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1093\/imanum\/drt060","volume":"35","author":"B He","year":"2014","unstructured":"He, B., Tao, M., Yuan, X.: A splitting method for separate convex programming. IMA J. Numer. Anal. 35, 394\u2013426 (2014)","journal-title":"IMA J. Numer. Anal."},{"key":"9574_CR28","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1007\/s10915-015-0060-1","volume":"66","author":"B He","year":"2016","unstructured":"He, B., Xu, H., 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, 1204\u20131217 (2016)","journal-title":"J. Sci. Comput."},{"key":"9574_CR29","doi-asserted-by":"crossref","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 Douglas-Rachford alternating direction method. SIAM J. Numer. Anal. 50, 700\u2013709 (2012)","journal-title":"SIAM J. Numer. Anal."},{"key":"9574_CR30","unstructured":"He, B., Yuan, X.: On the direct extension of ADMM for multi-block separable convex programming and beyond: From variational inequality perspective. http:\/\/www.optimization-online.org\/DB_FILE\/2014\/03\/4293.pdf (2014)"},{"key":"9574_CR31","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s10444-015-9408-1","volume":"42","author":"H He","year":"2016","unstructured":"He, H., Han, D.: A distributed Douglas-Rachford splitting method for multi-block convex minimization problems. Adv. Comput. Math. 42, 27\u201353 (2016)","journal-title":"Adv. Comput. Math."},{"key":"9574_CR32","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF00927673","volume":"4","author":"M Hestenes","year":"1969","unstructured":"Hestenes, M.: Multiplier and gradient methods. J. Optim. Theory Appl. 4, 303\u2013320 (1969)","journal-title":"J. Optim. Theory Appl."},{"key":"9574_CR33","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s10107-016-1034-2","volume":"162","author":"M Hong","year":"2017","unstructured":"Hong, M., Luo, Z.: On the linear convergence of the alternating direction method of multipliers. Math. Program. Ser. A 162, 165\u2013199 (2017)","journal-title":"Math. Program. Ser. A"},{"key":"9574_CR34","unstructured":"Honorio, J., Samaras, D.: Multi-task learning of Gaussian graphical models. In: Proceedings of the 27th International Conference on Machine Learning, pp. 447\u2013454. Haifa, Israel (2010)"},{"key":"9574_CR35","unstructured":"Larsen, R.: PROPACK-software for large and sparse SVD calculations. http:\/\/sun.stanford.edu\/srmunk\/PROPACK\/"},{"issue":"3","key":"9574_CR36","doi-asserted-by":"crossref","first-page":"1550024","DOI":"10.1142\/S0217595915500244","volume":"32","author":"M Li","year":"2015","unstructured":"Li, M., Sun, D., Toh, K.C.: A convergent 3-block semi-proximal ADMM for convex minimization problems with one strongly convex block. Asia-Pacific J. Oper. Res. 32(3), 1550024 (2015). (19 pages)","journal-title":"Asia-Pacific J. Oper. Res."},{"key":"9574_CR37","volume-title":"Discriminant Analysis and Statistical Pattern Recoginition","author":"G McLachlan","year":"2004","unstructured":"McLachlan, G.: Discriminant Analysis and Statistical Pattern Recoginition. Wiley, Hoboken (2004)"},{"key":"9574_CR38","first-page":"153","volume":"95","author":"J Moreau","year":"1965","unstructured":"Moreau, J.: Proximit\u0117 et dualit\u0117 dans un espace Hilbertien. Bulletin de la Societe Mathematique de France 95, 153\u2013171 (1965)","journal-title":"Bulletin de la Societe Mathematique de France"},{"key":"9574_CR39","volume-title":"Introductory Lectures on Convex Optimization: Basic Course","author":"Y Nesterov","year":"2003","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: Basic Course. Kluwer, Boston (2003)"},{"key":"9574_CR40","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-Point Polynomial Algorithms in Convex Programming Studies in Applied and Numerical Mathematics, 2nd edn., vol. 13","author":"Y Nesterov","year":"1994","unstructured":"Nesterov, Y., Nemirovskii, A.: Interior-Point Polynomial Algorithms in Convex Programming Studies in Applied and Numerical Mathematics, 2nd edn., vol. 13. SIAM, Philadelphia (1994)"},{"key":"9574_CR41","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization, 2nd edn. Springer Series in Operations Research and Financial Engineering Springer-Verlag (2006)"},{"key":"9574_CR42","unstructured":"Powell, M.: A method for nonlinear constraints in minimization problems. In: Fletcher, R. (ed.) Optimization, pp 283\u2013298, London (1969)"},{"issue":"1","key":"9574_CR43","doi-asserted-by":"crossref","first-page":"209","DOI":"10.2140\/pjm.1970.33.209","volume":"33","author":"R Rockafellar","year":"1970","unstructured":"Rockafellar, R.: On the maximal monotonicity of subdifferential mappings. Pac. J. Math 33(1), 209\u2013216 (1970)","journal-title":"Pac. J. Math"},{"issue":"1","key":"9574_CR44","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1137\/110854989","volume":"6","author":"H Schaeffer","year":"2013","unstructured":"Schaeffer, H., Osher, S.: A low patch-rank interpretation of texture. SIAM J. Imaging Sci. 6(1), 226\u2013262 (2013)","journal-title":"SIAM J. Imaging Sci."},{"key":"9574_CR45","doi-asserted-by":"crossref","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, 57\u201381 (2011)","journal-title":"SIAM J. Optim."},{"key":"9574_CR46","first-page":"645","volume":"11","author":"X Wang","year":"2015","unstructured":"Wang, X., Hong, M., Ma, S., Luo, Z.: Solving multiple-block separable convex minimization problems using two-block alternating direction method of multipliers. Pac. J. Optim. 11, 645\u2013667 (2015)","journal-title":"Pac. J. Optim."}],"updated-by":[{"DOI":"10.1007\/s10444-018-9591-y","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2018,2,20]],"date-time":"2018-02-20T00:00:00Z","timestamp":1519084800000}}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10444-017-9574-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-017-9574-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-017-9574-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T07:22:47Z","timestamp":1534144967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10444-017-9574-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,1]]},"references-count":46,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["9574"],"URL":"https:\/\/doi.org\/10.1007\/s10444-017-9574-4","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,1]]}}}