{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T16:32:17Z","timestamp":1777307537224,"version":"3.51.4"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T00:00:00Z","timestamp":1669766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T00:00:00Z","timestamp":1669766400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"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"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s10589-022-00439-y","type":"journal-article","created":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T07:07:55Z","timestamp":1669792075000},"page":"761-788","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["T-product factorization based method for matrix and tensor completion problems"],"prefix":"10.1007","volume":"84","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8051-7477","authenticated-orcid":false,"given":"Quan","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7498-6616","authenticated-orcid":false,"given":"Xinzhen","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,30]]},"reference":[{"issue":"3","key":"439_CR1","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1137\/15M1048008","volume":"9","author":"M Bai","year":"2016","unstructured":"Bai, M., Zhang, X., Ni, G., Cui, C.: An adaptive correction approach for tensor completion. SIAM J. Imaging Sci. 9(3), 1298\u20131323 (2016)","journal-title":"SIAM J. Imaging Sci."},{"issue":"5","key":"439_CR2","doi-asserted-by":"publisher","first-page":"2466","DOI":"10.1109\/TIP.2017.2672439","volume":"26","author":"JA Bengua","year":"2017","unstructured":"Bengua, J.A., Phien, H.N., Tuan, H.D., Do, M.N.: Efficient tensor completion for color image and video recovery: low-rank tensor train. IEEE Trans. Image Process. 26(5), 2466\u20132479 (2017)","journal-title":"IEEE Trans. Image Process."},{"key":"439_CR3","unstructured":"Border, K.: The supergradient of a concave function (2001). https:\/\/healy.econ.ohio-state.edu\/kcb\/Notes\/Supergrad.pdf"},{"issue":"1","key":"439_CR4","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1109\/TPAMI.2014.2343234","volume":"37","author":"R Cabral","year":"2015","unstructured":"Cabral, R., De la Torre, F., Costeira, J.P., Bernardino, A.: Matrix completion for weakly-supervised multi-label image classification. IEEE Trans. Pattern Anal. Mach. Intell. 37(1), 121\u2013135 (2015)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"439_CR5","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."},{"issue":"2","key":"439_CR6","doi-asserted-by":"publisher","first-page":"025010","DOI":"10.1088\/0266-5611\/27\/2\/025010","volume":"27","author":"S Gandy","year":"2011","unstructured":"Gandy, S., Recht, B., Yamada, I.: Tensor completion and low-n-rank tensor recovery via convex optimization. Inverse Prob. 27(2), 025010 (2011). https:\/\/doi.org\/10.1088\/0266-5611\/27\/2\/025010","journal-title":"Inverse Prob."},{"issue":"1","key":"439_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10589-021-00328-w","volume":"81","author":"B Gao","year":"2021","unstructured":"Gao, B., Absil, P.A.: A Riemannian rank-adaptive method for low-rank matrix completion. Comput. Optim. Appl. 81(1), 67\u201390 (2021). https:\/\/doi.org\/10.1007\/s10589-021-00328-w","journal-title":"Comput. Optim. Appl."},{"key":"439_CR8","doi-asserted-by":"publisher","DOI":"10.3934\/jimo.2022045","author":"H Guo","year":"2022","unstructured":"Guo, H., Yu, Q., Zhang, X., Cheng, L.: Low rank matrix minimization with a truncated difference of nuclear norm and frobenius norm regularization. J. Ind. Manag. Optim. (2022). https:\/\/doi.org\/10.3934\/jimo.2022045","journal-title":"J. Ind. Manag. Optim."},{"key":"439_CR9","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."},{"issue":"6","key":"439_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2512329","volume":"60","author":"CJ Hillar","year":"2013","unstructured":"Hillar, C.J., Lim, L.H.: Most tensor problems are NP-hard. J. ACM 60(6), 1\u201339 (2013). https:\/\/doi.org\/10.1145\/2512329","journal-title":"J. ACM"},{"issue":"1\u20134","key":"439_CR11","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1002\/sapm192761164","volume":"6","author":"FL Hitchcock","year":"1927","unstructured":"Hitchcock, F.L.: The expression of a tensor or a polyadic as a sum of products. J. Math. Phys. 6(1\u20134), 164\u2013189 (1927)","journal-title":"J. Math. Phys."},{"key":"439_CR12","doi-asserted-by":"publisher","first-page":"7233","DOI":"10.1109\/TIP.2020.3000349","volume":"29","author":"TX Jiang","year":"2020","unstructured":"Jiang, T.X., Ng, M.K., Zhao, X.L., Huang, T.Z.: Framelet representation of tensor nuclear norm for third-order tensor completion. IEEE Trans. Image Process. 29, 7233\u20137244 (2020)","journal-title":"IEEE Trans. Image Process."},{"issue":"6","key":"439_CR13","doi-asserted-by":"publisher","first-page":"2980","DOI":"10.1109\/TIT.2010.2046205","volume":"56","author":"RH Keshavan","year":"2010","unstructured":"Keshavan, R.H., Montanari, A., Oh, S.: Matrix completion from a few entries. IEEE Trans. Inf. Theory 56(6), 2980\u20132998 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"439_CR14","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1137\/110837711","volume":"34","author":"ME Kilmer","year":"2013","unstructured":"Kilmer, M.E., Braman, K., Hao, N., Hoover, R.C.: Third-order tensors as operators on matrices: a theoretical and computational framework with applications in imaging. SIAM J. Matrix Anal. Appl. 34(1), 148\u2013172 (2013). https:\/\/doi.org\/10.1137\/110837711","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"439_CR15","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1016\/j.laa.2010.09.020","volume":"435","author":"ME Kilmer","year":"2011","unstructured":"Kilmer, M.E., Martin, C.D.: Factorization strategies for third-order tensors. Linear Algebra Appl. 435(3), 641\u2013658 (2011). https:\/\/doi.org\/10.1016\/j.laa.2010.09.020","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"439_CR16","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51(3), 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"issue":"9","key":"439_CR17","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1109\/LSP.2014.2323404","volume":"21","author":"C Lee","year":"2014","unstructured":"Lee, C., Li, Y., Monga, V.: Ghost-free high dynamic range imaging via rank minimization. IEEE Signal Process. Lett. 21(9), 1045\u20131049 (2014)","journal-title":"IEEE Signal Process. Lett."},{"issue":"2","key":"439_CR18","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s10589-019-00084-y","volume":"73","author":"YF Li","year":"2019","unstructured":"Li, Y.F., Shang, K., Huang, Z.H.: A singular value p-shrinkage thresholding algorithm for low rank matrix recovery. Comput. Optim. Appl. 73(2), 453\u2013476 (2019). https:\/\/doi.org\/10.1007\/s10589-019-00084-y","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"439_CR19","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1007\/s10589-021-00315-1","volume":"80","author":"C Ling","year":"2021","unstructured":"Ling, C., Yu, G., Qi, L., Xu, Y.: T-product factorization method for internet traffic data completion with spatio-temporal regularization. Comput. Optim. Appl. 80(3), 883\u2013913 (2021). https:\/\/doi.org\/10.1007\/s10589-021-00315-1","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"439_CR20","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/TPAMI.2012.39","volume":"35","author":"J Liu","year":"2013","unstructured":"Liu, J., Musialski, P., Wonka, P., Ye, J.: Tensor completion for estimating missing values in visual data. IEEE Trans. Pattern Anal. Mach. Intell. 35(1), 208\u2013220 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"439_CR21","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10107-010-0437-8","volume":"133","author":"YJ Liu","year":"2012","unstructured":"Liu, Y.J., Sun, D., Toh, K.C.: An implementable proximal point algorithmic framework for nuclear norm minimization. Math. Program. 133(1), 399\u2013436 (2012)","journal-title":"Math. Program."},{"key":"439_CR22","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. IEEE (2014). https:\/\/doi.org\/10.1109\/cvpr.2014.526","DOI":"10.1109\/cvpr.2014.526"},{"issue":"8","key":"439_CR23","doi-asserted-by":"publisher","first-page":"2355","DOI":"10.1109\/TIP.2015.2421309","volume":"24","author":"Y Luo","year":"2015","unstructured":"Luo, Y., Liu, T., Tao, D., Xu, C.: Multiview matrix completion for multilabel image classification. IEEE Trans. Image Process. 24(8), 2355\u20132368 (2015)","journal-title":"IEEE Trans. Image Process."},{"issue":"1","key":"439_CR24","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), 321\u2013353 (2011)","journal-title":"Math. Program."},{"issue":"1","key":"439_CR25","doi-asserted-by":"publisher","first-page":"A474","DOI":"10.1137\/110841229","volume":"35","author":"CD Martin","year":"2013","unstructured":"Martin, C.D., Shafer, R., LaRue, B.: An order-$$p$$ tensor factorization with applications in imaging. SIAM J. Sci. Comput. 35(1), A474\u2013A490 (2013)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"439_CR26","first-page":"2287","volume":"11","author":"R Mazumder","year":"2010","unstructured":"Mazumder, R., Hastie, T., Tibshirani, R.: Spectral regularization algorithms for learning large incomplete matrices. J. Mach. Learn. Res. 11(1), 2287\u20132322 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"439_CR27","unstructured":"Mu, C., Huang, B., Wright, J., Goldfarb, D.: Square deal: lower bounds and improved relaxations for tensor recovery. In: Proceedings of the 31st International Conference on International Conference on Machine Learning, vol.\u00a032, pp. II-73\u2013II-81 (2014)"},{"issue":"6","key":"439_CR28","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1109\/TPAMI.2014.2361338","volume":"37","author":"TH Oh","year":"2015","unstructured":"Oh, T.H., Lee, J.Y., Tai, Y.W., Kweon, I.S.: Robust high dynamic range imaging by rank minimization. IEEE Trans. Pattern Anal. Mach. Intell. 37(6), 1219\u20131232 (2015)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"5","key":"439_CR29","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1137\/090752286","volume":"33","author":"IV Oseledets","year":"2011","unstructured":"Oseledets, I.V.: Tensor-train decomposition. SIAM J. Sci. Comput. 33(5), 2295\u20132317 (2011)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"439_CR30","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/20m1323266","volume":"42","author":"L Qi","year":"2021","unstructured":"Qi, L., Chen, Y., Bakshi, M., Zhang, X.: Triple decomposition and tensor recovery of third order tensors. SIAM J. Matrix Anal. Appl. 42(1), 299\u2013329 (2021). https:\/\/doi.org\/10.1137\/20m1323266","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"439_CR31","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."},{"issue":"2","key":"439_CR32","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s12532-013-0053-8","volume":"5","author":"B Recht","year":"2013","unstructured":"Recht, B., R\u00e9, C.: Parallel stochastic gradient algorithms for large-scale matrix completion. Math. Program. Comput. 5(2), 201\u2013226 (2013)","journal-title":"Math. Program. Comput."},{"issue":"15","key":"439_CR33","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.laa.2004.06.013","volume":"392","author":"O Rojo","year":"2004","unstructured":"Rojo, O., Rojo, H.: Some results on symmetric circulant matrices and on symmetric centrosymmetric matrices. Linear Algebra Appl. 392(15), 211\u2013233 (2004). https:\/\/doi.org\/10.1016\/j.laa.2004.06.013","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"439_CR34","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1109\/TNET.2011.2169424","volume":"20","author":"M Roughan","year":"2012","unstructured":"Roughan, M., Zhang, Y., Willinger, W., Qiu, L.: Spatio-temporal compressive sensing and internet traffic matrices (extended version). IEEE\/ACM Trans. Netw. 20(3), 662\u2013676 (2012)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"439_CR35","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.patrec.2016.12.019","volume":"96","author":"A Sobral","year":"2017","unstructured":"Sobral, A., Zahzah, Eh.: Matrix and tensor completion algorithms for background model initialization: a comparative evaluation. Pattern Recognit. Lett. 96(1), 22\u201333 (2017)","journal-title":"Pattern Recognit. Lett."},{"issue":"3","key":"439_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(3), 615\u2013640 (2010)","journal-title":"Pac. J. Optim."},{"key":"439_CR37","doi-asserted-by":"crossref","unstructured":"Tsagkatakis, G., Tsakalides, P.: Efficient high dynamic range imaging via matrix completion. In: 2012 IEEE International Workshop on Machine Learning for Signal Processing, pp. 1\u20136 (2012)","DOI":"10.1109\/MLSP.2012.6349802"},{"issue":"3","key":"439_CR38","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02289464","volume":"31","author":"LR Tucker","year":"1966","unstructured":"Tucker, L.R.: Some mathematical notes on three-mode factor analysis. Psychometrika 31(3), 279\u2013311 (1966)","journal-title":"Psychometrika"},{"issue":"4","key":"439_CR39","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., Sheikh, H., Simoncelli, E.: Image quality assessment: from error visibility to structural similarity. IEEE Trans. Image Process. 13(4), 600\u2013612 (2004). https:\/\/doi.org\/10.1109\/tip.2003.819861","journal-title":"IEEE Trans. Image Process."},{"issue":"4","key":"439_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":"10","key":"439_CR41","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."},{"issue":"1","key":"439_CR42","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s12532-014-0074-y","volume":"7","author":"Y Xu","year":"2015","unstructured":"Xu, Y.: Alternating proximal gradient method for sparse nonnegative tucker decomposition. Math. Program. Comput. 7(1), 39\u201370 (2015). https:\/\/doi.org\/10.1007\/s12532-014-0074-y","journal-title":"Math. Program. Comput."},{"issue":"2","key":"439_CR43","doi-asserted-by":"publisher","first-page":"601","DOI":"10.3934\/ipi.2015.9.601","volume":"9","author":"Y Xu","year":"2015","unstructured":"Xu, Y., Hao, R., Yin, W., Su, Z.: Parallel matrix factorization for low-rank tensor completion. Inverse Probl. Imaging 9(2), 601\u2013624 (2015). https:\/\/doi.org\/10.3934\/ipi.2015.9.601","journal-title":"Inverse Probl. Imaging"},{"issue":"3","key":"439_CR44","doi-asserted-by":"publisher","first-page":"1758","DOI":"10.1137\/120887795","volume":"6","author":"Y Xu","year":"2013","unstructured":"Xu, Y., Yin, W.: A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion. SIAM J. Imaging Sci. 6(3), 1758\u20131789 (2013). https:\/\/doi.org\/10.1137\/120887795","journal-title":"SIAM J. Imaging Sci."},{"issue":"2","key":"439_CR45","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s11464-012-0194-5","volume":"7","author":"Y Xu","year":"2012","unstructured":"Xu, Y., Yin, W., Wen, Z., Zhang, Y.: An alternating direction algorithm for matrix completion with nonnegative factors. Front. Math. China 7(2), 365\u2013384 (2012). https:\/\/doi.org\/10.1007\/s11464-012-0194-5","journal-title":"Front. Math. China"},{"issue":"1","key":"439_CR46","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10589-015-9769-x","volume":"63","author":"L Yang","year":"2015","unstructured":"Yang, L., Huang, Z.H., Hu, S., Han, J.: An iterative algorithm for third-order tensor multi-rank minimization. Comput. Optim. Appl. 63(1), 169\u2013202 (2015). https:\/\/doi.org\/10.1007\/s10589-015-9769-x","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"439_CR47","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s10589-021-00337-9","volume":"81","author":"Q Yu","year":"2022","unstructured":"Yu, Q., Zhang, X.: A smoothing proximal gradient algorithm for matrix rank minimization problem. Comput. Optim. Appl. 81(2), 519\u2013538 (2022). https:\/\/doi.org\/10.1007\/s10589-021-00337-9","journal-title":"Comput. Optim. Appl."},{"key":"439_CR48","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2464","author":"Q Yu","year":"2022","unstructured":"Yu, Q., Zhang, X., Chen, Y., Qi, L.: Low tucker rank tensor completion using a symmetric block coordinate descent method. Numer. Linear Algebra Appl. (2022). https:\/\/doi.org\/10.1002\/nla.2464","journal-title":"Numer. Linear Algebra Appl."},{"issue":"5","key":"439_CR49","doi-asserted-by":"publisher","first-page":"1125","DOI":"10.1109\/TSP.2017.2784361","volume":"66","author":"WJ Zeng","year":"2018","unstructured":"Zeng, W.J., So, H.C.: Outlier-robust matrix completion via $$\\ell _p$$-minimization. IEEE Trans. Signal Process. 66(5), 1125\u20131140 (2018)","journal-title":"IEEE Trans. Signal Process."},{"issue":"8","key":"439_CR50","doi-asserted-by":"publisher","first-page":"2378","DOI":"10.1109\/tip.2011.2109730","volume":"20","author":"L Zhang","year":"2011","unstructured":"Zhang, L., Zhang, L., Mou, X., Zhang, D.: FSIM: a feature similarity index for image quality assessment. IEEE Trans. Image Process. 20(8), 2378\u20132386 (2011). https:\/\/doi.org\/10.1109\/tip.2011.2109730","journal-title":"IEEE Trans. Image Process."},{"issue":"6","key":"439_CR51","doi-asserted-by":"publisher","first-page":"1659","DOI":"10.1109\/TNNLS.2018.2872583","volume":"30","author":"X Zhang","year":"2019","unstructured":"Zhang, X.: A nonconvex relaxation approach to low-rank tensor completion. IEEE Trans. Neural Netw. Learn. Syst. 30(6), 1659\u20131671 (2019)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"439_CR52","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Ely, G., Aeron, S., Hao, N., Kilmer, M.: Novel methods for multilinear data completion and de-noising based on tensor-SVD. In: 2014 IEEE Conference on Computer Vision and Pattern Recognition, pp. 3842\u20133849 (2014)","DOI":"10.1109\/CVPR.2014.485"},{"key":"439_CR53","unstructured":"Zhao, Q., Zhou, G., Xie, S., Zhang, L., Cichocki, A.: Tensor ring decomposition (2016). arXiv:1606.05535"},{"key":"439_CR54","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"},{"key":"439_CR55","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.ins.2020.05.005","volume":"532","author":"YB Zheng","year":"2020","unstructured":"Zheng, Y.B., Huang, T.Z., Zhao, X.L., Jiang, T.X., Ji, T.Y., Ma, T.H.: Tensor n-tubal rank and its convex relaxation for low-rank tensor recovery. Inf. Sci. 532, 170\u2013189 (2020). https:\/\/doi.org\/10.1016\/j.ins.2020.05.005","journal-title":"Inf. Sci."},{"issue":"1","key":"439_CR56","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1109\/tgrs.2019.2940534","volume":"58","author":"YB Zheng","year":"2020","unstructured":"Zheng, Y.B., Huang, T.Z., Zhao, X.L., Jiang, T.X., Ma, T.H., Ji, T.Y.: Mixed noise removal in hyperspectral image via low-fibered-rank regularization. IEEE Trans. Geosci. Remote Sens. 58(1), 734\u2013749 (2020). https:\/\/doi.org\/10.1109\/tgrs.2019.2940534","journal-title":"IEEE Trans. Geosci. Remote Sens."},{"issue":"3","key":"439_CR57","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1109\/TIP.2017.2762595","volume":"27","author":"P Zhou","year":"2018","unstructured":"Zhou, P., Lu, C., Lin, Z., Zhang, C.: Tensor factorization for low-rank tensor completion. IEEE Trans. Image Process. 27(3), 1152\u20131163 (2018)","journal-title":"IEEE Trans. Image Process."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00439-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00439-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00439-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T18:24:39Z","timestamp":1728498279000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00439-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,30]]},"references-count":57,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["439"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00439-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,30]]},"assertion":[{"value":"17 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}