{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T04:07:44Z","timestamp":1742011664285,"version":"3.38.0"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T00:00:00Z","timestamp":1736553600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T00:00:00Z","timestamp":1736553600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Center for Theoretical Sciences of Taiwan"},{"DOI":"10.13039\/100020595","name":"National Science and Technology Council of Taiwan","doi-asserted-by":"crossref","award":["112-2628-M-006-009-MY4"],"award-info":[{"award-number":["112-2628-M-006-009-MY4"]}],"id":[{"id":"10.13039\/100020595","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s40314-024-03073-y","type":"journal-article","created":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T16:11:07Z","timestamp":1736611867000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A modified spectral projected gradient method for tensor approximations over closed convex sets"],"prefix":"10.1007","volume":"44","author":[{"given":"Matthew M.","family":"Lin","sequence":"first","affiliation":[]},{"given":"Chieu Thanh","family":"Nguyen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,11]]},"reference":[{"key":"3073_CR1","doi-asserted-by":"publisher","unstructured":"Acar E, Aykut-Bingol C, Bingol H, Bro R, Yener B (2007) Multiway analysis of epilepsy tensors. Bioinformatics 23(13):10\u201318. https:\/\/doi.org\/10.1093\/bioinformatics\/btm210https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/23\/13\/i10\/23706936\/btm210.pdf","DOI":"10.1093\/bioinformatics\/btm210"},{"key":"3073_CR2","unstructured":"Bader BW, Kolda TG et al (2021) Tensor toolbox for MATLAB, development version 3.2.1, available online at https:\/\/www.tensortoolbox.org"},{"issue":"1","key":"3073_CR3","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 JM (1988) Two-point step size gradient methods. IMA J Numer Anal 8(1):141\u2013148. https:\/\/doi.org\/10.1093\/imanum\/8.1.141","journal-title":"IMA J Numer Anal"},{"key":"3073_CR4","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1137\/17M1112303","volume":"39","author":"C Battaglino","year":"2018","unstructured":"Battaglino C, Ballard G, Kolda TG (2018) A practical randomized cp tensor decomposition. SIAM J Matrix Anal Appl 39:2. https:\/\/doi.org\/10.1137\/17M1112303","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"1","key":"3073_CR5","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.neuroimage.2004.10.043","volume":"25","author":"CF Beckmann","year":"2005","unstructured":"Beckmann CF, Smith SM (2005) Tensorial extensions of independent component analysis for multisubject FMRI analysis. Neuroimage 25(1):294\u2013311. https:\/\/doi.org\/10.1016\/j.neuroimage.2004.10.043","journal-title":"Neuroimage"},{"issue":"1","key":"3073_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10543-021-00876-x","volume":"62","author":"E Begovi\u0107 Kova\u010d","year":"2022","unstructured":"Begovi\u0107 Kova\u010d E (2022) Hybrid CUR-type decomposition of tensors in the Tucker format. BIT 62(1):125\u2013138. https:\/\/doi.org\/10.1007\/s10543-021-00876-x","journal-title":"BIT"},{"key":"3073_CR7","unstructured":"Bertsekas DP (1999) Nonlinear programming, 2nd edn. Athena Scientific Optimization and Computation Series, p. 777. Athena Scientific, Belmont"},{"key":"3073_CR8","doi-asserted-by":"publisher","unstructured":"Birgin EG, Mart\u00ednez JM (2014) Practical Augmented Lagrangian Methods for Constrained Optimization. Fundamentals of Algorithms, vol. 10, p. 220. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA. https:\/\/doi.org\/10.1137\/1.9781611973365","DOI":"10.1137\/1.9781611973365"},{"issue":"4","key":"3073_CR9","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"EG Birgin","year":"2000","unstructured":"Birgin EG, Mart\u00ednez JM, Raydan M (2000) Nonmonotone spectral projected gradient methods on convex sets. SIAM J Optim 10(4):1196\u20131211. https:\/\/doi.org\/10.1137\/S1052623497330963","journal-title":"SIAM J Optim"},{"issue":"3","key":"3073_CR10","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1145\/502800.502803","volume":"27","author":"EG Birgin","year":"2001","unstructured":"Birgin EG, Mart\u00ednez JM, Raydan M (2001) Algorithm 813: SPG\u2014software for convex-constrained optimization. ACM Trans Math Softw (TOMS) 27(3):340\u2013349","journal-title":"ACM Trans Math Softw (TOMS)"},{"issue":"4","key":"3073_CR11","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1093\/imanum\/23.4.539","volume":"23","author":"EG Birgin","year":"2003","unstructured":"Birgin EG, Mart\u00ednez JM, Raydan M (2003) Inexact spectral projected gradient methods on convex sets. IMA J Numer Anal 23(4):539\u2013559. https:\/\/doi.org\/10.1093\/imanum\/23.4.539","journal-title":"IMA J Numer Anal"},{"issue":"3\u20134","key":"3073_CR12","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1080\/10408340600969965","volume":"36","author":"R Bro","year":"2006","unstructured":"Bro R (2006) Review on multiway analysis in chemistry-2000-2005. Crit Rev Anal Chem 36(3\u20134):279\u2013293. https:\/\/doi.org\/10.1080\/10408340600969965","journal-title":"Crit Rev Anal Chem"},{"key":"3073_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10898-024-01374-4","volume":"89","author":"M Che","year":"2024","unstructured":"Che M, Wei Y, Yan H (2024) Sketch-based multiplicative updating algorithms for symmetric nonnegative tensor factorizations with applications to face image clustering. J Global Optim 89:1\u201338. https:\/\/doi.org\/10.1007\/s10898-024-01374-4","journal-title":"J Global Optim"},{"issue":"6","key":"3073_CR14","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1080\/01630563.2022.2056198","volume":"43","author":"J Chen","year":"2022","unstructured":"Chen J, Wei Y, Xu Y (2022) Tensor CUR decomposition under T-product and its perturbation. Numer Funct Anal Optim 43(6):698\u2013722. https:\/\/doi.org\/10.1080\/01630563.2022.2056198","journal-title":"Numer Funct Anal Optim"},{"key":"3073_CR15","doi-asserted-by":"publisher","unstructured":"Che M, Wei Y (2020) Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications. J Sci Comput 83. https:\/\/doi.org\/10.1007\/s10915-020-01233-w","DOI":"10.1007\/s10915-020-01233-w"},{"issue":"2","key":"3073_CR16","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1023\/A:1013653923062","volume":"112","author":"YH Dai","year":"2002","unstructured":"Dai YH (2002) On the nonmonotone line search. J Optim Theory Appl 112(2):315\u2013330. https:\/\/doi.org\/10.1023\/A:1013653923062","journal-title":"J Optim Theory Appl"},{"issue":"2","key":"3073_CR17","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 (2022) New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition. SIAM J Matrix Anal Appl 43(2):840\u2013866. https:\/\/doi.org\/10.1137\/21M1394734","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"2","key":"3073_CR18","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/s11045-021-00818-4","volume":"33","author":"K EL Qate","year":"2022","unstructured":"EL Qate K, El Rhabi M, Hakim A, Moreau E, Thirion-Moreau N (2022) A Primal-Dual algorithm for nonnegative $$N$$-th order CP tensor decomposition: application to fluorescence spectroscopy data analysis. Multidimens Syst Signal Process 33(2):665\u2013682. https:\/\/doi.org\/10.1007\/s11045-021-00818-4","journal-title":"Multidimens Syst Signal Process"},{"key":"3073_CR19","doi-asserted-by":"publisher","unstructured":"Farias RC, Comon P, Redon R (2014) Data mining by nonnegative tensor approximation. In: 2014 IEEE International Workshop on Machine Learning for Signal Processing (MLSP), pp. 1\u20136 . https:\/\/doi.org\/10.1109\/MLSP.2014.6958900","DOI":"10.1109\/MLSP.2014.6958900"},{"key":"3073_CR20","doi-asserted-by":"publisher","unstructured":"Fu X, Gao C, Wai H-T, Huang K (2019) Block-randomized stochastic proximal gradient for constrained low-rank tensor factorization. In: ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 7485\u20137489 . https:\/\/doi.org\/10.1109\/ICASSP.2019.8682465","DOI":"10.1109\/ICASSP.2019.8682465"},{"issue":"2","key":"3073_CR21","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1137\/S1052623400380365","volume":"12","author":"M Fukushima","year":"2001","unstructured":"Fukushima M, Luo Z-Q (2001) Tseng P Smoothing functions for second-order-cone complementarity problems. SIAM J Optim 12(2):436\u2013460. https:\/\/doi.org\/10.1137\/S1052623400380365","journal-title":"SIAM J Optim"},{"issue":"2","key":"3073_CR22","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/s10107-020-01579-x","volume":"193","author":"R Ge","year":"2022","unstructured":"Ge R, Ma T (2022) On the optimization landscape of tensor decompositions. Math Progr 193(2):713\u2013759. https:\/\/doi.org\/10.1007\/s10107-020-01579-x","journal-title":"Math Progr"},{"issue":"4","key":"3073_CR23","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo L, Lampariello F, Lucidi S (1986) A nonmonotone line search technique for Newton\u2019s method. SIAM J Numer Anal 23(4):707\u2013716. https:\/\/doi.org\/10.1137\/0723046","journal-title":"SIAM J Numer Anal"},{"issue":"1\u20132","key":"3073_CR24","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10994-009-5159-x","volume":"79","author":"DR Hardoon","year":"2010","unstructured":"Hardoon DR, Shawe-Taylor J (2010) Decomposing the tensor kernel support vector machine for neuroscience data with structured labels. Mach Learn 79(1\u20132):29\u201346. https:\/\/doi.org\/10.1007\/s10994-009-5159-x","journal-title":"Mach Learn"},{"issue":"4","key":"3073_CR25","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/0196-6774(90)90014-6","volume":"11","author":"J H\u00e5stad","year":"1990","unstructured":"H\u00e5stad J (1990) Tensor rank is NP-complete. J Algor 11(4):644\u2013654. https:\/\/doi.org\/10.1016\/0196-6774(90)90014-6","journal-title":"J Algor"},{"issue":"3","key":"3073_CR26","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1142\/S0219530520400084","volume":"19","author":"Z-H He","year":"2021","unstructured":"He Z-H, Chen C, Wang X-X (2021) A simultaneous decomposition for three quaternion tensors with applications in color video signal processing. Anal Appl (Singap) 19(3):529\u2013549. https:\/\/doi.org\/10.1142\/S0219530520400084","journal-title":"Anal Appl (Singap)"},{"issue":"6","key":"3073_CR27","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1080\/03081080701251280","volume":"55","author":"R Hildebrand","year":"2007","unstructured":"Hildebrand R (2007) Positive maps of second-order cones. Linear Multilinear Algebra 55(6):575\u2013597. https:\/\/doi.org\/10.1080\/03081080701251280","journal-title":"Linear Multilinear Algebra"},{"issue":"6","key":"3073_CR28","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/2512329","volume":"60","author":"CJ Hillar","year":"2013","unstructured":"Hillar CJ, Lim L-H (2013) Most tensor problems are NP-hard. J ACM 60(6):45\u201339. https:\/\/doi.org\/10.1145\/2512329","journal-title":"J ACM"},{"key":"3073_CR29","doi-asserted-by":"publisher","unstructured":"Kelley CT (1995) Iterative methods for linear and nonlinear equations. Frontiers in Applied Mathematics, vol. 16, p. 165. SIAM, Philadelphia. https:\/\/doi.org\/10.1137\/1.9781611970944","DOI":"10.1137\/1.9781611970944"},{"key":"3073_CR30","unstructured":"Knuth DE (1998) The Art of Computer Programming. Vol. 2, p. 762. Addison-Wesley, Reading. Seminumerical algorithms, Third edition [of MR0286318]"},{"key":"3073_CR31","doi-asserted-by":"publisher","unstructured":"Koldovsky Z, Tichavsky P (2006) Methods of fair comparison of performance of linear ica techniques in presence of additive noise. In: 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings, vol. 5, p. https:\/\/doi.org\/10.1109\/ICASSP.2006.1661415","DOI":"10.1109\/ICASSP.2006.1661415"},{"key":"3073_CR32","unstructured":"Krijnen WP, MF, TBJ (1991) Contrastvrije oplossingen van het CANDECOMP\/PARAFAC-model. Kwantitatieve Methoden 12(37), 87\u201396"},{"key":"3073_CR33","doi-asserted-by":"publisher","unstructured":"Lim L-H, Comon P (2009) Nonnegative approximations of nonnegative tensors. Journal of Chemometrics 23(7\u20138):432\u2013441. https:\/\/doi.org\/10.1002\/cem.1244https:\/\/analyticalsciencejournals.onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cem.1244","DOI":"10.1002\/cem.1244"},{"key":"3073_CR34","first-page":"1257","volume":"5","author":"B Mitras","year":"2011","unstructured":"Mitras B, Hassan NF (2011) An efficient conjugate- gradient method with new step-size. Aust J Basic Appl Sci 5:1257\u20131268","journal-title":"Aust J Basic Appl Sci"},{"issue":"4","key":"3073_CR35","doi-asserted-by":"publisher","first-page":"2170","DOI":"10.1109\/TIT.2016.2532906","volume":"62","author":"Y Qi","year":"2016","unstructured":"Qi Y, Comon P, Lim L-H (2016) Uniqueness of nonnegative tensor approximations. IEEE Trans Inform Theory 62(4):2170\u20132183. https:\/\/doi.org\/10.1109\/TIT.2016.2532906","journal-title":"IEEE Trans Inform Theory"},{"key":"3073_CR36","doi-asserted-by":"publisher","unstructured":"Shashua A, Hazan T (2005) Non-negative tensor factorization with applications to statistics and computer vision. In: Proceedings of the 22nd International Conference on Machine Learning. ICML \u201905, pp. 792\u2013799. Association for Computing Machinery, New York, NY, USA . https:\/\/doi.org\/10.1145\/1102351.1102451","DOI":"10.1145\/1102351.1102451"},{"issue":"13","key":"3073_CR37","doi-asserted-by":"publisher","first-page":"3551","DOI":"10.1109\/TSP.2017.2690524","volume":"65","author":"ND Sidiropoulos","year":"2017","unstructured":"Sidiropoulos ND, De Lathauwer L, Fu X, Huang K, Papalexakis EE, Faloutsos C (2017) Tensor decomposition for signal processing and machine learning. IEEE Trans Signal Process 65(13):3551\u20133582. https:\/\/doi.org\/10.1109\/TSP.2017.2690524","journal-title":"IEEE Trans Signal Process"},{"issue":"3","key":"3073_CR38","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/06066518X","volume":"30","author":"V Silva","year":"2008","unstructured":"Silva V, Lim L-H (2008) Tensor rank and the ill-posedness of the best low-rank approximation problem. SIAM J Matrix Anal Appl 30(3):1084\u20131127. https:\/\/doi.org\/10.1137\/06066518X","journal-title":"SIAM J Matrix Anal Appl"},{"key":"3073_CR39","unstructured":"Tensors in image processing and computer vision. In: AjaFernandez S, Garcia R, Tao D, Li X (eds) Advances in pattern recognition, pp. 1\u2013470 (2009)"},{"issue":"3","key":"3073_CR40","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1137\/S106482759427021X","volume":"17","author":"PL Toint","year":"1996","unstructured":"Toint PL (1996) An assessment of nonmonotone linesearch techniques for unconstrained optimization. SIAM J Sci Comput 17(3):725\u2013739. https:\/\/doi.org\/10.1137\/S106482759427021X","journal-title":"SIAM J Sci Comput"},{"key":"3073_CR41","doi-asserted-by":"publisher","unstructured":"Vasilescu MAO, Terzopoulos D (2002) Multilinear image analysis for facial recognition. In: 2002 International Conference on Pattern Recognition, vol. 2, pp. 511\u20135142 . https:\/\/doi.org\/10.1109\/ICPR.2002.1048350","DOI":"10.1109\/ICPR.2002.1048350"},{"key":"3073_CR42","doi-asserted-by":"publisher","unstructured":"Vasilescu MAO, Terzopoulos D (2003) Multilinear subspace analysis of image ensembles. In: 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings., vol. 2, p. 93 . https:\/\/doi.org\/10.1109\/CVPR.2003.1211457","DOI":"10.1109\/CVPR.2003.1211457"},{"issue":"1","key":"3073_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/130943133","volume":"36","author":"L Wang","year":"2015","unstructured":"Wang L, Chu MT, Yu B (2015) Orthogonal low rank tensor approximation: alternating least squares method and its global convergence. SIAM J Matrix Anal Appl 36(1):1\u201319. https:\/\/doi.org\/10.1137\/130943133","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"3","key":"3073_CR44","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1007\/s10957-022-02001-6","volume":"192","author":"F Wu","year":"2022","unstructured":"Wu F, Li C, Li Y (2022) Manifold regularization nonnegative triple decomposition of tensor sets for image compression and representation. J Optim Theory Appl 192(3):979\u20131000. https:\/\/doi.org\/10.1007\/s10957-022-02001-6","journal-title":"J Optim Theory Appl"},{"issue":"3","key":"3073_CR45","doi-asserted-by":"publisher","first-page":"1758","DOI":"10.1137\/120887795","volume":"6","author":"Y Xu","year":"2013","unstructured":"Xu Y, Yin W (2013) A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion. SIAM J Imag Sci 6(3):1758\u20131789. https:\/\/doi.org\/10.1137\/120887795","journal-title":"SIAM J Imag Sci"},{"key":"3073_CR46","unstructured":"Yang M (2012) On Partial and Generic Uniqueness of Block Term Tensor Decompositions in Signal Processing, p. 78. ProQuest LLC, Ann Arbor, MI, Thesis (Ph.D.)\u2013Texas A &M University. http:\/\/gateway.proquest.com\/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi\/fmt:kev:mtx:dissertation &res_dat=xri:pqm &rft_dat=xri:pqdiss:3537275"},{"key":"3073_CR47","doi-asserted-by":"publisher","first-page":"1797","DOI":"10.1137\/19M1303113","volume":"41","author":"Y Yang","year":"2020","unstructured":"Yang Y (2020) The epsilon-alternating least squares for orthogonal low-rank tensor approximation and its global convergence. SIAM J Matrix Anal Appl 41:1797\u20131825. https:\/\/doi.org\/10.1137\/19M1303113","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"2","key":"3073_CR48","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s10589-022-00428-1","volume":"84","author":"Y Yang","year":"2023","unstructured":"Yang Y (2023) On global convergence of alternating least squares for tensor approximation. Comput Optim Appl 84(2):509\u2013529. https:\/\/doi.org\/10.1007\/s10589-022-00428-1","journal-title":"Comput Optim Appl"},{"issue":"2","key":"3073_CR49","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s10444-023-10014-6","volume":"49","author":"Y Yang","year":"2023","unstructured":"Yang Y, Feng Y (2023) Half-quadratic alternating direction method of multipliers for robust orthogonal tensor approximation. Adv Comput Math 49(2):24\u201339. https:\/\/doi.org\/10.1007\/s10444-023-10014-6","journal-title":"Adv Comput Math"},{"issue":"4","key":"3073_CR50","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1007\/s11075-018-0522-2","volume":"80","author":"G Yu","year":"2019","unstructured":"Yu G, Song Y, Xu Y, Yu Z (2019) Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems. Numer Algor 80(4):1181\u20131201. https:\/\/doi.org\/10.1007\/s11075-018-0522-2","journal-title":"Numer Algor"},{"key":"3073_CR51","doi-asserted-by":"publisher","unstructured":"Zafeiriou S (2009) Algorithms for nonnegative tensor factorization. In: Tensors in Image Processing and Computer Vision. Adv. Pattern Recognit., pp. 105\u2013124. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-1-84882-299-3_5","DOI":"10.1007\/978-1-84882-299-3_5"},{"issue":"4","key":"3073_CR52","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1007\/s00211-018-0982-2","volume":"140","author":"Z Zhao","year":"2018","unstructured":"Zhao Z, Bai Z-J, Jin X-Q (2018) A Riemannian inexact Newton-CG method for constructing a nonnegative matrix with prescribed realizable spectrum. Numer Math 140(4):827\u2013855. https:\/\/doi.org\/10.1007\/s00211-018-0982-2","journal-title":"Numer Math"},{"issue":"1","key":"3073_CR53","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/s10915-022-01841-8","volume":"92","author":"Y-B Zheng","year":"2022","unstructured":"Zheng Y-B, Huang T-Z, Zhao X-L, Zhao Q (2022) Tensor Completion via Fully-Connected Tensor Network Decomposition with Regularized Factors. J Sci Comput 92(1):8. https:\/\/doi.org\/10.1007\/s10915-022-01841-8","journal-title":"J Sci Comput"},{"key":"3073_CR54","doi-asserted-by":"publisher","first-page":"171724","DOI":"10.1109\/ACCESS.2019.2955735","volume":"7","author":"H Zhong","year":"2019","unstructured":"Zhong H, Qi G, Guan W, Hua X (2019) Application of non-negative tensor factorization for airport flight delay pattern recognition. IEEE Access 7:171724\u2013171737. https:\/\/doi.org\/10.1109\/ACCESS.2019.2955735","journal-title":"IEEE Access"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-03073-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-024-03073-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-03073-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T06:07:13Z","timestamp":1741932433000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-024-03073-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,11]]},"references-count":54,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["3073"],"URL":"https:\/\/doi.org\/10.1007\/s40314-024-03073-y","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2025,1,11]]},"assertion":[{"value":"25 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 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":"This research concerns the theoretical study and numerical experiment of an open mathematical problem. To our knowledge, it does not involve nor imply any biological applications.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Theoretical study"}}],"article-number":"118"}}