{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T11:05:46Z","timestamp":1760267146650},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,12,3]],"date-time":"2011-12-03T00:00:00Z","timestamp":1322870400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Adv Comput Math"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s10444-011-9261-9","type":"journal-article","created":{"date-parts":[[2011,12,3]],"date-time":"2011-12-03T15:31:49Z","timestamp":1322926309000},"page":"837-858","source":"Crossref","is-referenced-by-count":9,"title":["Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations"],"prefix":"10.1007","volume":"38","author":[{"given":"Yunhai","family":"Xiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soon-Yi","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong-Hui","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,12,3]]},"reference":[{"key":"9261_CR1","volume-title":"Parallel and distributed computation: numerical methods","author":"DP Bertsekas","year":"1989","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and distributed computation: numerical methods. PrenticeHall, Englewood Cliffs, NJ (1989)"},{"key":"9261_CR2","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"JF Cai","year":"2010","unstructured":"Cai, J.F., Cand\u00e8s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20, 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"key":"9261_CR3","doi-asserted-by":"crossref","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, 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"key":"9261_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1970392.1970395","volume":"58","author":"EJ Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s, E.J., Li, X., Ma, Y., Wright, J.: Robust principal component analysis? J. ACM 58, 1\u201337 (2011)","journal-title":"J. ACM"},{"key":"9261_CR5","doi-asserted-by":"crossref","unstructured":"Chen, C., He, B.S., Yuan, X.: Matrix completion via alternating direction method. IMA J. Numer. Anal. doi: 10.1093\/imanum\/drq039","DOI":"10.1093\/imanum\/drq039"},{"key":"9261_CR6","doi-asserted-by":"crossref","unstructured":"Deng, W., Yin, W., Zhang, Y.: Group sparse optimization by alternating direction method. Avaiable at http:\/\/www.optimization-online.org\/DB_HTML\/2011\/04\/3006.html","DOI":"10.21236\/ADA585746"},{"key":"9261_CR7","first-page":"2899","volume":"10","author":"J Duchi","year":"2009","unstructured":"Duchi, J., Singer, Y.: Efficient online and batch learning using forward backward splitting. J. Mach. Learn. Res. 10, 2899\u20132934 (2009)","journal-title":"J. Mach. Learn. Res."},{"key":"9261_CR8","doi-asserted-by":"crossref","unstructured":"Elhamifar, E., Vidal, R.: Sparse subspace clustering. In: IEEE Conference on Computer Vision and Pattern Recongnition, vol. 2, pp. 2970\u20132997 (2009)","DOI":"10.1109\/CVPRW.2009.5206547"},{"key":"9261_CR9","unstructured":"Esser, E.: Applications of Lagrangian-based alternating direction methods and connections to split Bregman. TR. 09-31, CAM, UCLA. Available at ftp:\/\/ftp.math.ucla.edu\/pub\/camreport\/cam09-31.pdf (2009)"},{"key":"9261_CR10","doi-asserted-by":"crossref","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 approximations. Comput. Math. Appl. 2, 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"key":"9261_CR11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1051\/m2an\/197509R200411","volume":"2","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 nonlin\u00e9aires. Revue Francaise d\u2019automatique, informatique, recherche op\u00e9retionnelle. Analyse num\u00e9rique 2, 41\u201376 (1975)","journal-title":"Analyse num\u00e9rique"},{"key":"9261_CR12","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/080725891","volume":"2","author":"T Goldstein","year":"2009","unstructured":"Goldstein, T., Osher, S.: The split Bregman method for \u21131-regularized problems. SIAM J. Imag. Sci. 2, 323\u2013343 (2009)","journal-title":"SIAM J. Imag. Sci."},{"key":"9261_CR13","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1137\/070698920","volume":"19","author":"ET Hale","year":"2008","unstructured":"Hale, E.T., Yin, W., Zhang., Y.: Fixed-point continuation for \u21131-minimization: methodology and convergence. SIAM J. Optim. 19, 1107\u20131130 (2008)","journal-title":"SIAM J. Optim."},{"key":"9261_CR14","unstructured":"He, B.S., Tao, M., Yuan, X.M.: A splitting method for separate convex programming with linking linear constraints. Available at http:\/\/www.optimization-online.org\/DB_HTML\/2010\/06\/2665.html"},{"key":"9261_CR15","unstructured":"He, B.S., Tao, M., Xu, M.H., Yuan, X.M.: Alternating directions based contraction method for generally separable linearly constrained convex programming problems. Available at http:\/\/www.optimization-online.org\/DB_HTML\/2009\/11\/2465.html"},{"key":"9261_CR16","unstructured":"He, B.S., Tao, M., Yuan, X.M.: A splitting method for separate convex programming with linking linear constraints. Available at http:\/\/www.optimization-online.org\/DB_HTML\/2010\/06\/2665.html"},{"key":"9261_CR17","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1137\/090768813","volume":"32","author":"BS He","year":"2011","unstructured":"He, B.S., Xu, M.H., Yuan, X.M.: Solving large-scale least squares semidefinite programming by alternating direction methods. SIAM. J. Matrix Anal. Appl. 32, 136\u2013152 (2011)","journal-title":"SIAM. J. Matrix Anal. Appl."},{"key":"9261_CR18","unstructured":"Lin, Z., Chen, M., Wu, L., Ma, Y.: The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices. Math. Program. Available at http:\/\/arxiv.org\/abs\/1009.5055"},{"key":"9261_CR19","unstructured":"Lin, Z., Ganesh, A., Wright, J., Wu, L., Chen, M., Ma, Y.: Fast convex optimization algorithm for exact recovery of a corrupted low-rank matrix. Available at http:\/\/yima.csl.illinois.edu\/psfile\/rpca_algorithms.pdf"},{"key":"9261_CR20","unstructured":"G. Liu, Z. Lin, S. Yan, J. Sun, Y. Yu, Ma, Y.: Robust recovery of subspace structures by low-rank representation. Available at http:\/\/arxiv.org\/abs\/1010.2955"},{"key":"9261_CR21","doi-asserted-by":"crossref","unstructured":"Ma, S., Goldfarb, D., Chen, L.: Fixed point and Bregman iterative methods for matrix rank minimization. Math. Program. doi: 10.1007\/s10107-009-0306-5","DOI":"10.1007\/s10107-009-0306-5"},{"key":"9261_CR22","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming proble with convergence rate O(1\/k 2). Sov. Math., Dokl. 27, 372\u2013376 (1983)","journal-title":"Sov. Math., Dokl."},{"key":"9261_CR23","doi-asserted-by":"crossref","first-page":"1832","DOI":"10.1109\/TPAMI.2009.191","volume":"32","author":"S Rao","year":"2010","unstructured":"Rao, S., Tron, R., Vida, R., Ma, Y.: Motion segmentation in the presence of outlying, incomplete, or corrupted trajectories. IEEE Trans. Pattern Anal. 32, 1832\u20131845 (2010)","journal-title":"IEEE Trans. Pattern Anal."},{"key":"9261_CR24","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14, 877\u2013898 (1998)","journal-title":"SIAM J. Control Optim."},{"key":"9261_CR25","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/s10851-009-0179-5","volume":"36","author":"G Steidl","year":"2010","unstructured":"Steidl, G., Teuber, T.: Removing multiplicative noise by Douglas-Rachford splitting methods. J. Math. Imag. Vis. 36, 168\u2013184 (2010)","journal-title":"J. Math. Imag. Vis."},{"key":"9261_CR26","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11\u201312","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones. Optim. Method. Softw. 11\u201312, 625\u2013653 (1999)","journal-title":"Optim. Method. Softw."},{"key":"9261_CR27","doi-asserted-by":"crossref","first-page":"1210","DOI":"10.1016\/j.ejor.2010.07.020","volume":"207","author":"J Sun","year":"2010","unstructured":"Sun, J., Zhang, S.: A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs. Eur. J. Oper. Res. 207, 1210\u20131220 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"9261_CR28","doi-asserted-by":"crossref","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":"9261_CR29","unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex-concave optimization. SIAM J. Optim. (2008, submitted)"},{"key":"9261_CR30","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"RH T\u00fct\u00fcnc\u00fc","year":"2003","unstructured":"T\u00fct\u00fcnc\u00fc, R.H., Toh, K.C., Todd., M.J.: Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program. 95, 189\u2013217 (2003)","journal-title":"Math. Program."},{"key":"9261_CR31","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1137\/080724265","volume":"1","author":"Y Wang","year":"2008","unstructured":"Wang, Y., Yang, J., Yin, W., Zhang, Y.: A new alternating minimization algorithm for total variation image reconstruction. SIAM J. Imag. Sci. 1, 248\u2013272 (2008)","journal-title":"SIAM J. Imag. Sci."},{"key":"9261_CR32","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s12532-010-0017-1","volume":"2","author":"Z Wen","year":"2010","unstructured":"Wen, Z., Goldfard, D. W. Yin: Alternating direction augmented Lagrangian methods for semidefinite programming. Math. Prog. Comp. 2, 203\u2013230 (2010)","journal-title":"Math. Prog. Comp."},{"key":"9261_CR33","unstructured":"Wright, J., Ma, Y., Ganesh, A., Rao, S.: Robust principal component analysis: exact recovery of corrupted low-rank matrices via convex optimization. In: Proceedings of the Conference on Neural Information Processing Systems (NIPS), 2009."},{"key":"9261_CR34","doi-asserted-by":"crossref","unstructured":"Xiao, Y., Jin, Z.F.: An alternative direction method for linear constrained matrix nuclear norm minimization. Numer. Linear Algebra Appl. doi: 10.1002\/nla.783","DOI":"10.1002\/nla.783"},{"key":"9261_CR35","doi-asserted-by":"crossref","unstructured":"Xiao, Y., Song, H.N.: An inexact alternating directions algorithm for constrained total variation regularized compressive sensing problems. J. Math. Imag. Vis. doi: 10.1007\/s10851-011-0314-y","DOI":"10.1007\/s10851-011-0314-y"},{"key":"9261_CR36","unstructured":"Xiao, Y., Yang, J., Yuan, X.M.: Fast algorithms for total variation image reconstruction from random projections. Available at http:\/\/arxiv.org\/abs\/1001.1774v1"},{"key":"9261_CR37","unstructured":"Yang, J., Yuan, X.M.: Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization (submitted)"},{"key":"9261_CR38","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1137\/090777761","volume":"33","author":"J Yang","year":"2011","unstructured":"Yang, J., Zhang, Y.: Alternating direction algorithms for \u21131-problems in compressive sensing. SIAM J. Sci. Comput. 33, 250\u2013278 (2011)","journal-title":"SIAM J. Sci. Comput."},{"key":"9261_CR39","unstructured":"Yuan, X.M., Yang, J.: Sparse and low-rank matrix decomposition via alternating direction methods. Pac. J. Optim. (2011, to appear)"}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-011-9261-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10444-011-9261-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-011-9261-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T07:17:37Z","timestamp":1561015057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10444-011-9261-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,3]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["9261"],"URL":"https:\/\/doi.org\/10.1007\/s10444-011-9261-9","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,3]]}}}