{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:45:27Z","timestamp":1759146327154,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,10,7]],"date-time":"2015-10-07T00:00:00Z","timestamp":1444176000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"crossref","award":["2015A030310298"],"award-info":[{"award-number":["2015A030310298"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["11501219"],"award-info":[{"award-number":["11501219"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["11571120"],"award-info":[{"award-number":["11571120"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Science Foundation of Guangdong Province","award":["2015A030313214"],"award-info":[{"award-number":["2015A030313214"]}]},{"name":"Fundamental Research Funds for the Central Universities(SCUT)"},{"name":"Fundamental Research Funds for the Central University(SCUT)"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s10589-015-9797-6","type":"journal-article","created":{"date-parts":[[2015,10,7]],"date-time":"2015-10-07T01:07:25Z","timestamp":1444180045000},"page":"119-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems"],"prefix":"10.1007","volume":"64","author":[{"given":"Le","family":"Han","sequence":"first","affiliation":[]},{"given":"Shujun","family":"Bi","sequence":"additional","affiliation":[]},{"given":"Shaohua","family":"Pan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,7]]},"reference":[{"key":"9797_CR1","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1214\/12-AOS1000","volume":"40","author":"A Agarwal","year":"2012","unstructured":"Agarwal, A., Negahban, S., Wainwright, M.J.: Noisy matrix decomposition via convex relaxation: optimal rates in high deimensions. Ann. Stat. 40, 1171\u20131197 (2012)","journal-title":"Ann. Stat."},{"key":"9797_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10589-013-9613-0","volume":"58","author":"NS Aybat","year":"2014","unstructured":"Aybat, N.S., Ma, S., Goldfarb, D.: Noisy efficient algorithms for robust and stable principal component pursuit problems. Comput. Optim. Appl. 58, 1\u201329 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"9797_CR3","first-page":"1019","volume":"8","author":"FR Bach","year":"2008","unstructured":"Bach, F.R.: Consistency of trace norm minimization. J. Mach. Learn. Res. 8, 1019\u20131048 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"9797_CR4","unstructured":"Bi, S.J.: Study for multi-stage convex relaxation approach tolow-rank optimization problems, Disertation for ph.D. Degree, South China University of Technology, Guangzhou (2014)"},{"key":"9797_CR5","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s, E.J., Tao, T.: Decoding by linear programming. IEEE Trans. Inf. Theor. 51, 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"9797_CR6","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":"9797_CR7","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":"9797_CR8","doi-asserted-by":"crossref","first-page":"2342","DOI":"10.1109\/TIT.2011.2111771","volume":"57","author":"EJ Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s, E.J., Plain, Y.: Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements. IEEE Trans. Inf. Theory 57, 2342\u20132359 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9797_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.A., Willsky, A.S.: Rank-sparsity incoherence for matrix decomposition. SIAM J. Optim. 21, 572\u2013596 (2011)","journal-title":"SIAM J. Optim."},{"key":"9797_CR10","doi-asserted-by":"crossref","first-page":"5810","DOI":"10.1109\/TSP.2012.2208955","volume":"60","author":"R Chartrand","year":"2012","unstructured":"Chartrand, R.: Nonconvex splitting for regularized low-rank + sparse decomposition. IEEE Trans. Signal Process. 60, 5810\u20135819 (2012)","journal-title":"IEEE Trans. Signal Process."},{"key":"9797_CR11","doi-asserted-by":"crossref","unstructured":"Chen, C.H., He, B.S., Ye, Y.Y., Yuan, X.M.: The directExtension of ADMM for multi-block convex minimization problems isnot necessarily convergent. Math. Progr. Ser. A (2014). doi: 10.1007\/s10107-014-0826-5","DOI":"10.1007\/s10107-014-0826-5"},{"key":"9797_CR12","doi-asserted-by":"crossref","first-page":"4324","DOI":"10.1109\/TIT.2013.2249572","volume":"59","author":"Y Chen","year":"2013","unstructured":"Chen, Y., Jalali, A., Sanghavi, S., Caramanis, C.: Low-rank matrix recovery from errors and erasures. IEEE Trans. Inf. Theory 59, 4324\u20134337 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9797_CR13","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1002\/cpa.20132","volume":"59","author":"D Donoho","year":"2006","unstructured":"Donoho, D.: For most large underdetermined systems of linear equations the minimal l1-norm solution is also the sparest solution. Commun. Pure Appl. Math. 59, 797\u2013829 (2006)","journal-title":"Commun. Pure Appl. Math."},{"key":"9797_CR14","unstructured":"Fazel, M.: Matrix Rank Minimization with Applications, Disertation for ph.D. Degree, StanfordUniversity, California (2002)"},{"key":"9797_CR15","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/34.927464","volume":"23","author":"A Georghiades","year":"2001","unstructured":"Georghiades, A., Belhumeur, P., Kriegman, D.: From few to many: illumination cone models for face recognition under variable lighting and pose. IEEE Trans. Pattern Anal. Mach. Intell. 23, 643\u2013660 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9797_CR16","doi-asserted-by":"crossref","unstructured":"Golbabaee, M., Vandergheynst, P.: Hyperspectral image compressed sensing via low-rank and joint sparse matrix recovery. In: Proceedings of IEEE International Conference on on Acoustics, Speech and Signal Processing, Kyota, pp. 2741\u20132744 (2011)","DOI":"10.1109\/ICASSP.2012.6288484"},{"key":"9797_CR17","first-page":"57","volume":"22","author":"BS He","year":"2012","unstructured":"He, B.S., Tao, M., Yuan, X.: Alternating direction method with Gaussian back substitution for separable convex programming. SIAM J. Optim. 22, 57\u201381 (2012)","journal-title":"SIAM J. Optim."},{"key":"9797_CR18","doi-asserted-by":"crossref","unstructured":"He, R., Sun, Z., Tan, T., Zheng, W.S.: Recovery of corrupted low-rank matrices via half-quadratic based nonconvex minimization. In: Proceedings of IEEE International Coference on Computer Vision and Pattern Recognation, Providence, RI, pp. 2889\u20132896 (2011)","DOI":"10.1109\/CVPR.2011.5995328"},{"key":"9797_CR19","doi-asserted-by":"crossref","first-page":"7221","DOI":"10.1109\/TIT.2011.2158250","volume":"57","author":"D Hsu","year":"2011","unstructured":"Hsu, D., Kakade, S.M., Zhang, T.: Robust matrix decomposition with sparse corruptions. IEEE Trans. Inf. Theory 57, 7221\u20137234 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9797_CR20","doi-asserted-by":"crossref","first-page":"1340010","DOI":"10.1142\/S0217595913400101","volume":"30","author":"L Kong","year":"2013","unstructured":"Kong, L., Xiu, N.H.: Exact low-rank matrix recovery via nonconvex schatten p-minimization. Asia-Pac. J. Op. Res. 30, 1340010 (2013)","journal-title":"Asia-Pac. J. Op. Res."},{"key":"9797_CR21","first-page":"927","volume":"5","author":"MJ Lai","year":"2013","unstructured":"Lai, M.J., Xu, Y., Yin, W.: Improved iteratively reweighted least squares for unconstrained smoothed $$l_q$$ l q minimization. SIAM J. Numer. Anal. 5, 927\u2013957 (2013)","journal-title":"SIAM J. Numer. Anal."},{"key":"9797_CR22","first-page":"173","volume":"2","author":"AS Lewis","year":"1995","unstructured":"Lewis, A.S.: The convex analysis of unitarily invariant matrix functions. J. Convex Anal. 2, 173\u2013183 (1995)","journal-title":"J. Convex Anal."},{"key":"9797_CR23","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1109\/TIP.2004.836169","volume":"13","author":"L Li","year":"2004","unstructured":"Li, L., Huang, W., Gu, I.Y., Qi, T.: Statistical modeling of complex backgrounds for foreground object detection. IEEE Trans. Image Process. 13, 1459\u20131472 (2004)","journal-title":"IEEE Trans. Image Process."},{"key":"9797_CR24","doi-asserted-by":"crossref","first-page":"1123","DOI":"10.1214\/11-EJS636","volume":"2","author":"M McCoy","year":"2011","unstructured":"McCoy, M., Tropp, J.: Two proposals for robust PCA using semidefinite programming. Electr. J. Stat. 2, 1123\u20131160 (2011)","journal-title":"Electr. J. Stat."},{"key":"9797_CR25","unstructured":"Miao, W.M.: Matrix completion model with fixed basiscoefficients and rank regularized problems with hard constraints, Disertation for ph.D. Degree. NationalUniversity of Singapore, Singapore (2013)"},{"key":"9797_CR26","first-page":"1665","volume":"13","author":"S Negahban","year":"2012","unstructured":"Negahban, S., Wainwright, M.J.: Restricted strong convexity and weighted matrix completion: Optimal bounds with noise. J. Mach. Learn. Res. 13, 1665\u20131697 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"9797_CR27","doi-asserted-by":"crossref","first-page":"2233","DOI":"10.1109\/TPAMI.2011.282","volume":"34","author":"Y Peng","year":"2012","unstructured":"Peng, Y., Ganesh, A., Wright, J., Ma, Y.: RASL: Robust alignment via sparse and low-rank decomposition for linearly correlated images. IEEE Trans. Pattern Anal. Mach. Intell. 34, 2233\u20132246 (2012)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9797_CR28","first-page":"733","volume":"6","author":"G Rao","year":"2013","unstructured":"Rao, G., Peng, Y., Xun, Z.B.: The robust low-rank and sparse matrix decomposition based on $$S_{1\/2}$$ S 1 \/ 2 modeling. Sci China: Inf. Sci. 6, 733\u2013748 (2013). (in Chinese)","journal-title":"Sci China: Inf. Sci."},{"key":"9797_CR29","first-page":"2241","volume":"11","author":"G Raskutti","year":"2010","unstructured":"Raskutti, G., Wainwright, M.J., Yu, B.: Restricted eigenvalue properties for correlated Gaussian designs. J. Mach. Learn. Res. 11, 2241\u20132259 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"9797_CR30","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.: Guaranteed minimum rank solutions of matrix equations via nuclear norm minimization. SIAM Rev. 52, 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"key":"9797_CR31","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"9797_CR32","doi-asserted-by":"crossref","unstructured":"Shu, X., Ahuja, N.: Imaging via three-dimensional compressive sampling (3DCS). In: Proceedings of IEEE International Conference on Computer Vision, pp. 439\u2013436 (2011)","DOI":"10.1109\/ICCV.2011.6126273"},{"key":"9797_CR33","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 obervations. SIAM J. Optim. 21, 57\u201381 (2011)","journal-title":"SIAM J. Optim."},{"key":"9797_CR34","unstructured":"Waters, A., Sankaranarayanan, A., Baraniuk, R.: Sparcs: recovering low-rank and sparse matrices from compressive measurements. In: Proceedings of Neural Information Processing Systems, Granada, Spain, pp. 1\u20139 (2011)"},{"key":"9797_CR35","doi-asserted-by":"crossref","unstructured":"Wright, J., Ganesh, A., Min, K., Ma, Y.: Compressive principal component pursuit. In: Proceedings of IEEE International Symposium on Information Theory, pp. 1276\u20131280 (2012)","DOI":"10.1109\/ISIT.2012.6283062"},{"key":"9797_CR36","doi-asserted-by":"crossref","first-page":"3047","DOI":"10.1109\/TIT.2011.2173156","volume":"58","author":"H Xu","year":"2012","unstructured":"Xu, H., Sanghavi, S., Caramanis, C.: Robust PCA via outlier pursuit. IEEE Trans. Inf. Theory 58, 3047\u20133064 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9797_CR37","doi-asserted-by":"crossref","first-page":"2109","DOI":"10.1214\/08-AOS659","volume":"37","author":"T Zhang","year":"2009","unstructured":"Zhang, T.: Some sharp performance bounds for least squares regression with $$L_1$$ L 1 reguarization. Ann. Stat. 37, 2109\u20132144 (2009)","journal-title":"Ann. Stat."},{"key":"9797_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11263-012-0515-x","volume":"99","author":"Z Zhang","year":"2012","unstructured":"Zhang, Z., Ganesh, A., Liang, X., Ma, Y.: TILT: transform-invariant low-rank textures. Int. J. Comput. Vis. 99, 1\u201324 (2012)","journal-title":"Int. J. Comput. Vis."},{"key":"9797_CR39","doi-asserted-by":"crossref","unstructured":"Zhou, Z., Li, X., Wright, J., Cand\u00e9s, E., Ma, Y.: Stable principal component pursuit. In: Proceedings of IEEE International Symposium on Information Theory, Austin, TX, pp. 1518\u20131522 (2010)","DOI":"10.1109\/ISIT.2010.5513535"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9797-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-015-9797-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9797-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,15]],"date-time":"2020-05-15T23:24:51Z","timestamp":1589585091000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-015-9797-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,7]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["9797"],"URL":"https:\/\/doi.org\/10.1007\/s10589-015-9797-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2015,10,7]]}}}