{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T16:51:46Z","timestamp":1770742306729,"version":"3.49.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"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":["12201149, 12261026"],"award-info":[{"award-number":["12201149, 12261026"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004607","name":"Natural Science Foundation of Guangxi Province","doi-asserted-by":"publisher","award":["2022JJA110051"],"award-info":[{"award-number":["2022JJA110051"]}],"id":[{"id":"10.13039\/501100004607","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Innovation Project of GUET Graduate Education","award":["2021YCXS113"],"award-info":[{"award-number":["2021YCXS113"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Comput Math"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s10444-023-10036-0","type":"journal-article","created":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T09:01:51Z","timestamp":1686646911000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Riemannian conjugate gradient method for low-rank tensor completion"],"prefix":"10.1007","volume":"49","author":[{"given":"Shan-Qi","family":"Duan","sequence":"first","affiliation":[]},{"given":"Xue-Feng","family":"Duan","sequence":"additional","affiliation":[]},{"given":"Chun-Mei","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jiao-Fen","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,13]]},"reference":[{"issue":"4","key":"10036_CR1","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1109\/JSTSP.2016.2539100","volume":"10","author":"MA Davenport","year":"2016","unstructured":"Davenport, M.A., Romberg, J.: An overview of low-rank matrix recovery from incomplete observations. IEEE J. Sel. Top. Sig. Process. 10(4), 608\u2013622 (2016)","journal-title":"IEEE J. Sel. Top. Sig. Process."},{"issue":"4","key":"10036_CR2","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. Prog. Comput. 4(4), 333\u2013361 (2012)","journal-title":"Math. Prog. Comput."},{"issue":"1","key":"10036_CR3","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/TPAMI.2012.39","volume":"35","author":"J Liu","year":"2012","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 (2012)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"10036_CR4","doi-asserted-by":"publisher","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 Probl. 27(2), 025010 (2011)","journal-title":"Inverse Probl."},{"key":"10036_CR5","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1016\/j.apm.2017.04.002","volume":"48","author":"T Ji","year":"2017","unstructured":"Ji, T., Huang, T., Zhao, X., Ma, T., Deng, L.: A non-convex tensor rank approximation for tensor completion. Appl. Math. Model. 48, 410\u2013422 (2017)","journal-title":"Appl. Math. Model."},{"issue":"1","key":"10036_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10915-019-01108-9","volume":"82","author":"S Gao","year":"2020","unstructured":"Gao, S., Fan, Q.: Robust schatten-p norm based approach for tensor completion. J. Sci. Comput. 82(1), 1\u201323 (2020)","journal-title":"J. Sci. Comput."},{"issue":"3","key":"10036_CR7","doi-asserted-by":"publisher","first-page":"1888","DOI":"10.1007\/s10915-019-01009-x","volume":"80","author":"C Shi","year":"2019","unstructured":"Shi, C., Huang, Z., Wan, L., Xiong, T.: Low-rank tensor completion based on log-det rank approximation and matrix factorization. J. Sci. Comput. 80(3), 1888\u20131912 (2019)","journal-title":"J. Sci. Comput."},{"key":"10036_CR8","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.image.2018.11.007","volume":"73","author":"W Xu","year":"2019","unstructured":"Xu, W., Zhao, X., Ji, T., Miao, J., Ma, T., Wang, S., Huang, T.: Laplace function based nonconvex surrogate for low-rank tensor completion. Sig. Process. Image Commun. 73, 62\u201369 (2019)","journal-title":"Sig. Process. Image Commun."},{"key":"10036_CR9","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. IEEE, (2014)","DOI":"10.1109\/CVPR.2014.366"},{"issue":"2","key":"10036_CR10","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)","journal-title":"Inverse Probl. Imaging."},{"key":"10036_CR11","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.ins.2015.07.049","volume":"326","author":"T Ji","year":"2016","unstructured":"Ji, T., Huang, T., Zhao, X., Ma, T., Liu, G.: Tensor completion using total variation and low-rank matrix factorization. Inf. Sci. 326, 243\u2013257 (2016)","journal-title":"Inf. Sci."},{"issue":"3","key":"10036_CR12","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1109\/TIP.2017.2762595","volume":"27","author":"P Zhou","year":"2017","unstructured":"Zhou, P., Lu, C., Lin, Z., Zhang, C.: Tensor factorization for low-rank tensor completion. IEEE Trans. Image Process. 27(3), 1152\u20131163 (2017)","journal-title":"IEEE Trans. Image Process."},{"issue":"6","key":"10036_CR13","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1007\/s10851-019-00933-9","volume":"62","author":"X Lin","year":"2020","unstructured":"Lin, X., Ng, M.K., Zhao, X.: Tensor factorization with total variation and tikhonov regularization for low-rank tensor completion in imaging data. J. Math. Imaging Vis. 62(6), 900\u2013918 (2020)","journal-title":"J. Math. Imaging Vis."},{"issue":"2","key":"10036_CR14","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1137\/110822347","volume":"22","author":"B He","year":"2012","unstructured":"He, B., Tao, M., Yuan, X.: Alternating direction method with gaussian back substitution for separable convex programming. SIAM J. Optim. 22(2), 313\u2013340 (2012)","journal-title":"SIAM J. Optim."},{"key":"10036_CR15","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.sigpro.2018.09.039","volume":"155","author":"Z Long","year":"2019","unstructured":"Long, Z., Liu, Y., Chen, L., Zhu, C.: Low rank tensor completion for multiway visual data. Signal Process. 155, 301\u2013316 (2019)","journal-title":"Signal Process."},{"issue":"1","key":"10036_CR16","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)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10036_CR17","unstructured":"Kilmer, M.E., Martin, C.D., Perrone, L.: A third-order generalization of the matrix svd as a product of third-order tensors, Tufts University. Department of Computer Science, Tech. Rep. TR-2008-4"},{"issue":"7","key":"10036_CR18","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.1016\/j.laa.2010.05.025","volume":"433","author":"K Braman","year":"2010","unstructured":"Braman, K.: Third-order tensors as linear operators on a space of matrices. Linear Algebra Appl. 433(7), 1241\u20131253 (2010)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"10036_CR19","doi-asserted-by":"publisher","first-page":"474","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), 474\u2013490 (2013)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"10036_CR20","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1016\/j.laa.2010.09.020","volume":"435","author":"E Misha","year":"2011","unstructured":"Misha, E., Kilmer, C., Martin, D.: Factorization strategies for third-order tensors. Linear Algebra Appl. 435(3), 641\u2013658 (2011)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"10036_CR21","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.laa.2013.03.016","volume":"439","author":"A Uschmajew","year":"2013","unstructured":"Uschmajew, A., Vandereycken, B.: The geometry of algorithms using hierarchical tensors. Linear Algebra Appl. 439(1), 133\u2013166 (2013)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"10036_CR22","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10543-013-0455-z","volume":"54","author":"D Kressner","year":"2014","unstructured":"Kressner, D., Steinlechner, M., Vandereycken, B.: Low-rank tensor completion by Riemannian optimization. BIT Numer Math. 54(2), 447\u2013468 (2014)","journal-title":"BIT Numer Math."},{"issue":"2","key":"10036_CR23","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.1137\/110845768","volume":"23","author":"B Vandereycken","year":"2013","unstructured":"Vandereycken, B.: Low-rank matrix completion by Riemannian optimization. SIAM J. Optim. 23(2), 1214\u20131236 (2013)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"10036_CR24","doi-asserted-by":"publisher","first-page":"S461","DOI":"10.1137\/15M1010506","volume":"38","author":"M Steinlechner","year":"2016","unstructured":"Steinlechner, M.: Riemannian optimization for high-dimensional tensor completion. SIAM J. Sci. Comput. 38(5), S461\u2013S484 (2016)","journal-title":"SIAM J. Sci. Comput."},{"key":"10036_CR25","doi-asserted-by":"crossref","unstructured":"Song, G., Wang, X., Ng, M.K.: Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion. J. Comput. Appl. Math. 421, 114866 (2023)","DOI":"10.1016\/j.cam.2022.114866"},{"issue":"6","key":"10036_CR26","doi-asserted-by":"publisher","first-page":"e2175","DOI":"10.1002\/nla.2175","volume":"25","author":"G Heidel","year":"2018","unstructured":"Heidel, G., Schulz, V.: A Riemannian trust-region method for low-rank tensor completion. Numer. Linear Algebra Appl. 25(6), e2175 (2018)","journal-title":"Numer. Linear Algebra Appl."},{"issue":"3","key":"10036_CR27","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."},{"key":"10036_CR28","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/j.laa.2015.07.021","volume":"485","author":"E. Kernfeld","year":"2015","unstructured":"Kernfeld, E.., Kilmer, M.., Aeron, S..: Tensor-tensor products with invertible linear transforms. Linear Algebra Appl. 485, 545\u2013570 (2015)","journal-title":"Linear Algebra Appl."},{"key":"10036_CR29","unstructured":"Xu, W. Zhao, X. Ng, M.: A fast algorithm for cosine transform based tensor singular value decomposition, arXiv:1902.03070"},{"issue":"3","key":"10036_CR30","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)","journal-title":"Linear Algebra Appl."},{"issue":"6","key":"10036_CR31","doi-asserted-by":"publisher","first-page":"1511","DOI":"10.1109\/TSP.2016.2639466","volume":"65","author":"Z Zhang","year":"2016","unstructured":"Zhang, Z., Aeron, S.: Exact tensor completion using t-svd. IEEE Trans. Signal Process. 65(6), 1511\u20131526 (2016)","journal-title":"IEEE Trans. Signal Process."},{"key":"10036_CR32","doi-asserted-by":"crossref","unstructured":"Absil, P.-A., Mahony, R., Sepulchre, R., Optimization algorithms on matrix manifolds, Princeton University Press, 2009","DOI":"10.1515\/9781400830244"},{"issue":"2","key":"10036_CR33","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","volume":"7","author":"R Fletcher","year":"1964","unstructured":"Fletcher, R., Reeves, C.M.: Function minimization by conjugate gradients. Comput. J. 7(2), 149\u2013154 (1964)","journal-title":"Comput. J."},{"issue":"R1","key":"10036_CR34","first-page":"35","volume":"3","author":"E. Polak","year":"1969","unstructured":"Polak, E.., Ribiere, G..: Note sur la convergence de m\u00e9thodes de directions conjugu\u00e9es. ESAIM Math. Model. Numer. Anal.-Mod\u00e9l. Math. Anal. Num\u00e9r. 3(R1), 35\u201343 (1969)","journal-title":"ESAIM Math. Model. Numer. Anal.-Mod\u00e9l. Math. Anal. Num\u00e9r."},{"issue":"1","key":"10036_CR35","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"Y Dai","year":"1999","unstructured":"Dai, Y., Yuan, Y.: A nonlinear conjugate gradient method with a strong global convergence property. SIAM J. Optim. 10(1), 177\u2013182 (1999)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"10036_CR36","first-page":"361","volume":"213","author":"N Andrei","year":"2009","unstructured":"Andrei, N.: Acceleration of conjugate gradient algorithms for unconstrained optimization. Appl. Math. Comput. 213(2), 361\u2013369 (2009)","journal-title":"Appl. Math. Comput."},{"issue":"12","key":"10036_CR37","doi-asserted-by":"publisher","first-page":"3397","DOI":"10.1016\/j.cam.2010.05.002","volume":"234","author":"N Andrei","year":"2010","unstructured":"Andrei, N.: New accelerated conjugate gradient algorithms as a modification of dai\u2013yuan computational scheme for unconstrained optimization. J. Comput. Appl. Math. 234(12), 3397\u20133410 (2010)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"10036_CR38","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1137\/11082885X","volume":"22","author":"W Ring","year":"2012","unstructured":"Ring, W., Wirth, B.: Optimization methods on Riemannian manifolds and their application to shape space. SIAM J. Optim. 22(2), 596\u2013627 (2012)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"10036_CR39","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1080\/02331934.2013.836650","volume":"64","author":"H Sato","year":"2015","unstructured":"Sato, H., Iwai, T.: A new, globally convergent Riemannian conjugate gradient method. Optimization. 64(4), 1011\u20131031 (2015)","journal-title":"Optimization."},{"issue":"1","key":"10036_CR40","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10589-015-9801-1","volume":"64","author":"H Sato","year":"2016","unstructured":"Sato, H.: A dai-yuan-type Riemannian conjugate gradient method with the weak wolfe conditions. Comput. Optim. Appl. 64(1), 101\u2013118 (2016)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"10036_CR41","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."}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-023-10036-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10444-023-10036-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-023-10036-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T09:14:37Z","timestamp":1687770877000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10444-023-10036-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["10036"],"URL":"https:\/\/doi.org\/10.1007\/s10444-023-10036-0","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6]]},"assertion":[{"value":"21 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2023","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 declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"41"}}