{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T21:04:48Z","timestamp":1778619888042,"version":"3.51.4"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T00:00:00Z","timestamp":1708992000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T00:00:00Z","timestamp":1708992000000},"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":["Comput Optim Appl"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s10589-024-00559-7","type":"journal-article","created":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T07:02:41Z","timestamp":1709017361000},"page":"443-468","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Riemannian preconditioned algorithms for tensor completion via tensor ring decomposition"],"prefix":"10.1007","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5290-4675","authenticated-orcid":false,"given":"Bin","family":"Gao","sequence":"first","affiliation":[]},{"given":"Renfeng","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Ya-xiang","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,27]]},"reference":[{"key":"559_CR1","volume-title":"Optimization Algorithms on Matrix Manifolds","author":"PA Absil","year":"2009","unstructured":"Absil, P.A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton (2009)"},{"issue":"1","key":"559_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.chemolab.2010.08.004","volume":"106","author":"E Acar","year":"2011","unstructured":"Acar, E., Dunlavy, D.M., Kolda, T.G., M\u00f8rup, M.: Scalable tensor factorizations for incomplete data. Chemomet. Intell. Lab. Syst. 106(1), 41\u201356 (2011). https:\/\/doi.org\/10.1016\/j.chemolab.2010.08.004","journal-title":"Chemomet. Intell. Lab. Syst."},{"issue":"1","key":"559_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0169-7439(98)00010-0","volume":"42","author":"CA Andersson","year":"1998","unstructured":"Andersson, C.A., Bro, R.: Improving the speed of multi-way algorithms: part I. Tucker3. Chemomet. Intell. Lab. Syst. 42(1), 93\u2013103 (1998). https:\/\/doi.org\/10.1016\/S0169-7439(98)00010-0","journal-title":"Chemomet. Intell. Lab. Syst."},{"issue":"1","key":"559_CR4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1137\/060676489","volume":"30","author":"BW Bader","year":"2008","unstructured":"Bader, B.W., Kolda, T.G.: Efficient MATLAB computations with sparse and factored tensors. SIAM J. Sci. Comput. 30(1), 205\u2013231 (2008). https:\/\/doi.org\/10.1137\/060676489","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"559_CR5","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two-point step size gradient methods. IMA J. Numer. Anal. 8(1), 141\u2013148 (1988). https:\/\/doi.org\/10.1093\/imanum\/8.1.141","journal-title":"IMA J. Numer. Anal."},{"key":"559_CR6","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":"1","key":"559_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/imanum\/drx080","volume":"39","author":"N Boumal","year":"2019","unstructured":"Boumal, N., Absil, P.A., Cartis, C.: Global rates of convergence for nonconvex optimization on manifolds. IMA J. Numer. Anal. 39(1), 1\u201333 (2019). https:\/\/doi.org\/10.1093\/imanum\/drx080","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"559_CR8","first-page":"1455","volume":"15","author":"N Boumal","year":"2014","unstructured":"Boumal, N., Mishra, B., Absil, P.A., Sepulchre, R.: Manopt, a Matlab toolbox for optimization on manifolds. J. Mach. Learn. Res. 15(1), 1455\u20131459 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"559_CR9","unstructured":"Cai, J.F., Huang, W., Wang, H., Wei, K.: Tensor completion via tensor train based low-rank quotient geometry under a preconditioned metric (2022). arXiv preprint arXiv:2209.04786"},{"issue":"5","key":"559_CR10","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). https:\/\/doi.org\/10.1109\/TIT.2010.2044061","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"559_CR11","doi-asserted-by":"publisher","first-page":"1416","DOI":"10.1137\/19M1270689","volume":"41","author":"Z Chen","year":"2020","unstructured":"Chen, Z., Li, Y., Lu, J.: Tensor ring decomposition: optimization landscape and one-loop convergence of alternating least squares. SIAM J. Matrix Anal. Appl. 41(3), 1416\u20131442 (2020). https:\/\/doi.org\/10.1137\/19M1270689","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"559_CR12","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1137\/21M1394734","volume":"43","author":"S Dong","year":"2022","unstructured":"Dong, S., Gao, B., Guan, Y., Glineur, F.: New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition. SIAM J. Matrix Anal. Appl. 43(2), 840\u2013866 (2022). https:\/\/doi.org\/10.1137\/21M1394734","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1967","key":"559_CR13","doi-asserted-by":"publisher","first-page":"20212483","DOI":"10.1098\/rspb.2021.2483","volume":"289","author":"DH Foster","year":"2022","unstructured":"Foster, D.H., Reeves, A.: Colour constancy failures expected in colourful environments. Proc. R. Soc. B 289(1967), 20212483 (2022). https:\/\/doi.org\/10.1098\/rspb.2021.2483","journal-title":"Proc. R. Soc. B"},{"issue":"3","key":"559_CR14","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1137\/19M1244172","volume":"11","author":"K Glau","year":"2020","unstructured":"Glau, K., Kressner, D., Statti, F.: Low-rank tensor approximation for Chebyshev interpolation in parametric option pricing. SIAM J. Financ. Math. 11(3), 897\u2013927 (2020). https:\/\/doi.org\/10.1137\/19M1244172","journal-title":"SIAM J. Financ. Math."},{"issue":"5","key":"559_CR15","doi-asserted-by":"publisher","first-page":"A2424","DOI":"10.1137\/130942401","volume":"37","author":"L Grasedyck","year":"2015","unstructured":"Grasedyck, L., Kluge, M., Kramer, S.: Variants of alternating least squares tensor completion in the tensor train format. SIAM J. Sci. Comput. 37(5), A2424\u2013A2450 (2015). https:\/\/doi.org\/10.1137\/130942401","journal-title":"SIAM J. Sci. Comput."},{"issue":"6","key":"559_CR16","doi-asserted-by":"publisher","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"MR Hestenes","year":"1952","unstructured":"Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Natl. Bur. Stand. 49(6), 409 (1952)","journal-title":"J. Res. Natl. Bur. Stand."},{"issue":"1","key":"559_CR17","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1093\/imanum\/drx015","volume":"38","author":"B Iannazzo","year":"2018","unstructured":"Iannazzo, B., Porcelli, M.: The Riemannian Barzilai\u2013Borwein method with nonmonotone line search and the matrix geometric mean computation. IMA J. Numer. Anal. 38(1), 495\u2013517 (2018). https:\/\/doi.org\/10.1093\/imanum\/drx015","journal-title":"IMA J. Numer. Anal."},{"key":"559_CR18","volume-title":"Advances in Neural Information Processing Systems","author":"P Jain","year":"2014","unstructured":"Jain, P., Oh, S.: Provable tensor factorization with missing data. In: Ghahramani, Z., Welling, M., Cortes, C., Lawrence, N., Weinberger, K. (eds.) Advances in Neural Information Processing Systems, vol. 27. Curran Associates Inc, New York (2014)"},{"key":"559_CR19","unstructured":"Kasai, H., Mishra, B.: Low-rank tensor completion: a Riemannian manifold preconditioning approach. In: Balcan, M.F., Weinberger, K.Q. (eds.) Proceedings of The 33rd International Conference on Machine Learning, Proceedings of Machine Learning Research, vol. 48, pp. 1012\u20131021. PMLR, New York, New York, USA (2016). https:\/\/proceedings.mlr.press\/v48\/kasai16.html"},{"key":"559_CR20","unstructured":"Keshavan, R., Montanari, A., Oh, S.: Matrix completion from noisy entries. Advances in neural information processing systems, vol. 22 (2009). https:\/\/proceedings.neurips.cc\/paper\/2009\/hash\/aa942ab2bfa6ebda4840e7360ce6e7ef-Abstract.html"},{"issue":"3","key":"559_CR21","doi-asserted-by":"publisher","first-page":"1261","DOI":"10.1137\/17M1154382","volume":"19","author":"Y Khoo","year":"2021","unstructured":"Khoo, Y., Lu, J., Ying, L.: Efficient construction of tensor ring representations from sampling. Multiscale Model. Simul. 19(3), 1261\u20131284 (2021). https:\/\/doi.org\/10.1137\/17M1154382","journal-title":"Multiscale Model. Simul."},{"issue":"3","key":"559_CR22","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). https:\/\/doi.org\/10.1137\/07070111X","journal-title":"SIAM Rev."},{"issue":"2","key":"559_CR23","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). https:\/\/doi.org\/10.1007\/s10543-013-0455-z","journal-title":"BIT Numer. Math."},{"issue":"1","key":"559_CR24","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). https:\/\/doi.org\/10.1109\/TPAMI.2012.39","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"559_CR25","unstructured":"Mishra, B., Apuroop, K.A., Sepulchre, R.: A Riemannian geometry for low-rank matrix completion (2012). arXiv preprint arXiv:1211.1550"},{"issue":"1","key":"559_CR26","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.laa.2009.07.024","volume":"432","author":"I Oseledets","year":"2010","unstructured":"Oseledets, I., Tyrtyshnikov, E.: TT-cross approximation for multidimensional arrays. Linear Algebra Appl. 432(1), 70\u201388 (2010). https:\/\/doi.org\/10.1016\/j.laa.2009.07.024","journal-title":"Linear Algebra Appl."},{"issue":"5","key":"559_CR27","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). https:\/\/doi.org\/10.1137\/090752286","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"559_CR28","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 analyses. SIAM J. Optim. 32(4), 2690\u20132717 (2022). https:\/\/doi.org\/10.1137\/21M1464178","journal-title":"SIAM J. Optim."},{"issue":"1","key":"559_CR29","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.aop.2010.09.012","volume":"326","author":"U Schollw\u00f6ck","year":"2011","unstructured":"Schollw\u00f6ck, U.: The density-matrix renormalization group in the age of matrix product states. Ann. Phys. 326(1), 96\u2013192 (2011). https:\/\/doi.org\/10.1016\/j.aop.2010.09.012","journal-title":"Ann. Phys."},{"key":"559_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2016.12.019","author":"A Sobral","year":"2016","unstructured":"Sobral, A., Zahzah, E.: Matrix and tensor completion algorithms for background model initialization: a comparative evaluation. Pattern Recognit. Lett. (2016). https:\/\/doi.org\/10.1016\/j.patrec.2016.12.019","journal-title":"Pattern Recognit. Lett."},{"key":"559_CR31","unstructured":"Srebro, N., Rennie, J., Jaakkola, T.: Maximum-margin matrix factorization. Advances in neural information processing systems, vol. 17 (2004). https:\/\/proceedings.neurips.cc\/paper\/2004\/file\/e0688d13958a19e087e123148555e4b4-Paper.pdf"},{"issue":"5","key":"559_CR32","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). https:\/\/doi.org\/10.1137\/15M1010506","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"559_CR33","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1080\/14789940801912366","volume":"57","author":"F Verstraete","year":"2008","unstructured":"Verstraete, F., Murg, V., Cirac, J.I.: Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems. Adv. Phys. 57(2), 143\u2013224 (2008). https:\/\/doi.org\/10.1080\/14789940801912366","journal-title":"Adv. Phys."},{"key":"559_CR34","doi-asserted-by":"publisher","unstructured":"Wang, W., Aggarwal, V., Aeron, S.: Efficient low rank tensor ring completion. In: Proceedings of the IEEE International Conference on Computer Vision, pp. 5697\u20135705 (2017). https:\/\/doi.org\/10.1109\/ICCV.2017.607","DOI":"10.1109\/ICCV.2017.607"},{"key":"559_CR35","doi-asserted-by":"publisher","unstructured":"Yuan, L., Cao, J., Zhao, X., Wu, Q., Zhao, Q.: Higher-dimension tensor completion via low-rank tensor ring decomposition. In: 2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC), pp. 1071\u20131076. IEEE (2018). https:\/\/doi.org\/10.23919\/APSIPA.2018.8659708","DOI":"10.23919\/APSIPA.2018.8659708"},{"key":"559_CR36","doi-asserted-by":"publisher","unstructured":"Zhao, Q., Sugiyama, M., Yuan, L., Cichocki, A.: Learning efficient tensor representations with ring-structured networks. In: ICASSP 2019-2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 8608\u20138612. IEEE (2019). https:\/\/doi.org\/10.1109\/ICASSP.2019.8682231","DOI":"10.1109\/ICASSP.2019.8682231"},{"key":"559_CR37","unstructured":"Zhao, Q., Zhou, G., Xie, S., Zhang, L., Cichocki, A.: Tensor ring decomposition (2016). arXiv preprint arXiv:1606.05535"},{"issue":"2","key":"559_CR38","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1137\/21M1429539","volume":"15","author":"X Zhao","year":"2022","unstructured":"Zhao, X., Bai, M., Sun, D., Zheng, L.: Robust tensor completion: equivalent surrogates, error bounds, and algorithms. SIAM J. Imaging Sci. 15(2), 625\u2013669 (2022). https:\/\/doi.org\/10.1137\/21M1429539","journal-title":"SIAM J. Imaging Sci."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00559-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-024-00559-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00559-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T16:09:18Z","timestamp":1715616558000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-024-00559-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,27]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["559"],"URL":"https:\/\/doi.org\/10.1007\/s10589-024-00559-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,27]]},"assertion":[{"value":"6 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2024","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 that the data supporting the findings of this study are available within the paper. The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}}]}}