{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T07:54:56Z","timestamp":1776412496925,"version":"3.51.2"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T00:00:00Z","timestamp":1748908800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T00:00:00Z","timestamp":1748908800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1007\/s11075-025-02119-4","type":"journal-article","created":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T06:46:48Z","timestamp":1748933208000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Robust low-rank matrix completion based on regionally weighted truncated nuclear norm regularization"],"prefix":"10.1007","volume":"102","author":[{"given":"Wei","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gangrong","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,3]]},"reference":[{"issue":"3","key":"2119_CR1","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 $$l_{1-2}$$ models for sparse recovery and rank minimization. SIAM J. Imag. Sci. 10(3), 1346\u20131380 (2017). https:\/\/doi.org\/10.1137\/16M1098929","journal-title":"SIAM J. Imag. Sci."},{"key":"2119_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.neucom.2020.03.018","volume":"400","author":"X-L Zhao","year":"2020","unstructured":"Zhao, X.-L., Xu, W.-H., Jiang, T.-X., Wang, Y., Ng, M.K.: Deep plug-and-play prior for low-rank tensor completion. Neurocomputing 400, 137\u2013149 (2020). https:\/\/doi.org\/10.1016\/j.neucom.2020.03.018","journal-title":"Neurocomputing"},{"key":"2119_CR3","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.neucom.2020.07.022","volume":"413","author":"X-L Zhao","year":"2020","unstructured":"Zhao, X.-L., Zhang, H., Jiang, T.-X., Ng, M.K., Zhang, X.-J.: Fast algorithm with theoretical guarantees for constrained low-tubal-rank tensor recovery in hyperspectral images denoising. Neurocomputing 413, 397\u2013409 (2020). https:\/\/doi.org\/10.1016\/j.neucom.2020.07.022","journal-title":"Neurocomputing"},{"key":"2119_CR4","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.neucom.2018.07.066","volume":"316","author":"S Kuang","year":"2018","unstructured":"Kuang, S., Chao, H., Li, Q.: Matrix completion with capped nuclear norm via majorized proximal minimization. Neurocomputing 316, 190\u2013201 (2018). https:\/\/doi.org\/10.1016\/j.neucom.2018.07.066","journal-title":"Neurocomputing"},{"key":"2119_CR5","doi-asserted-by":"publisher","first-page":"149349","DOI":"10.1109\/ACCESS.2021.3125152","volume":"9","author":"K Xu","year":"2021","unstructured":"Xu, K., Zhang, Y., Dong, Z., Li, Z., Fang, B.: Hybrid matrix completion model for improved images recovery and recommendation systems. IEEE Access 9, 149349\u2013149359 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2021.3125152","journal-title":"IEEE Access"},{"key":"2119_CR6","doi-asserted-by":"publisher","unstructured":"Hu, W., Wang, Z., Liu, S., Yang, X., Yu, G., Zhang, J.J.: Motion capture data completion via truncated nuclear norm regularization. IEEE Signal Process. Lett. 25(2), 258\u2013262 (2018). https:\/\/doi.org\/10.1109\/LSP.2017.2687044","DOI":"10.1109\/LSP.2017.2687044"},{"key":"2119_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ins.2018.02.052","volume":"450","author":"B Chen","year":"2018","unstructured":"Chen, B., Sun, H., Xia, G., Feng, L., Li, B.: Human motion recovery utilizing truncated schatten p-norm and kinematic constraints. Inf. Sci. 450, 89\u2013108 (2018). https:\/\/doi.org\/10.1016\/j.ins.2018.02.052","journal-title":"Inf. Sci."},{"issue":"6","key":"2119_CR8","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1109\/JPROC.2009.2035722","volume":"98","author":"EJ Candes","year":"2010","unstructured":"Candes, E.J., Plan, Y.: Matrix completion with noise. Proc. IEEE 98(6), 925\u2013936 (2010). https:\/\/doi.org\/10.1109\/JPROC.2009.2035722","journal-title":"Proc. IEEE"},{"issue":"4","key":"2119_CR9","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.imavis.2012.02.010","volume":"30","author":"BGV Kumar","year":"2012","unstructured":"Kumar, B.G.V., Kotsia, I., Patras, I.: Max-margin non-negative matrix factorization. Image Vis. Comput. 30(4), 279\u2013291 (2012). https:\/\/doi.org\/10.1016\/j.imavis.2012.02.010","journal-title":"Image Vis. Comput."},{"key":"2119_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2016.11.003","volume":"380","author":"V Kumar","year":"2017","unstructured":"Kumar, V., Pujari, A.K., Sahu, S.K., Kagita, V.R., Padmanabhan, V.: Collaborative filtering using multiple binary maximum margin matrix factorizations. Inf. Sci. 380, 1\u201311 (2017). https:\/\/doi.org\/10.1016\/j.ins.2016.11.003","journal-title":"Inf. Sci."},{"key":"2119_CR11","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/j.future.2017.09.015","volume":"78","author":"M Eirinaki","year":"2018","unstructured":"Eirinaki, M., Gao, J., Varlamis, I., Tserpes, K.: Recommender systems for large-scale social networks: A review of challenges and solutions. Future Gener. Comput. Syst. 78, 413\u2013418 (2018). https:\/\/doi.org\/10.1016\/j.future.2017.09.015","journal-title":"Future Gener. Comput. Syst."},{"key":"2119_CR12","doi-asserted-by":"publisher","unstructured":"Gu, S., Zhang, L., Zuo, W., Feng, X.: Weighted nuclear norm minimization with application to image denoising. In: 2014 IEEE Conference on Computer Vision and Pattern Recognition, pp. 2862\u20132869 (2014). https:\/\/doi.org\/10.1109\/CVPR.2014.366","DOI":"10.1109\/CVPR.2014.366"},{"issue":"6","key":"2119_CR13","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1145\/2184319.2184343","volume":"55","author":"E Cand\u00e8s","year":"2012","unstructured":"Cand\u00e8s, E., Recht, B.: Exact matrix completion via convex optimization. Commun. ACM 55(6), 111\u2013119 (2012). https:\/\/doi.org\/10.1145\/2184319.2184343","journal-title":"Commun. ACM"},{"key":"2119_CR14","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.ins.2017.10.047","volume":"429","author":"Y-M Huang","year":"2018","unstructured":"Huang, Y.-M., Yan, H.-Y., Wen, Y.-W., Yang, X.: Rank minimization with applications to image noise removal. Inf. Sci. 429, 147\u2013163 (2018). https:\/\/doi.org\/10.1016\/j.ins.2017.10.047","journal-title":"Inf. Sci."},{"issue":"4","key":"2119_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). https:\/\/doi.org\/10.1137\/080738970","journal-title":"SIAM J. Optim."},{"key":"2119_CR16","unstructured":"Wright, J., Ganesh, A., Rao, S., Peng, Y.G., Ma, Y.: Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization. Curran Associates Inc. (2009)"},{"issue":"3","key":"2119_CR17","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(3), 615\u2013640 (2010)","journal-title":"Pac. J. Optim."},{"issue":"10","key":"2119_CR18","doi-asserted-by":"publisher","first-page":"4842","DOI":"10.1109\/TIP.2016.2599290","volume":"25","author":"Y Xie","year":"2016","unstructured":"Xie, Y., Gu, S., Liu, Y., Zuo, W., Zhang, W., Zhang, L.: Weighted schatten $$p$$ -norm minimization for image denoising and background subtraction. IEEE Trans. Image Process. 25(10), 4842\u20134857 (2016). https:\/\/doi.org\/10.1109\/TIP.2016.2599290","journal-title":"IEEE Trans. Image Process."},{"key":"2119_CR19","doi-asserted-by":"publisher","unstructured":"Lu, C., Tang, J., Yan, S., Lin, Z.: Generalized nonconvex nonsmooth low-rank minimization. In: 2014 IEEE Conference on Computer Vision and Pattern Recognition, pp. 4130\u20134137 (2014). https:\/\/doi.org\/10.1109\/CVPR.2014.526","DOI":"10.1109\/CVPR.2014.526"},{"key":"2119_CR20","doi-asserted-by":"publisher","unstructured":"Zhang, D., Hu, Y., Ye, J., Li, X., He, X.: Matrix completion by truncated nuclear norm regularization. In: 2012 IEEE Conference on Computer Vision and Pattern Recognition, pp. 2192\u20132199 (2012). https:\/\/doi.org\/10.1109\/CVPR.2012.6247927","DOI":"10.1109\/CVPR.2012.6247927"},{"key":"2119_CR21","unstructured":"Lin, Z., Liu, R., Su, Z.: Linearized alternating direction method with adaptive penalty for low-rank representation. Adv. Neural Inf. Process. Syst. 612\u2013620 (2011)"},{"issue":"9","key":"2119_CR22","doi-asserted-by":"publisher","first-page":"2117","DOI":"10.1109\/TPAMI.2012.271","volume":"35","author":"Y Hu","year":"2013","unstructured":"Hu, Y., Zhang, D., Ye, J., Li, X., He, X.: Fast and accurate matrix completion via truncated nuclear norm regularization. IEEE Trans. Pattern Anal. Mach. Intell. 35(9), 2117\u20132130 (2013). https:\/\/doi.org\/10.1109\/TPAMI.2012.271","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"2119_CR23","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1109\/TIP.2015.2503238","volume":"25","author":"Q Liu","year":"2016","unstructured":"Liu, Q., Lai, Z., Zhou, Z., Kuang, F., Jin, Z.: A truncated nuclear norm regularization method based on weighted residual error for matrix completion. IEEE Trans. Image Process. 25(1), 316\u2013330 (2016). https:\/\/doi.org\/10.1109\/TIP.2015.2503238","journal-title":"IEEE Trans. Image Process."},{"issue":"2","key":"2119_CR24","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1109\/JMASS.2023.3236302","volume":"4","author":"X Tian","year":"2023","unstructured":"Tian, X., Zhou, S., Meng, T.: Robust matrix completion method based on tnnr and total row difference for recovering optical image. IEEE Journal on Miniaturization for Air and Space Systems. 4(2), 105\u2013113 (2023). https:\/\/doi.org\/10.1109\/JMASS.2023.3236302","journal-title":"IEEE Journal on Miniaturization for Air and Space Systems."},{"issue":"10","key":"2119_CR25","doi-asserted-by":"publisher","first-page":"5171","DOI":"10.1109\/TIP.2019.2918733","volume":"28","author":"H Ye","year":"2019","unstructured":"Ye, H., Li, H., Cao, F., Zhang, L.: A hybrid truncated norm regularization method for matrix completion. IEEE Trans. Image Process. 28(10), 5171\u20135186 (2019). https:\/\/doi.org\/10.1109\/TIP.2019.2918733","journal-title":"IEEE Trans. Image Process."},{"key":"2119_CR26","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1080\/07468342.1996.11973744","volume":"27","author":"D Kalman","year":"1996","unstructured":"Kalman, D.: A singularly valuable decomposition: The svd of a matrix. Coll. Math. J. 27, 2\u201323 (1996)","journal-title":"Coll. Math. J."},{"issue":"1","key":"2119_CR27","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.exmath.2020.05.001","volume":"39","author":"M Carlsson","year":"2021","unstructured":"Carlsson, M.: von neumann\u2019s trace inequality for hilbert-schmidt operators. Expo. Math. 39(1), 149\u2013157 (2021). https:\/\/doi.org\/10.1016\/j.exmath.2020.05.001","journal-title":"Expo. Math."},{"key":"2119_CR28","doi-asserted-by":"publisher","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. (2011). https:\/\/doi.org\/10.1561\/2200000016","DOI":"10.1561\/2200000016"},{"issue":"2","key":"2119_CR29","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1109\/TIP.2015.2511584","volume":"25","author":"C Lu","year":"2016","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 (2016). https:\/\/doi.org\/10.1109\/TIP.2015.2511584","journal-title":"IEEE Trans. Image Process."},{"key":"2119_CR30","doi-asserted-by":"publisher","first-page":"103335","DOI":"10.1016\/j.jvcir.2021.103335","volume":"81","author":"L Yang","year":"2021","unstructured":"Yang, L., Kou, K.I., Miao, J.: Weighted truncated nuclear norm regularization for low-rank quaternion matrix completion. J. Vis. Commun. Image Represent. 81, 103335 (2021). https:\/\/doi.org\/10.1016\/j.jvcir.2021.103335","journal-title":"J. Vis. Commun. Image Represent."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02119-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-025-02119-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02119-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T07:15:53Z","timestamp":1776410153000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-025-02119-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,3]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["2119"],"URL":"https:\/\/doi.org\/10.1007\/s11075-025-02119-4","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,3]]},"assertion":[{"value":"22 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflict of interest to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}