{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:19:11Z","timestamp":1757618351149,"version":"3.44.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T00:00:00Z","timestamp":1749686400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T00:00:00Z","timestamp":1749686400000},"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":["12361079; 12201149; 62462018; 12261026"],"award-info":[{"award-number":["12361079; 12201149; 62462018; 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":["2023GXNSFAA026067; 2024GXNSFAA010521"],"award-info":[{"award-number":["2023GXNSFAA026067; 2024GXNSFAA010521"]}],"id":[{"id":"10.13039\/501100004607","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s10915-025-02956-4","type":"journal-article","created":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T00:49:13Z","timestamp":1749689353000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Riemannian Accelerated Spectral Conjugate Gradient Method for the Tensor Completion Arising in the Color Image Restoration"],"prefix":"10.1007","volume":"104","author":[{"given":"Xue-Feng","family":"Duan","sequence":"first","affiliation":[]},{"given":"Hui-Yan","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Yu-Xing","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Qing-Wen","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,12]]},"reference":[{"issue":"4","key":"2956_CR1","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1109\/LSP.2013.2245416","volume":"20","author":"Y Liu","year":"2013","unstructured":"Liu, Y., Shang, F.: An efficient matrix factorization method for tensor completion. IEEE Signal Process. Lett. 20(4), 307\u2013310 (2013)","journal-title":"IEEE Signal Process. Lett."},{"issue":"1","key":"2956_CR2","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."},{"key":"2956_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2024.109407","volume":"219","author":"X Cheng","year":"2024","unstructured":"Cheng, X., Kong, W., Luo, X., Qin, W., Zhang, F., Wang, J.: Tensor completion via joint reweighted tensor Q-nuclear norm for visual data recovery. Signal Process. 219, 109407 (2024)","journal-title":"Signal Process."},{"issue":"2","key":"2956_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10092-024-00569-1","volume":"61","author":"R Li","year":"2024","unstructured":"Li, R., Zheng, B.: Tensor completion via multi-directional partial tensor nuclear norm with total variation regularization. Calcolo 61(2), 19\u201361 (2024)","journal-title":"Calcolo"},{"issue":"4","key":"2956_CR5","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. Signal Process. 10(4), 608\u2013622 (2016)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"issue":"3","key":"2956_CR6","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":"4","key":"2956_CR7","doi-asserted-by":"publisher","first-page":"1678","DOI":"10.1109\/TIP.2014.2305840","volume":"23","author":"O Semerci","year":"2014","unstructured":"Semerci, O., Hao, N., Kilmer, M.E., Miller, E.L.: Tensor-based formulation and nuclear norm regularization for multienergy computed tomography. IEEE Trans. Image Process. 23(4), 1678\u20131693 (2014)","journal-title":"IEEE Trans. Image Process."},{"key":"2956_CR8","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: Proc. IEEE Conf. Comput. Vis. and Pattern Recognit., pp. 3842\u20133849 (2014)","DOI":"10.1109\/CVPR.2014.485"},{"key":"2956_CR9","first-page":"62","volume":"73","author":"WH Xu","year":"2019","unstructured":"Xu, W.H., Zhao, X.L., Ji, T.Y., Miao, J.Q., Ma, T.H., Wang, S., Huang, T.Z.: Laplace function based nonconvex surrogate for low-rank tensor completion. Signal Process: Image 73, 62\u201369 (2019)","journal-title":"Signal Process: Image"},{"key":"2956_CR10","doi-asserted-by":"crossref","unstructured":"Kang, Z., Peng, C., Cheng, Q.: Top-n recommender system via matrix completion. In: Proc. AAAI Conf. Artif. Intell. vol. 30 (2016)","DOI":"10.1609\/aaai.v30i1.9967"},{"issue":"3","key":"2956_CR11","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."},{"key":"2956_CR12","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1016\/j.ins.2023.02.012","volume":"629","author":"F Wu","year":"2023","unstructured":"Wu, F., Li, C., Li, Y., Tang, N.: Robust low-rank tensor completion via new regularized model with approximate SVD. Inform. Sciences 629, 646\u2013666 (2023)","journal-title":"Inform. Sciences"},{"key":"2956_CR13","doi-asserted-by":"crossref","unstructured":"Tian, J., Zhu, Y., Liu, J.: A general multi-factor norm based low-rank tensor completion framework. Appl. Intell. pp. 1\u201321 (2023)","DOI":"10.1007\/s10489-023-04477-9"},{"key":"2956_CR14","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1109\/ACCESS.2017.2770146","volume":"6","author":"L Wang","year":"2017","unstructured":"Wang, L., Xie, K., Semong, T., Zhou, H.: Missing data recovery based on tensor-CUR decomposition. IEEE Access 6, 532\u2013544 (2017)","journal-title":"IEEE Access"},{"issue":"1","key":"2956_CR15","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10957-023-02287-0","volume":"199","author":"Q Yu","year":"2023","unstructured":"Yu, Q., Zhang, X., Huang, Z.H.: Tensor factorization-based method for tensor completion with spatio-temporal characterization. J. Optim. Theory Appl. 199(1), 337\u2013362 (2023)","journal-title":"J. Optim. Theory Appl."},{"key":"2956_CR16","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.neucom.2021.06.020","volume":"458","author":"S Du","year":"2021","unstructured":"Du, S., Xiao, Q., Shi, Y., Cucchiara, R., Ma, Y.: Unifying tensor factorization and tensor nuclear norm approaches for low-rank tensor completion. Neurocomputing 458, 204\u2013218 (2021)","journal-title":"Neurocomputing"},{"key":"2956_CR17","doi-asserted-by":"crossref","unstructured":"Cheng, M., Jing, L., Ng, M.K.: A weighted tensor factorization method for low-rank tensor completion. In: 2019 IEEE 5th Int. Conf. BigMM, pp. 30\u201338 (2019)","DOI":"10.1109\/BigMM.2019.00-45"},{"issue":"1","key":"2956_CR18","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1137\/090768813","volume":"32","author":"B He","year":"2011","unstructured":"He, B., Xu, M., Yuan, X.: Solving large-scale least squares semidefinite programming by alternating direction methods. SIAM J. Matrix Anal. Appl. 32(1), 136\u2013152 (2011)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"6","key":"2956_CR19","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1080\/00207160.2020.1812585","volume":"98","author":"MT Chao","year":"2021","unstructured":"Chao, M.T., Zhang, Y., Jian, J.B.: An inertial proximal alternating direction method of multipliers for nonconvex optimization. Int. J. Comput. Math. 98(6), 1199\u20131217 (2021)","journal-title":"Int. J. Comput. Math."},{"key":"2956_CR20","doi-asserted-by":"crossref","unstructured":"Yue, G., Sun, Z., Fan, J.: Tensor-based traffic recovery of industrial network by BCD-inspired neural approximation to latent nonlinearity and sparsity. IEEE Trans. Emerging Top. Comput. Intell. pp. 300\u2013312 (2023)","DOI":"10.1109\/TETCI.2023.3300522"},{"key":"2956_CR21","doi-asserted-by":"crossref","unstructured":"Zhang, X., Zhou, Z., Wang, D., Ma, Y.: Hybrid singular value thresholding for tensor completion. In: Proc. AAAI Conf. Artif. Intell., vol. 28 (2014)","DOI":"10.1609\/aaai.v28i1.8898"},{"issue":"2","key":"2956_CR22","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."},{"issue":"2","key":"2956_CR23","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60(2), 223\u2013311 (2018)","journal-title":"SIAM Rev."},{"key":"2956_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10444-021-09855-w","volume":"47","author":"JF Li","year":"2021","unstructured":"Li, J.F., Li, W., Duan, X.F., Xiao, M.: Newton\u2019s method for the parameterized generalized eigenvalue problem with nonsquare matrix pencils. Adv. Comput. Math. 47, 1\u201350 (2021)","journal-title":"Adv. Comput. Math."},{"key":"2956_CR25","unstructured":"Zhang, H., Reddi, S.J., Sra, S.: Riemannian SVRG: Fast stochastic optimization on Riemannian manifolds. In: Adv. Neur. Inf. Proc. Syst., vol. 29 (2016)"},{"issue":"2","key":"2956_CR26","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":"3","key":"2956_CR27","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10444-023-10036-0","volume":"49","author":"SQ Duan","year":"2023","unstructured":"Duan, S.Q., Duan, X.F., Li, C.M., Li, J.F.: Riemannian conjugate gradient method for low-rank tensor completion. Adv. Comput. Math. 49(3), 41\u201364 (2023)","journal-title":"Adv. Comput. Math."},{"issue":"6","key":"2956_CR28","doi-asserted-by":"publisher","first-page":"1","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), 1\u201317 (2018)","journal-title":"Numer. Linear Algebra Appl."},{"key":"2956_CR29","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."},{"issue":"6","key":"2956_CR30","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":"2956_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2022.114866","volume":"421","author":"GJ Song","year":"2023","unstructured":"Song, G.J., Wang, X.Z., Ng, M.K.: Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion. J. Comput. Appl. Math. 421, 114866 (2023)","journal-title":"J. Comput. Appl. Math."},{"key":"2956_CR32","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830244","volume-title":"Optimization Algorithms on Matrix Manifolds","author":"PA Absil","year":"2008","unstructured":"Absil, P.A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton (2008)"},{"issue":"1","key":"2956_CR33","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/100802529","volume":"22","author":"PA Absil","year":"2012","unstructured":"Absil, P.A., Malick, J.: Projection-like retractions on matrix manifolds. SIAM J. Optim. 22(1), 135\u2013158 (2012)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2956_CR34","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2299","volume":"27","author":"G Song","year":"2020","unstructured":"Song, G., Ng, M.K., Zhang, X.: Robust tensor completion using transformed tensor singular value decomposition. Numer. Linear Algebra Appl. 27(3), e2299 (2020)","journal-title":"Numer. Linear Algebra Appl."},{"issue":"2","key":"2956_CR35","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":"4","key":"2956_CR36","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","volume":"9","author":"BT Polyak","year":"1969","unstructured":"Polyak, B.T.: The conjugate gradient method in extremal problems. USSR Comput. Math. and Math. Phys. 9(4), 94\u2013112 (1969)","journal-title":"USSR Comput. Math. and Math. Phys."},{"issue":"2","key":"2956_CR37","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."},{"key":"2956_CR38","doi-asserted-by":"publisher","DOI":"10.1017\/9781009166164","volume-title":"An Introduction to Optimization on Smooth Manifolds","author":"N Boumal","year":"2023","unstructured":"Boumal, N.: An Introduction to Optimization on Smooth Manifolds. Cambridge University Press, Cambridge (2023)"},{"issue":"4","key":"2956_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":"2","key":"2956_CR40","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":"2956_CR41","doi-asserted-by":"publisher","first-page":"2690","DOI":"10.1137\/21M1464178","volume":"32","author":"H Sato","year":"2022","unstructured":"Sato, H.: Riemannian conjugate gradient methods: General framework and specific algorithms with convergence analysis. SIAM J. Optim. 32(4), 2690\u20132717 (2022)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2956_CR42","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":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02956-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-025-02956-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02956-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T19:25:27Z","timestamp":1757186727000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-025-02956-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,12]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["2956"],"URL":"https:\/\/doi.org\/10.1007\/s10915-025-02956-4","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2025,6,12]]},"assertion":[{"value":"4 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2025","order":4,"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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"43"}}