{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T15:24:05Z","timestamp":1784301845588,"version":"3.55.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,1,9]],"date-time":"2022-01-09T00:00:00Z","timestamp":1641686400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,9]],"date-time":"2022-01-09T00:00:00Z","timestamp":1641686400000},"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":["11871369"],"award-info":[{"award-number":["11871369"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100019062","name":"Tianjin Research Innovation Project for Postgraduate Students","doi-asserted-by":"crossref","award":["2020YJSS140"],"award-info":[{"award-number":["2020YJSS140"]}],"id":[{"id":"10.13039\/501100019062","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s10589-021-00337-9","type":"journal-article","created":{"date-parts":[[2022,1,9]],"date-time":"2022-01-09T00:03:33Z","timestamp":1641686613000},"page":"519-538","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A smoothing proximal gradient algorithm for matrix rank minimization problem"],"prefix":"10.1007","volume":"81","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8051-7477","authenticated-orcid":false,"given":"Quan","family":"Yu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinzhen","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,1,9]]},"reference":[{"key":"337_CR1","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1137\/18M1186009","volume":"58","author":"W Bian","year":"2020","unstructured":"Bian, W., Chen, X.: A smoothing proximal gradient algorithm for nonsmooth convex regression with cardinality penalty. SIAM J. Numer. Anal. 58, 858\u2013883 (2020)","journal-title":"SIAM J. Numer. Anal."},{"key":"337_CR2","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.cviu.2013.11.009","volume":"122","author":"T Bouwmans","year":"2014","unstructured":"Bouwmans, T., Zahzah, E.: Robust PCA via principal component pursuit: a review for a comparative evaluation in video surveillance. Comput. Vis. Image Underst. 122, 22\u201334 (2014)","journal-title":"Comput. Vis. Image Underst."},{"key":"337_CR3","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J Cai","year":"2008","unstructured":"Cai, J., Candes, E., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20, 1956\u20131982 (2008)","journal-title":"SIAM J. Optim."},{"key":"337_CR4","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"E Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9, 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"key":"337_CR5","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"E Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E., Tao, T.: The power of convex relaxation: near-optimal matrix completion. IEEE Trans. Inf. Theory 56, 2053\u20132080 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"337_CR6","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.neunet.2016.09.005","volume":"85","author":"F Cao","year":"2017","unstructured":"Cao, F., Chen, J., Ye, H., Zhao, J., Zhou, Z.: Recovering low-rank and sparse matrix based on the truncated nuclear norm. Neural Netw. 85, 10\u201320 (2017)","journal-title":"Neural Netw."},{"key":"337_CR7","doi-asserted-by":"crossref","unstructured":"Clarke, F.: Optimization and nonsmooth analysis. Society for Industrial and Applied Mathematics (1990)","DOI":"10.1137\/1.9781611971309"},{"key":"337_CR8","doi-asserted-by":"publisher","first-page":"4734","DOI":"10.1109\/ACC.2001.945730","volume":"6","author":"M Fazel","year":"2001","unstructured":"Fazel, M., Hindi, H., Boyd, S.: A rank minimization heuristic with application to minimum order system approximation. Proc. Am. Control Conf. 6, 4734\u20134739 (2001)","journal-title":"Proc. Am. Control Conf."},{"key":"337_CR9","doi-asserted-by":"publisher","first-page":"1614","DOI":"10.1137\/100811404","volume":"21","author":"M Fornasier","year":"2011","unstructured":"Fornasier, M., Rauhut, H., Ward, R.: Low-rank matrix recovery via iteratively reweighted least squares minimization. SIAM J. Optim. 21, 1614\u20131640 (2011)","journal-title":"SIAM J. Optim."},{"key":"337_CR10","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1109\/LSP.2009.2018223","volume":"16","author":"J Haldar","year":"2009","unstructured":"Haldar, J., Hernando, D.: Rank-constrained solutions to linear matrix equations using powerfactorization. IEEE Signal Process. Lett. 16, 584\u2013587 (2009)","journal-title":"IEEE Signal Process. Lett."},{"key":"337_CR11","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/TSP.2019.2952057","volume":"68","author":"Y He","year":"2020","unstructured":"He, Y., Wang, F., Li, Y., Qin, J., Chen, B.: Robust matrix completion via maximum correntropy criterion and half-quadratic optimization. IEEE Trans. Signal Process. 68, 181\u2013195 (2020)","journal-title":"IEEE Trans. Signal Process."},{"key":"337_CR12","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/110840364","volume":"51","author":"M Lai","year":"2013","unstructured":"Lai, M., Xu, Y., Yin, W.: Improved iteratively reweighted least squares for unconstrained smoothed $$\\ell _q$$ minimization. SIAM J. Numer. Anal. 51, 927\u2013957 (2013)","journal-title":"SIAM J. Numer. Anal."},{"key":"337_CR13","doi-asserted-by":"publisher","first-page":"4145","DOI":"10.1109\/TIP.2016.2585047","volume":"25","author":"C Lee","year":"2016","unstructured":"Lee, C., Lam, E.: Computationally efficient truncated nuclear norm minimization for high dynamic range imaging. IEEE Trans. Image Process. 25, 4145\u20134157 (2016)","journal-title":"IEEE Trans. Image Process."},{"key":"337_CR14","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s11228-004-7198-6","volume":"13","author":"A Lewis","year":"2005","unstructured":"Lewis, A., Sendov, H.: Nonsmooth analysis of singular values. Part II: applications. Set-Valued Anal. 13, 243\u2013264 (2005)","journal-title":"Set-Valued Anal."},{"key":"337_CR15","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1080\/10556788.2014.936438","volume":"30","author":"Z Lu","year":"2015","unstructured":"Lu, Z., Zhang, Y., Li, X.: Penalty decomposition methods for rank minimization. Optim. Methods Softw. 30, 531\u2013558 (2015)","journal-title":"Optim. Methods Softw."},{"key":"337_CR16","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/s10589-017-9933-6","volume":"68","author":"Z Lu","year":"2017","unstructured":"Lu, Z., Zhang, Y., Lu, J.: $$l_p$$ Regularized low-rank approximation via iterative reweighted singular value minimization. Comput. Optim. Appl. 68, 619\u2013642 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"337_CR17","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10107-009-0306-5","volume":"128","author":"S Ma","year":"2011","unstructured":"Ma, S., Goldfarb, D., Chen, L.: Fixed point and Bregman iterative methods for matrix rank minimization. Math. Program. 128, 321\u2013353 (2011)","journal-title":"Math. Program."},{"key":"337_CR18","doi-asserted-by":"publisher","first-page":"1346","DOI":"10.1137\/16M1098929","volume":"10","author":"T Ma","year":"2017","unstructured":"Ma, T., Lou, Y., Huang, T.: Truncated $$l_{1-2}$$ models for sparse recovery and rank minimization. SIAM J. Imag. Sci. 10, 1346\u20131380 (2017)","journal-title":"SIAM J. Imag. Sci."},{"key":"337_CR19","unstructured":"Meng, D., Xu, Z., Zhang, L., and Zhao, J.: A cyclic weighted median method for L1 low-rank matrix factorization with missing entries. In: Seventh AAAI Conference on Artificial Intelligence (2013), pp. 704\u2013710"},{"key":"337_CR20","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer, Berlin (2006)"},{"key":"337_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/19M1304799","volume":"14","author":"L Pan","year":"2021","unstructured":"Pan, L., Chen, X.: Group sparse optimization for images recovery using capped folded concave functions. SIAM J. Imag. Sci. 14, 1\u201325 (2021)","journal-title":"SIAM J. Imag. Sci."},{"key":"337_CR22","doi-asserted-by":"crossref","unstructured":"Peng, C., Kang, Z., Cheng, Q.: A fast factorization-based approach to robust PCA. In: 2016 IEEE 16th International Conference on Data Mining, (2016) pp. 1137\u20131142","DOI":"10.1109\/ICDM.2016.0149"},{"key":"337_CR23","doi-asserted-by":"publisher","first-page":"3159","DOI":"10.1109\/TCSVT.2018.2878803","volume":"29","author":"X Su","year":"2019","unstructured":"Su, X., Wang, Y., Kang, X., Tao, R.: Nonconvex truncated nuclear norm minimization based on adaptive bisection method. IEEE Trans. Circuits Syst. Video Technol. 29, 3159\u20133172 (2019)","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"key":"337_CR24","first-page":"126","volume":"2012","author":"N Wang","year":"2012","unstructured":"Wang, N., Yao, T., Wang, J., Yeung, D.: A probabilistic approach to robust matrix factorization. Comput. Vis. ECCV 2012, 126\u2013139 (2012)","journal-title":"Comput. Vis. ECCV"},{"key":"337_CR25","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s12532-012-0044-1","volume":"4","author":"Z Wen","year":"2012","unstructured":"Wen, Z., Yin, W., Zhang, Y.: Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm. Math. Program. Comput. 4, 333\u2013361 (2012)","journal-title":"Math. Program. Comput."},{"key":"337_CR26","doi-asserted-by":"publisher","first-page":"3047","DOI":"10.1109\/TIT.2011.2173156","volume":"58","author":"H Xu","year":"2012","unstructured":"Xu, H., Caramanis, C., Sanghavi, S.: Robust PCA via outlier pursuit. IEEE Trans. Inf. Theory 58, 3047\u20133064 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"337_CR27","doi-asserted-by":"publisher","first-page":"1125","DOI":"10.1109\/TSP.2017.2784361","volume":"66","author":"W Zeng","year":"2018","unstructured":"Zeng, W., So, H.: Outlier-robust matrix completion via $$l_p$$-minimization. IEEE Trans. Signal Process. 66, 1125\u20131140 (2018)","journal-title":"IEEE Trans. Signal Process."},{"key":"337_CR28","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1109\/TNNLS.2014.2387376","volume":"26","author":"Q Zhao","year":"2015","unstructured":"Zhao, Q., Meng, D., Xu, Z., Zuo, W., Yan, Y.: $$L_{1}$$-norm low-rank matrix factorization by variational bayesian method. IEEE Trans. Neural Netw. Learn.Syst. 26, 825\u2013839 (2015)","journal-title":"IEEE Trans. Neural Netw. Learn.Syst."},{"key":"337_CR29","doi-asserted-by":"crossref","unstructured":"Zheng, Y., Liu, G., Sugimoto, S., Yan, S., Okutomi, M.: Practical low-rank matrix approximation under robust L1-norm. In: 2012 IEEE Conference on Computer Vision and Pattern Recognition, pp. 1410\u20131417 (2012)","DOI":"10.1109\/CVPR.2012.6247828"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00337-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-021-00337-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00337-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T22:33:06Z","timestamp":1726439586000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-021-00337-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,9]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["337"],"URL":"https:\/\/doi.org\/10.1007\/s10589-021-00337-9","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,9]]},"assertion":[{"value":"18 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}