{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T02:10:42Z","timestamp":1773281442923,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T00:00:00Z","timestamp":1769472000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T00:00:00Z","timestamp":1769472000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["No. 2021YFA1000300"],"award-info":[{"award-number":["No. 2021YFA1000300"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["No.2021YFA1000301"],"award-info":[{"award-number":["No.2021YFA1000301"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.92473208"],"award-info":[{"award-number":["No.92473208"]}],"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":["No.12571323"],"award-info":[{"award-number":["No.12571323"]}],"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":[[2026,4]]},"DOI":"10.1007\/s10589-026-00766-4","type":"journal-article","created":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T07:52:50Z","timestamp":1769500370000},"page":"1107-1143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["New restricted isometry properties of constrained and unconstrained $$L_{*-F}$$ minimization for low-rank approximation"],"prefix":"10.1007","volume":"93","author":[{"given":"Yan","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6932-9512","authenticated-orcid":false,"given":"Yu-Hong","family":"Dai","sequence":"additional","affiliation":[]},{"given":"Liping","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,27]]},"reference":[{"issue":"6","key":"766_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1145\/2184319.2184343","volume":"55","author":"E Candes","year":"2012","unstructured":"Candes, E., Recht, B.: Exact matrix completion via convex optimization. Commun. ACM 55(6), 111\u2013119 (2012)","journal-title":"Commun. ACM"},{"issue":"5","key":"766_CR2","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"EJ Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E.J., Tao, T.: The power of convex relaxation: Near-optimal matrix completion. IEEE Trans. Inf. Theory 56(5), 2053\u20132080 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"766_CR3","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1109\/TNNLS.2018.2844242","volume":"30","author":"X Chang","year":"2018","unstructured":"Chang, X., Zhong, Y., Wang, Y., Lin, S.: Unified low-rank matrix estimate via penalized matrix least squares approximation. IEEE Transactions on Neural Networks and Learning Systems 30(2), 474\u2013485 (2018)","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"issue":"3","key":"766_CR4","doi-asserted-by":"publisher","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(3), 1\u201337 (2011)","journal-title":"J. ACM"},{"issue":"21","key":"766_CR5","doi-asserted-by":"publisher","first-page":"9795","DOI":"10.1073\/pnas.90.21.9795","volume":"90","author":"C Tomasi","year":"1993","unstructured":"Tomasi, C., Kanade, T.: Shape and motion from image streams: a factorization method. Proc. Natl. Acad. Sci. 90(21), 9795\u20139802 (1993)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"766_CR6","doi-asserted-by":"crossref","unstructured":"Meka, R., Jain, P., Caramanis, C., Dhillon, I.S.: Rank minimization via online learning. In: Proceedings of the International Conference on Machine Learning, pp. 656\u2013663 (2008)","DOI":"10.1145\/1390156.1390239"},{"issue":"3","key":"766_CR7","doi-asserted-by":"publisher","first-page":"1346","DOI":"10.1137\/16M1098929","volume":"10","author":"T-H Ma","year":"2017","unstructured":"Ma, T.-H., Lou, Y., Huang, T.-Z.: Truncated $$\\ell _{1-2}$$ models for sparse recovery and rank minimization. SIAM J. Imag. Sci. 10(3), 1346\u20131380 (2017)","journal-title":"SIAM J. Imag. Sci."},{"key":"766_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.acha.2021.03.001","volume":"54","author":"W Wang","year":"2021","unstructured":"Wang, W., Zhang, F., Wang, J.: Low-rank matrix recovery via regularized nuclear norm minimization. Appl. Comput. Harmon. Anal. 54, 1\u201319 (2021)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"766_CR9","doi-asserted-by":"crossref","unstructured":"Wang, Y., Yao, Q., Kwok, J.: A scalable, adaptive and sound nonconvex regularizer for low-rank matrix learning. In: Proceedings of the Web Conference, pp. 1798\u20131808 (2021)","DOI":"10.1145\/3442381.3450142"},{"key":"766_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2023.108959","volume":"207","author":"Y Shan","year":"2023","unstructured":"Shan, Y., Hu, D., Wang, Z., Jia, T.: Multi-channel nuclear norm minus Frobenius norm minimization for color image denoising. Signal Process. 207, 108959 (2023)","journal-title":"Signal Process."},{"key":"766_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2024.110986","volume":"158","author":"Y Guo","year":"2025","unstructured":"Guo, Y., Chen, G., Zeng, T., Jin, Q., Ng, M.K.-P.: Quaternion nuclear norm minus Frobenius norm minimization for color image reconstruction. Pattern Recogn. 158, 110986 (2025)","journal-title":"Pattern Recogn."},{"issue":"3","key":"766_CR12","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."},{"key":"766_CR13","doi-asserted-by":"crossref","unstructured":"Fazel, M., Hindi, H., Boyd, S.P.: A rank minimization heuristic with application to minimum order system approximation. In: Proceedings of the American Control Conference, pp. 4734\u20134739 (2001)","DOI":"10.1109\/ACC.2001.945730"},{"issue":"4","key":"766_CR14","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"766_CR15","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J-F 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."},{"issue":"3","key":"766_CR16","first-page":"615","volume":"6","author":"K-C Toh","year":"2010","unstructured":"Toh, K.-C., Yun, S.: An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems. Pacific Journal of Optimization 6(3), 615\u2013640 (2010)","journal-title":"Pacific Journal of Optimization"},{"issue":"2","key":"766_CR17","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1109\/TIP.2015.2511584","volume":"25","author":"C Lu","year":"2015","unstructured":"Lu, C., Tang, J., Yan, S., Lin, Z.: Nonconvex nonsmooth low rank minimization via iteratively reweighted nuclear norm. IEEE Trans. Image Process. 25(2), 829\u2013839 (2015)","journal-title":"IEEE Trans. Image Process."},{"key":"766_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, D., Hu, Y., Ye, J., Li, X., He, X.: Matrix completion by truncated nuclear norm regularization. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 2192\u20132199 (2012)","DOI":"10.1109\/CVPR.2012.6247927"},{"key":"766_CR19","doi-asserted-by":"crossref","unstructured":"Gu, S., Zhang, L., Zuo, W., Feng, X.: Weighted nuclear norm minimization with application to image denoising. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 2862\u20132869 (2014)","DOI":"10.1109\/CVPR.2014.366"},{"key":"766_CR20","doi-asserted-by":"crossref","unstructured":"Nie, F., Huang, H., Ding, C.: Low-rank matrix recovery via efficient Schatten $$p$$-norm minimization. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 655\u2013661 (2012)","DOI":"10.1609\/aaai.v26i1.8210"},{"issue":"35","key":"766_CR21","first-page":"1081","volume":"11","author":"T Zhang","year":"2010","unstructured":"Zhang, T.: Analysis of multi-stage convex relaxation for sparse regularization. J. Mach. Learn. Res. 11(35), 1081\u20131107 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"766_CR22","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"C-H Zhang","year":"2010","unstructured":"Zhang, C.-H.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38(2), 894\u2013942 (2010)","journal-title":"Ann. Stat."},{"issue":"1","key":"766_CR23","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1137\/140952363","volume":"37","author":"P Yin","year":"2015","unstructured":"Yin, P., Lou, Y., He, Q., Xin, J.: Minimization of $$\\ell _{1-2}$$ for compressed sensing. SIAM J. Sci. Comput. 37(1), 536\u2013563 (2015)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"766_CR24","doi-asserted-by":"publisher","first-page":"2378","DOI":"10.1137\/22M1543653","volume":"34","author":"Y Li","year":"2024","unstructured":"Li, Y., Zhang, L.: A novel nonconvex relaxation approach to low-rank matrix completion of inexact observed data. SIAM J. Optim. 34(3), 2378\u20132410 (2024)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"766_CR25","doi-asserted-by":"publisher","first-page":"1950056","DOI":"10.1142\/S0219691319500565","volume":"18","author":"Y Cai","year":"2020","unstructured":"Cai, Y.: Minimization of the difference of nuclear and Frobenius norms for noisy low rank matrix recovery. Int. J. Wavelets Multiresolut. Inf. Process. 18(2), 1950056 (2020)","journal-title":"Int. J. Wavelets Multiresolut. Inf. Process."},{"issue":"4","key":"766_CR26","doi-asserted-by":"publisher","first-page":"2342","DOI":"10.1109\/TIT.2011.2111771","volume":"57","author":"EJ Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s, E.J., Plan, Y.: Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements. IEEE Trans. Inf. Theory 57(4), 2342\u20132359 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"766_CR27","doi-asserted-by":"crossref","unstructured":"Mohan, K., Fazel, M.: New restricted isometry results for noisy low-rank recovery. In: Proceedings of the IEEE International Symposium on Information Theory, pp. 1573\u20131577 (2010)","DOI":"10.1109\/ISIT.2010.5513471"},{"issue":"1","key":"766_CR28","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TIT.2013.2288639","volume":"60","author":"TT Cai","year":"2013","unstructured":"Cai, T.T., Zhang, A.: Sparse representation of a polytope and recovery of sparse signals and low-rank matrices. IEEE Trans. Inf. Theory 60(1), 122\u2013132 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"766_CR29","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.acha.2012.07.010","volume":"35","author":"TT Cai","year":"2013","unstructured":"Cai, T.T., Zhang, A.: Sharp RIP bound for sparse signal and low-rank matrix recovery. Appl. Comput. Harmon. Anal. 35(1), 74\u201393 (2013)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"4","key":"766_CR30","doi-asserted-by":"publisher","first-page":"2050091","DOI":"10.1142\/S0219691320500915","volume":"19","author":"J Huang","year":"2021","unstructured":"Huang, J., Wang, J., Zhang, F., Wang, H., Wang, W.: Perturbation analysis of low-rank matrix stable recovery. Int. J. Wavelets Multiresolut. Inf. Process. 19(4), 2050091 (2021)","journal-title":"Int. J. Wavelets Multiresolut. Inf. Process."},{"issue":"7","key":"766_CR31","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 $$p$$-isometry properties of nonconvex matrix recovery. IEEE Trans. Inf. Theory 59(7), 4316\u20134323 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"766_CR32","doi-asserted-by":"publisher","first-page":"15710","DOI":"10.1109\/TNNLS.2023.3289209","volume":"35","author":"J Huang","year":"2023","unstructured":"Huang, J., Zhang, F., Wang, J., Liu, X., Jia, J.: The perturbation analysis of nonconvex low-rank matrix robust recovery. IEEE Transactions on Neural Networks and Learning Systems 35(11), 15710\u201315723 (2023)","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"766_CR33","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.acha.2020.11.001","volume":"51","author":"M-J Lai","year":"2021","unstructured":"Lai, M.-J., Liu, Y., Li, S., Wang, H.: On the Schatten $$p$$-quasi-norm minimization for low-rank matrix recovery. Appl. Comput. Harmon. Anal. 51, 157\u2013170 (2021)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"3","key":"766_CR34","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 $$p$$-minimization. Asia-Pacific J. Oper. Res. 30(3), 1340010 (2013)","journal-title":"Asia-Pacific J. Oper. Res."},{"issue":"12","key":"766_CR35","doi-asserted-by":"publisher","first-page":"2643","DOI":"10.1007\/s11425-015-5081-6","volume":"58","author":"W Chen","year":"2015","unstructured":"Chen, W., Li, Y.: Stable recovery of low-rank matrix via nonconvex Schatten $$p$$-minimization. SCIENCE CHINA Math. 58(12), 2643\u20132654 (2015)","journal-title":"SCIENCE CHINA Math."},{"key":"766_CR36","doi-asserted-by":"publisher","first-page":"2552","DOI":"10.1109\/LSP.2022.3229555","volume":"29","author":"X Liu","year":"2022","unstructured":"Liu, X., Hou, J., Wang, J.: Robust low-rank matrix recovery fusing local-smoothness. IEEE Signal Process. Lett. 29, 2552\u20132556 (2022)","journal-title":"IEEE Signal Process. Lett."},{"issue":"15","key":"766_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2020.112767","volume":"374","author":"F Zhang","year":"2020","unstructured":"Zhang, F., Wang, W., Huang, J., Wang, J., Wang, Y.: RIP-based performance guarantee for low-tubal-rank tensor recovery. J. Comput. Appl. Math. 374(15), 112767 (2020)","journal-title":"J. Comput. Appl. Math."},{"issue":"6","key":"766_CR38","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6420\/ad35e1","volume":"40","author":"J Xu","year":"2024","unstructured":"Xu, J., Li, P., Zheng, B.: Matrix recovery from nonconvex regularized least absolute deviations. Inverse Prob. 40(6), 065002 (2024)","journal-title":"Inverse Prob."},{"issue":"2","key":"766_CR39","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(2), 396\u2013416 (2016)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"4","key":"766_CR40","doi-asserted-by":"publisher","first-page":"2354","DOI":"10.3934\/jimo.2022045","volume":"19","author":"H Guo","year":"2023","unstructured":"Guo, H., Yu, Q., Zhang, X., Cheng, L.: Low rank matrix minimization with a truncated difference of nuclear norm and Frobenius norm regularization. Journal of Industrial & Management Optimization 19(4), 2354\u20132366 (2023)","journal-title":"Journal of Industrial & Management Optimization"},{"issue":"3","key":"766_CR41","first-page":"213","volume":"13","author":"AS Lewis","year":"2005","unstructured":"Lewis, A.S., Sendov, H.S.: Nonsmooth analysis of singular values. Part I: Theory. Set-Valued Analysis 13(3), 213\u2013241 (2005)","journal-title":"Part I: Theory. Set-Valued Analysis"},{"issue":"2","key":"766_CR42","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/110840364","volume":"51","author":"M-J Lai","year":"2013","unstructured":"Lai, M.-J., Xu, Y., Yin, W.: Improved iteratively reweighted least squares for unconstrained smoothed $$\\ell _q$$ minimization. SIAM J. Numer. Anal. 51(2), 927\u2013957 (2013)","journal-title":"SIAM J. Numer. Anal."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-026-00766-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-026-00766-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-026-00766-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T11:17:57Z","timestamp":1773227877000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-026-00766-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,27]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["766"],"URL":"https:\/\/doi.org\/10.1007\/s10589-026-00766-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,27]]},"assertion":[{"value":"12 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}