{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T15:08:52Z","timestamp":1774624132507,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T00:00:00Z","timestamp":1770595200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T00:00:00Z","timestamp":1770595200000},"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":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s12190-025-02740-5","type":"journal-article","created":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T14:18:06Z","timestamp":1770646686000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bilevel optimization for tensor completion with noise"],"prefix":"10.1007","volume":"72","author":[{"given":"Chuanlong","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rongrong","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaru","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,9]]},"reference":[{"key":"2740_CR1","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H. Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the kurdyka-\u0142ojasiewicz inequality. Math. Oper. Res. 35, 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"key":"2740_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H. Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms forward-backward splitting, and regularized gaussc-seidel methods. Math. Program. 137, 91\u2013129 (2013)","journal-title":"Math. Program."},{"key":"2740_CR3","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J. Cai","year":"2010","unstructured":"Cai, J., Cand\u00e8s, E.J., Shen: Z.W.: a singular value thresholding algorithm for matrix completion. SIAM J. Optimiz. 20, 1956\u20131982 (2010)","journal-title":"SIAM J. Optimiz."},{"key":"2740_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.aim.2020.107128","volume":"367","author":"P. Comon","year":"2020","unstructured":"Comon, P., Lim, L.H., Qi, Y., Ye, K.: Topology of tensor ranks. Adv. Math. 367, 107\u2013128 (2020)","journal-title":"Adv. Math."},{"key":"2740_CR5","doi-asserted-by":"crossref","unstructured":"Cand\u00e8s, E.J., Plan, Y.: Matrix completion with noise. In: Proc. IEEE, vol. 98, pp. 925\u2013936. (2010)","DOI":"10.1109\/JPROC.2009.2035722"},{"issue":"x","key":"2740_CR6","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"E.J. Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9(x), 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"issue":"1","key":"2740_CR7","first-page":"1","volume":"31","author":"J.H. Chen","year":"2023","unstructured":"Chen, J.H., Huang, W.: An iterative algorithm for low-rank tensor completion problem with sparse noise and missing values. Numer. Linear Algebra Appl. 31(1), 1\u201324 (2023)","journal-title":"Numer. Linear Algebra Appl."},{"key":"2740_CR8","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, A2424\u2013A2450 (2015)","journal-title":"SIAM J. Sci. Comput."},{"key":"2740_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1002\/gamm.201310004","volume":"1","author":"L. Grasedyck","year":"2013","unstructured":"Grasedyck, L., Kressner, D., Tobler, C.: A literature survey of low-rank tensor approximation techniques. GAMM-Mitteilungen 1, 53\u201378 (2013)","journal-title":"GAMM-Mitteilungen"},{"key":"2740_CR10","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 Probl. 27, 025010 (2011)","journal-title":"Inverse Probl."},{"key":"2740_CR11","unstructured":"Golub, G.H., Van Loan, C.F.: 4th edn. Matrix Computations. Johns Hopkins University Press, Baltimore (2013)"},{"key":"2740_CR12","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s11063-016-9503-4","volume":"45","author":"Z.F. Han","year":"2017","unstructured":"Han, Z.F., Leung, C.S., Huang, L.T., So, H.C.: Sparse and truncated nuclear norm based tensor completion. Neural Process. Lett. 45, 729\u2013743 (2017)","journal-title":"Neural Process. Lett."},{"key":"2740_CR13","first-page":"2057","volume":"99","author":"R. Keshavan","year":"2010","unstructured":"Keshavan, R., Montanari, A., Oh, S.: Matrix completion from noisy entries. J. Mach. Learn. Res. 99, 2057\u20132078 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"2740_CR14","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"T.G. Kolda","year":"2009","unstructured":"Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51, 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"key":"2740_CR15","doi-asserted-by":"publisher","first-page":"A3812","DOI":"10.1137\/19M1306518","volume":"42","author":"Y. Kapushev","year":"2020","unstructured":"Kapushev, Y., Oseledets, I., Burnaev, E.: Tensor completion via gaussian process-based initialization. SIAM J. Sci. Comput. 42, A3812\u2013A3824 (2020)","journal-title":"SIAM J. Sci. Comput."},{"key":"2740_CR16","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, 447\u2013468 (2014)","journal-title":"BIT Numer. Math."},{"key":"2740_CR17","doi-asserted-by":"publisher","first-page":"104406","DOI":"10.1016\/j.jvcir.2025.104406","volume":"107","author":"B.Y. Li","year":"2025","unstructured":"Li, B.Y., Fan, Y.L., Zhang, W.D.: Song Y.: a two-step enhanced tensor denoising framework based on noise position prior and adaptive ring rank. J. Vis. Commun. Image. R. 107, 104406\u2013104406 (2025)","journal-title":"J. Vis. Commun. Image. R."},{"key":"2740_CR18","doi-asserted-by":"crossref","unstructured":"Liang, D., Min: H.W.: a projected gradient method for $$\\alpha l_1- \\beta l_2$$ sparsity regularization. Inverse Probl. 36, 125012 (2020)","DOI":"10.1088\/1361-6420\/abc857"},{"key":"2740_CR19","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 T. Pattern Anal. 35, 208\u2013220 (2013)","journal-title":"IEEE T. Pattern Anal."},{"key":"2740_CR20","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1007\/s10208-017-9366-8","volume":"18","author":"G.Y. Li","year":"2018","unstructured":"Li, G.Y., Pong, T.K.: Calculus of the exponent of kurdyka-\u0142ojasiewicz inequality and its applications to linear convergence of first-order methods. Found. Comput. Math. 18, 1199\u20131232 (2018)","journal-title":"Found. Comput. Math."},{"key":"2740_CR21","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10589-019-00067-z","volume":"73","author":"T.X. Liu","year":"2019","unstructured":"Liu, T.X., Pong, T.K., Takeda, A.: A refined convergence analysis of pDCAe with applications to simultaneous sparse recovery and outlier detection. Comput. Optim. Appl. 73, 69\u2013100 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"2740_CR22","doi-asserted-by":"crossref","unstructured":"Mu, C., Huang, B., Wright, J., Goldfarb, D.: Square deal: lower bounds and improved relaxations for tensor recovery. In: International conference on machine learning, vol. 32, pp. 73\u201381. (2014)","DOI":"10.1109\/ICCV.2015.17"},{"key":"2740_CR23","doi-asserted-by":"publisher","first-page":"3367","DOI":"10.1109\/TGRS.2017.2670021","volume":"55","author":"M.K.P. Ng","year":"2017","unstructured":"Ng, M.K.P., Yuan, Q., Yan, L., Sun, J.: An adaptive weighted tensor completion method for the recovery of remote sensing images with missing data. IEEE Trans. Geosci. Remote Sens. 55, 3367\u20133381 (2017)","journal-title":"IEEE Trans. Geosci. Remote Sens."},{"key":"2740_CR24","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1109\/TNNLS.2022.3181378","volume":"35","author":"Y. Qiu","year":"2024","unstructured":"Qiu, Y., Zhou, G., Zhao, Q., Xie, S.: Noisy tensor completion via low-rank tensor ring. IEEE Trans. Neural Netw. Learn. Syst. 35, 1127\u20131141 (2024)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"2740_CR25","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/TAP.1986.1143830","volume":"34","author":"R. Schmidt","year":"1986","unstructured":"Schmidt, R.: Multiple emitter location and signal parameter estimation. IEEE T. Antenn. Propag. 34, 276\u2013280 (1986)","journal-title":"IEEE T. Antenn. Propag."},{"key":"2740_CR26","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/BF02290601","volume":"34","author":"L.R. Tucker","year":"1969","unstructured":"Tucker, L.R., Koopman, R.F., Linn, R.L.: Evaluation of factor analytic research procedures by means of simulated correlation matrices. Psychometrika 34, 421\u2013459 (1969)","journal-title":"Psychometrika"},{"key":"2740_CR27","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1109\/MSP.2008.930649","volume":"26","author":"Z. Wang","year":"2009","unstructured":"Wang, Z., Bovik, A.C.: Mean square error: love it or leave it? A new look at signal fidelity measures. IEEE Signal Process. Mag. 26, 98\u2013117 (2009)","journal-title":"IEEE Signal Process. Mag."},{"issue":"12","key":"2740_CR28","doi-asserted-by":"publisher","first-page":"3430","DOI":"10.1049\/ipr2.13184","volume":"18","author":"M. Wang","year":"2024","unstructured":"Wang, M., Chen, Z.Y., Zhang, S.Y.: A robust low-rank tensor completion model with sparse noise for higher-order data recovery. IET Image Process. 18(12), 3430\u20133446 (2024)","journal-title":"IET Image Process."},{"key":"2740_CR29","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, 600\u2013612 (2004)","journal-title":"IEEE Trans. Image Process."},{"key":"2740_CR30","first-page":"1","volume":"55","author":"C.L. Wang","year":"2025","unstructured":"Wang, C.L., Zhong, L.J., Yan, X.H.: Bilevel models and algorithms based on Tucker rank for tensor completion. Sci. Sin. Math. (in Chin.). 55, 1\u201314 (2025)","journal-title":"Sci. Sin. Math. (in Chin.)."},{"key":"2740_CR31","volume-title":"Matrix Computation Six Lectures (in Chinese)","author":"S.F. Xu","year":"2011","unstructured":"Xu, S.F., Qian, J.: Matrix Computation Six Lectures (in Chinese). Higher Education Press (2011)"},{"key":"2740_CR32","doi-asserted-by":"publisher","first-page":"15669","DOI":"10.1109\/ACCESS.2019.2894622","volume":"7","author":"T. Yokota","year":"2019","unstructured":"Yokota, T., Hontani, H.: Simultaneous tensor completion and denoising by noise inequality constrained convex optimization. IEEE Access 7, 15669\u201315682 (2019)","journal-title":"IEEE Access"},{"key":"2740_CR33","doi-asserted-by":"crossref","unstructured":"Yuan, L.H., Li, C., Mandic, D., Cao, J.T., Zhao, Q.B.: Tensor ring decomposition with rank minimization on latent space: an efficient approach for tensor completion. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 9151\u20139158. (2019)","DOI":"10.1609\/aaai.v33i01.33019151"},{"key":"2740_CR34","first-page":"689","volume":"40","author":"X.H. Yan","year":"2023","unstructured":"Yan, X.H., Li, H., Guo, X.W., Xu, Y.: A new random algorithm for low rank tensor completion (in Chinese). Acta. Math. Appl. Sin-E. 40, 689\u2013704 (2023)","journal-title":"Acta. Math. Appl. Sin-E."},{"key":"2740_CR35","doi-asserted-by":"crossref","unstructured":"Yu, J., Li, C., Zhao, Q., Zhao, G.: Tensor-ring nuclear norm minimization and application for visual: data completion. In: ICASSP 2019 \u2013 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 3142\u20133146. Brighton, UK (2019)","DOI":"10.1109\/ICASSP.2019.8683115"},{"key":"2740_CR36","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 T. Signal Proces. 65, 1511\u20131526 (2016)","journal-title":"IEEE T. Signal Proces."},{"key":"2740_CR37","unstructured":"Zhao, Q., Zhou, G., Xie, S., Zhang, L., Cichocki, A.: Tensor ring decomposition. arXiv preprint arXiv:1606.05535 (2016)"}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-025-02740-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-025-02740-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-025-02740-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T14:06:58Z","timestamp":1774620418000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-025-02740-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,9]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["2740"],"URL":"https:\/\/doi.org\/10.1007\/s12190-025-02740-5","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,9]]},"assertion":[{"value":"4 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 December 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2026","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 have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"121"}}