{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T17:49:10Z","timestamp":1762624150095,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T00:00:00Z","timestamp":1551916800000},"content-version":"tdm","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":["11431002"],"award-info":[{"award-number":["11431002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["18lgpy70"],"award-info":[{"award-number":["18lgpy70"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871051"],"award-info":[{"award-number":["11871051"]}],"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":[[2019,6]]},"DOI":"10.1007\/s10589-019-00084-y","type":"journal-article","created":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T11:28:25Z","timestamp":1551958105000},"page":"453-476","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A singular value p-shrinkage thresholding algorithm for low rank matrix recovery"],"prefix":"10.1007","volume":"73","author":[{"given":"Yu-Fan","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3826-1102","authenticated-orcid":false,"given":"Kun","family":"Shang","sequence":"additional","affiliation":[]},{"given":"Zheng-Hai","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,7]]},"reference":[{"issue":"3","key":"84_CR1","doi-asserted-by":"publisher","first-page":"1718","DOI":"10.1137\/120864908","volume":"23","author":"W Bian","year":"2013","unstructured":"Bian, W., Chen, X.: Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization. SIAM J. Optim. 23(3), 1718\u20131741 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"84_CR2","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10107-014-0753-5","volume":"149","author":"W Bian","year":"2015","unstructured":"Bian, W., Chen, X., Ye, Y.: Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization. Math. Program. 149(1\u20132), 301\u2013327 (2015)","journal-title":"Math. Program."},{"doi-asserted-by":"crossref","unstructured":"Bertalmio, M., Sapiro, G., Caselles, V., Ballester, C.: Image Inpainting. ACM SIGGRAPH, pp. 417\u2013424 (2000)","key":"84_CR3","DOI":"10.1145\/344779.344972"},{"issue":"10","key":"84_CR4","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1109\/LSP.2007.898300","volume":"14","author":"R Chartrand","year":"2007","unstructured":"Chartrand, R.: Exact reconstruction of sparse signals via nonconvex minimization. IEEE Signal Process. Lett. 14(10), 707\u2013710 (2007)","journal-title":"IEEE Signal Process. Lett."},{"doi-asserted-by":"crossref","unstructured":"Chartrand, R.: Fast algorithms for nonconvex compressive sensing: MRI reconstruction from very few data. In: IEEE International Symposium on Biomedical Imaging: From Nano to Macro (ISBI), pp. 262\u2013265 (2009)","key":"84_CR5","DOI":"10.1109\/ISBI.2009.5193034"},{"key":"84_CR6","doi-asserted-by":"publisher","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."},{"doi-asserted-by":"crossref","unstructured":"Chartrand, R.: Shrinkage mappings and their induced penalty functions. In: International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 1026\u20131029 (2014)","key":"84_CR7","DOI":"10.1109\/ICASSP.2014.6853752"},{"issue":"4","key":"84_CR8","doi-asserted-by":"publisher","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(4), 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"doi-asserted-by":"crossref","unstructured":"Chartrand, R., Wohlberg, B.: A nonconvex ADMM algorithm for group sparsity with sparse groups. In: International Conference on Acoustics, Speech and Signal Processing (2013)","key":"84_CR9","DOI":"10.1109\/ICASSP.2013.6638818"},{"issue":"6","key":"84_CR10","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Candes","year":"2009","unstructured":"Candes, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9(6), 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"issue":"5","key":"84_CR11","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"EJ Candes","year":"2009","unstructured":"Candes, E.J., Tao, T.: The power of convex relaxation: near-optimal matrix completion. IEEE Trans. Inf. Theory 56(5), 2053\u20132080 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"84_CR12","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I Daubechies","year":"2004","unstructured":"Daubechies, I., Defrise, M., Mol, C.D.: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Commun. Pure Appl. Math. 57(11), 1413\u20131457 (2004)","journal-title":"Commun. Pure Appl. Math."},{"unstructured":"Fazel, M.: Matrix rank minimization with applications. PhD thesis, Stanford University (2002)","key":"84_CR13"},{"issue":"3","key":"84_CR14","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1016\/j.ijforecast.2012.05.001","volume":"28","author":"JH Friedman","year":"2012","unstructured":"Friedman, J.H.: Fast sparse regression and classification. Int. J. Forecast. 28(3), 722\u2013738 (2012)","journal-title":"Int. J. Forecast."},{"issue":"456","key":"84_CR15","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96(456), 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"issue":"2","key":"84_CR16","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s11263-016-0930-5","volume":"121","author":"S Gu","year":"2017","unstructured":"Gu, S., Xie, Q., Meng, D., Zuo, W., Feng, X., Zhang, L.: Weighted nuclear norm minimization and its applications to low level vision. Int. J. Comput. Vis. 121(2), 183\u2013208 (2017)","journal-title":"Int. J. Comput. Vis."},{"issue":"2","key":"84_CR17","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/090771806","volume":"53","author":"N Halko","year":"2011","unstructured":"Halko, N., Martinsson, P.G., Tropp, J.A.: Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions. SIAM Rev. 53(2), 217\u2013288 (2011)","journal-title":"SIAM Rev."},{"issue":"2","key":"84_CR18","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/s10915-015-0045-0","volume":"66","author":"Z-F Jin","year":"2016","unstructured":"Jin, Z.-F., Wan, Z., Jiao, Y., Lu, X.: An alternating direction method with continuation for nonconvex low rank minimization. J. Sci. Comput. 66(2), 849\u2013869 (2016)","journal-title":"J. Sci. Comput."},{"issue":"7","key":"84_CR19","doi-asserted-by":"publisher","first-page":"2262","DOI":"10.1109\/TIP.2007.903263","volume":"16","author":"T Korah","year":"2007","unstructured":"Korah, T., Rasmussen, C.: Spatio-temporal inpainting for recovering texture maps of occluded building facades. IEEE Trans. Image Process. 16(7), 2262\u20132271 (2007)","journal-title":"IEEE Trans. Image Process."},{"unstructured":"Kong, L., Tuncel, L., Xiu, N.: Sufficient conditions for low-rank matrix recovery, translated from sparse signal recovery (2011). arXiv preprint \n                    arXiv:1106.3276","key":"84_CR20"},{"issue":"03","key":"84_CR21","doi-asserted-by":"publisher","first-page":"1340010","DOI":"10.1142\/S0217595913400101","volume":"30","author":"L Kong","year":"2013","unstructured":"Kong, L., Xiu, N.: Exact low-rank matrix recovery via nonconvex schatten \n                    \n                      \n                    \n                    $$p$$\n                    \n                      \n                        p\n                      \n                    \n                  -minimization. Asia-Pac. J. Oper. Res. 30(03), 1340010 (2013)","journal-title":"Asia-Pac. J. Oper. Res."},{"issue":"2","key":"84_CR22","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/110840364","volume":"51","author":"MJ Lai","year":"2013","unstructured":"Lai, M.J., Xu, Y., Yin, W.: Improved iteratively reweighted least squares for unconstrained smoothed \n                    \n                      \n                    \n                    $$l_q$$\n                    \n                      \n                        \n                          l\n                          q\n                        \n                      \n                    \n                   minimization. SIAM J. Numer. Anal. 51(2), 927\u2013957 (2013)","journal-title":"SIAM J. Numer. Anal."},{"key":"84_CR23","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.cam.2013.12.005","volume":"263","author":"Y-F Li","year":"2014","unstructured":"Li, Y.-F., Zhang, Y.-J., Huang, Z.-H.: A reweighted nuclear norm minimization algorithm for low rank matrix recovery. J. Comput. Appl. Math. 263, 338\u2013350 (2014)","journal-title":"J. Comput. Appl. Math."},{"issue":"4","key":"84_CR24","first-page":"1","volume":"30","author":"Y Lu","year":"2014","unstructured":"Lu, Y., Zhang, L., Wu, J.: A smoothing majorization method for matrix minimization. Optim. Methods Softw. 30(4), 1\u201324 (2014)","journal-title":"Optim. Methods Softw."},{"key":"84_CR25","first-page":"2897","volume":"255","author":"J-J Moreau","year":"1962","unstructured":"Moreau, J.-J.: Functions convexes duales et points proximaux dans un espace hilbertien. C. R. \u00c1cad. Sci. Paris 255, 2897\u20132899 (1962)","journal-title":"C. R. \u00c1cad. Sci. Paris"},{"issue":"1\u20132","key":"84_CR26","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(1\u20132), 321\u2013353 (2011)","journal-title":"Math. Program."},{"issue":"11","key":"84_CR27","doi-asserted-by":"publisher","first-page":"5714","DOI":"10.1109\/TSP.2012.2212015","volume":"60","author":"G Marjanovic","year":"2012","unstructured":"Marjanovic, G., Solo, V.: On \n                    \n                      \n                    \n                    $$l_p$$\n                    \n                      \n                        \n                          l\n                          p\n                        \n                      \n                    \n                   optimization and matrix completion. IEEE Trans. Signal Process. 60(11), 5714\u20135724 (2012)","journal-title":"IEEE Trans. Signal Process."},{"doi-asserted-by":"crossref","unstructured":"Majumdar, A., Ward, R.K., Aboulnasr, T.: A FOCUSS based method for low rank matrix recovery. In: Proceedings of \n                    \n                      \n                    \n                    $$19$$\n                    \n                      \n                        \n                          19\n                        \n                      \n                    \n                  th IEEE International Conference on Image Processing (ICIP), pp. 1713\u20131716 (2012)","key":"84_CR28","DOI":"10.1109\/ICIP.2012.6467209"},{"issue":"1","key":"84_CR29","first-page":"3441","volume":"13","author":"K Mohan","year":"2012","unstructured":"Mohan, K., Fazel, M.: Iterative reweighted algorithms for matrix rank minimization. J. Mach. Learn. Res. 13(1), 3441\u20133473 (2012)","journal-title":"J. Mach. Learn. Res."},{"unstructured":"Oymak, S., Hassibi, B.: New null space results and recovery thresholds for matrix rank minimization (2010). arXiv preprint, \n                    arXiv:1011.6326","key":"84_CR30"},{"doi-asserted-by":"crossref","unstructured":"Oymak, S., Mohan, K., Fazel, M., Hassibi, B.: A simplified approach to recovery conditions for low rank matrices. In: Proceedings of IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 2318\u20132322 (2011)","key":"84_CR31","DOI":"10.1109\/ISIT.2011.6033976"},{"unstructured":"Peng, D., Xiu, N., Yu, J.: \n                    \n                      \n                    \n                    $$S_{\\frac{1}{2}}$$\n                    \n                      \n                        \n                          S\n                          \n                            1\n                            2\n                          \n                        \n                      \n                    \n                   regularization methods and fixed point algorithms for affine rank minimization problems. Optim. Online (2013)","key":"84_CR32"},{"issue":"3","key":"84_CR33","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52(3), 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"doi-asserted-by":"crossref","unstructured":"Recht, B., Xu, W., Hassibi, B.: Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization. In: Proceedings of \n                    \n                      \n                    \n                    $$47$$\n                    \n                      \n                        \n                          47\n                        \n                      \n                    \n                  -th IEEE Conference on Decision and Control (CDC), pp. 3065\u20133070 (2008)","key":"84_CR34","DOI":"10.1109\/CDC.2008.4739332"},{"issue":"1","key":"84_CR35","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10107-010-0422-2","volume":"127","author":"B Recht","year":"2011","unstructured":"Recht, B., Xu, W., Hassibi, B.: Null space conditions and thresholds for rank minimization. Math. Program. 127(1), 175\u2013202 (2011)","journal-title":"Math. Program."},{"issue":"15","key":"84_CR36","first-page":"615","volume":"6","author":"KC Toh","year":"2010","unstructured":"Toh, K.C., Yun, S.: An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems. Pac. J. Optim. 6(15), 615\u2013640 (2010)","journal-title":"Pac. J. Optim."},{"doi-asserted-by":"crossref","unstructured":"Voronin, S., Chartrand, R.: A new generalized thresholding algorithm for inverse problems with sparsity constraints. In: IEEE International Conference on Acoustics, Speech, and Signal Processing (2013)","key":"84_CR37","DOI":"10.1109\/ICASSP.2013.6637929"},{"issue":"4","key":"84_CR38","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1109\/TIP.2003.819861","volume":"13","author":"Z Wang","year":"2004","unstructured":"Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE Trans. Image Process. 13(4), 600\u2013612 (2004)","journal-title":"IEEE Trans. Image Process."},{"key":"84_CR39","doi-asserted-by":"publisher","first-page":"075004","DOI":"10.1088\/0266-5611\/32\/7\/075004","volume":"32","author":"J Woodworth","year":"2016","unstructured":"Woodworth, J., Chartrand, R.: Compressed sensing recovery via nonconvex shrinkage penalties. Inverse Probl. 32, 075004 (2016)","journal-title":"Inverse Probl."},{"issue":"4","key":"84_CR40","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(4), 333\u2013361 (2012)","journal-title":"Math. Program. Comput."},{"issue":"7","key":"84_CR41","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","volume":"23","author":"Z Xu","year":"2012","unstructured":"Xu, Z., Chang, X., Xu, F., Zhang, H.: \n                    \n                      \n                    \n                    $$L_{1\/2}$$\n                    \n                      \n                        \n                          L\n                          \n                            1\n                            \/\n                            2\n                          \n                        \n                      \n                    \n                   regularization: a thresholding representation theory and a fast solver. IEEE Trans. Neural Netw. Learn. Syst. 23(7), 1013\u20131027 (2012)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"84_CR42","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/j.acha.2015.06.006","volume":"40","author":"M-C Yue","year":"2016","unstructured":"Yue, M.-C., So, A.M.-C.: A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery. Appl. Comput. Harmon. Anal. 40, 396\u2013416 (2016)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"84_CR43","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"CH Zhang","year":"2010","unstructured":"Zhang, C.H.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38, 894\u2013942 (2010)","journal-title":"Ann. Stat."},{"issue":"7","key":"84_CR44","doi-asserted-by":"publisher","first-page":"4316","DOI":"10.1109\/TIT.2013.2250577","volume":"59","author":"M Zhang","year":"2013","unstructured":"Zhang, M., Huang, Z.-H., Zhang, Y.: Restricted-isometry properties of nonconvex matrix recovery. IEEE Trans. Inf. Theory 59(7), 4316\u20134323 (2013)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00084-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00084-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00084-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T00:09:00Z","timestamp":1583453340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00084-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,7]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["84"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00084-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2019,3,7]]},"assertion":[{"value":"18 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}