{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:58:51Z","timestamp":1780635531337,"version":"3.54.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T00:00:00Z","timestamp":1749081600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T00:00:00Z","timestamp":1749081600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100011878","name":"Vlaamse regering","doi-asserted-by":"publisher","award":["AI Research Program"],"award-info":[{"award-number":["AI Research Program"]}],"id":[{"id":"10.13039\/501100011878","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011878","name":"Vlaamse regering","doi-asserted-by":"publisher","award":["AI Research Program"],"award-info":[{"award-number":["AI Research Program"]}],"id":[{"id":"10.13039\/501100011878","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004040","name":"KU Leuven","doi-asserted-by":"publisher","award":["iBOF\/23\/064"],"award-info":[{"award-number":["iBOF\/23\/064"]}],"id":[{"id":"10.13039\/501100004040","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004040","name":"KU Leuven","doi-asserted-by":"publisher","award":["iBOF\/23\/064"],"award-info":[{"award-number":["iBOF\/23\/064"]}],"id":[{"id":"10.13039\/501100004040","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["12ZM223N"],"award-info":[{"award-number":["12ZM223N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s11075-025-02111-y","type":"journal-article","created":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T07:47:23Z","timestamp":1749109643000},"page":"831-859","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Reducing swamp behavior for the canonical polyadic decomposition problem by rank-1 freezing"],"prefix":"10.1007","volume":"100","author":[{"given":"Charlotte","family":"Vermeylen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nico","family":"Vervliet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lieven","family":"De Lathauwer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,6,5]]},"reference":[{"key":"2111_CR1","volume-title":"Tensors: Geometry and applications","author":"JM Landsberg","year":"2011","unstructured":"Landsberg, J.M.: Tensors: Geometry and applications, vol. 128. American Mathematical Soc, Rhode Island (2011)"},{"key":"2111_CR2","doi-asserted-by":"publisher","unstructured":"Khoromskaia, V., Khoromskij, B.N.: Tensor numerical methods in quantum chemistry. De Gruyter, Berlin, Boston (2018). https:\/\/doi.org\/10.1515\/9783110365832","DOI":"10.1515\/9783110365832"},{"key":"2111_CR3","doi-asserted-by":"publisher","unstructured":"Hackbusch, W.: Tensor spaces and numerical tensor calculus, vol 42. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-030-35554-8","DOI":"10.1007\/978-3-030-35554-8"},{"key":"2111_CR4","doi-asserted-by":"publisher","unstructured":"Cichocki, A., Mandic, D., Phan, H.A., Caiafa, C., Zhou, G., Zhao, Q., De Lathauwer, L.: Tensor decompositions for signal processing applications: From two-way to multiway component analysis. IEEE Signal Process. Mag. 32(2), 145\u2013163 (2015). https:\/\/doi.org\/10.1109\/MSP.2013.2297439","DOI":"10.1109\/MSP.2013.2297439"},{"key":"2111_CR5","doi-asserted-by":"publisher","unstructured":"Sidiropoulos, N.D., De Lathauwer, L., Fu, X., Huang, K., Papalexakis, E.E., Faloutsos, C.: Tensor decomposition for signal processing and machine learning. IEEE Trans. Signal Process. 65(13), 3551\u20133582 (2017). https:\/\/doi.org\/10.1109\/TSP.2017.2690524","DOI":"10.1109\/TSP.2017.2690524"},{"key":"2111_CR6","doi-asserted-by":"publisher","unstructured":"Lim, L.H.: Tensors in computations. Acta Numerica 30, 555\u2013764 (2021). https:\/\/doi.org\/10.1017\/S0962492921000076","DOI":"10.1017\/S0962492921000076"},{"key":"2111_CR7","doi-asserted-by":"publisher","unstructured":"Bi, X., Tang, X., Yuan, Y., Zhang, Y., Qu, A.: Tensors in statistics. Ann. Rev. Stat. Appl. 8(1), 345\u2013368 (2021). https:\/\/doi.org\/10.1146\/annurev-statistics-042720-020816","DOI":"10.1146\/annurev-statistics-042720-020816"},{"key":"2111_CR8","unstructured":"Franc, A.: Tensor ranks for the pedestrian for dimension reduction and disentangling interactions. (2022). arXiv:2201.07473"},{"key":"2111_CR9","doi-asserted-by":"publisher","unstructured":"Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51(3), 455\u2013500 (2009). https:\/\/doi.org\/10.1137\/07070111X","DOI":"10.1137\/07070111X"},{"key":"2111_CR10","unstructured":"Harshman, R.A.: Foundations of the PARAFAC procedure: Models and conditions for an \u201cexplanatory\u201d multi-model factor analysis, vol. 16, pp. 1\u201384 (1970)"},{"key":"2111_CR11","doi-asserted-by":"publisher","unstructured":"Oseledets, I.V.: Tensor-train decompositions. Methods Algo. Sci. Comput. 33(5), 2295\u20132317 (2011). https:\/\/doi.org\/10.1137\/090752286","DOI":"10.1137\/090752286"},{"key":"2111_CR12","unstructured":"Tucker, L.R.: The extension of factor analysis to three-dimensional matrices. In: Gulliksen, H., Frederiksen, N. (eds.) Contributions to Mathematical Psychology, pp. 110\u2013127. Holt, Rinehart and Winston, New York (1964)"},{"key":"2111_CR13","doi-asserted-by":"publisher","unstructured":"De Lathauwer, L., De Moor, B., Vandewalle, J.: A multilinear singular value decomposition. SIAM J. Matrix Anal. Appl. 21(4), 1253\u20131278 (2000). https:\/\/doi.org\/10.1137\/S0895479896305696","DOI":"10.1137\/S0895479896305696"},{"key":"2111_CR14","doi-asserted-by":"publisher","unstructured":"Domanov, I., De Lathauwer, L.: On the uniqueness of the canonical polyadic decomposition of third-order tensors\u2013Part I: Basic results and uniqueness of one factor matrix. SIAM J. Matrix Anal. Appl. 34(3), 855\u2013875 (2013). https:\/\/doi.org\/10.1137\/120877234","DOI":"10.1137\/120877234"},{"key":"2111_CR15","doi-asserted-by":"publisher","unstructured":"Domanov, I., De Lathauwer, L.: On the uniqueness of the canonical polyadic decomposition of third-order tensors\u2013Part II: Uniqueness of the overall decomposition. SIAM J. Matrix Anal. Appl. 34(3), 876\u2013903 (2013). https:\/\/doi.org\/10.1137\/120877258","DOI":"10.1137\/120877258"},{"key":"2111_CR16","doi-asserted-by":"publisher","unstructured":"Kruskal, J.B.: Three-way arrays: Rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics. Linear Algebra Appl. 18(2), 95\u2013138 (1977). https:\/\/doi.org\/10.1016\/0024-3795(77)90069-6","DOI":"10.1016\/0024-3795(77)90069-6"},{"key":"2111_CR17","doi-asserted-by":"publisher","unstructured":"Breiding, P., Vannieuwenhoven, N.: A Riemannian trust region method for the canonical tensor rank approximation problem. SIAM J. Opt. 28(3), 2435\u20132465 (2018). https:\/\/doi.org\/10.1137\/17M114618X","DOI":"10.1137\/17M114618X"},{"key":"2111_CR18","doi-asserted-by":"publisher","unstructured":"Acar, E., Dunlavy, D.M., Kolda, T.G.: A scalable optimization approach for fitting canonical tensor decompositions. J. Chemom. 25(2), 67\u201386 (2011). https:\/\/doi.org\/10.1002\/cem.1335","DOI":"10.1002\/cem.1335"},{"key":"2111_CR19","doi-asserted-by":"publisher","unstructured":"Phan, A.H., Tichavsk\u00fd, P., Cichocki, A.: Low complexity damped Gauss-Newton algorithms for CANDECOMP\/PARAFAC. SIAM J. Matrix Anal. Appl. 34(1), 126\u2013147 (2013). https:\/\/doi.org\/10.1137\/100808034","DOI":"10.1137\/100808034"},{"key":"2111_CR20","doi-asserted-by":"publisher","unstructured":"Sorber, L., Van Barel, M., De Lathauwer, L.: Optimization-based algorithms for tensor decompositions: Canonical polyadic decomposition, decomposition in rank-$$(L_r, L_r,1)$$ terms, and a new generalization. SIAM J. Opt. 23(2), 695\u2013720 (2013). https:\/\/doi.org\/10.1137\/120868323","DOI":"10.1137\/120868323"},{"key":"2111_CR21","doi-asserted-by":"publisher","unstructured":"Bro, R., Andersson, C.A.: Improving the speed of multiway algorithms: Part II: Compression. Chemometr. Intell. Lab. Syst. 42(1), 105\u2013113 (1998). https:\/\/doi.org\/10.1016\/S0169-7439(98)00011-2","DOI":"10.1016\/S0169-7439(98)00011-2"},{"key":"2111_CR22","doi-asserted-by":"publisher","unstructured":"Vervliet, N., Debals, O., De Lathauwer, L.: Exploiting efficient representations in large-scale tensor decompositions. SIAM J. Sci. Comput. 41(2), 789\u2013815 (2019). https:\/\/doi.org\/10.1137\/17M1152371","DOI":"10.1137\/17M1152371"},{"key":"2111_CR23","unstructured":"Vervliet, N., Debals, O., Sorber, L., Van\u00a0Barel, M., De\u00a0Lathauwer, L.: Tensorlab 3.0. Available online. https:\/\/www.tensorlab.net"},{"key":"2111_CR24","unstructured":"Kossaifi, J., Panagakis, Y., Anandkumar, A., Pantic, M.: TensorLy: Tensor learning in Python. J. Mach. Learn. Res. 20(26) (2019)"},{"key":"2111_CR25","unstructured":"Bader, B.W., Kolda, T.G., et al.: Tensor Toolbox for MATLAB, Version 3.6. Available online. www.tensortoolbox.org"},{"key":"2111_CR26","doi-asserted-by":"publisher","unstructured":"Mitchell, B.C., Burdick, D.S.: Slowly converging PARAFAC sequences: Swamps and two-factor degeneracies. J. Chemometr. 8(2), 155\u2013168 (1994). https:\/\/doi.org\/10.1002\/cem.1180080207","DOI":"10.1002\/cem.1180080207"},{"key":"2111_CR27","doi-asserted-by":"publisher","unstructured":"Gong, X., Mohlenkamp, M.J., Young, T.R.: The optimization landscape for fitting a rank-2 tensor with a rank-1 tensor. SIAM J. Appl. Dyn. Syst. 17(2), 1432\u20131477 (2018). https:\/\/doi.org\/10.1137\/17M112213X","DOI":"10.1137\/17M112213X"},{"key":"2111_CR28","doi-asserted-by":"publisher","unstructured":"Mohlenkamp, M.J.: The dynamics of swamps in the canonical tensor approximation problem. SIAM J. Appl. Dyn. Syst. 18(3), 1293\u20131333 (2019). https:\/\/doi.org\/10.1137\/18M1181389","DOI":"10.1137\/18M1181389"},{"key":"2111_CR29","unstructured":"Navasca, C., De\u00a0Lathauwer, L., Kindermann, S.: Swamp reducing technique for tensor decomposition. In: 2008 16th european signal processing conference, pp. 1\u20135 (2008)"},{"issue":"3","key":"2111_CR30","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s11336-008-9056-1","volume":"73","author":"WP Krijnen","year":"2008","unstructured":"Krijnen, W.P., Dijkstra, T.K., Stegeman, A.: On the non-existence of optimal solutions and the occurrence of \u201cdegeneracy\" in the CANDECOMP\/PARAFAC model. Psychometrika 73(3), 431\u2013439 (2008). https:\/\/doi.org\/10.1007\/s11336-008-9056-1","journal-title":"Psychometrika"},{"issue":"3","key":"2111_CR31","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1002\/1099-128X(200005\/06)14:3<285::AID-CEM584>3.0.CO;2-1","volume":"14","author":"P Paatero","year":"2000","unstructured":"Paatero, P.: Construction and analysis of degenerate PARAFAC models. J. Chemometr. 14(3), 285\u2013299 (2000)","journal-title":"J. Chemometr."},{"key":"2111_CR32","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.laa.2016.10.019","volume":"513","author":"I Domanov","year":"2017","unstructured":"Domanov, I., De Lathauwer, L.: Canonical polyadic decomposition of third-order tensors: Relaxed uniqueness conditions and algebraic algorithm. Linear Algebra Appl. 513, 342\u2013375 (2017). https:\/\/doi.org\/10.1016\/j.laa.2016.10.019","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"2111_CR33","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1002\/cem.1180040105","volume":"4","author":"E Sanchez","year":"1990","unstructured":"Sanchez, E., Kowalski, B.R.: Tensorial resolution: A direct trilinear decomposition. J. Chemometr. 4(1), 29\u201345 (1990). https:\/\/doi.org\/10.1002\/cem.1180040105","journal-title":"J. Chemometr."},{"issue":"4","key":"2111_CR34","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1137\/0614071","volume":"14","author":"SE Leurgans","year":"1993","unstructured":"Leurgans, S.E., Ross, R.T., Abel, R.B.: A decomposition for three-way arrays. SIAM J. Matrix Anal. Appl. 14(4), 1064\u20131083 (1993)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2111_CR35","doi-asserted-by":"publisher","unstructured":"Evert, E., Vandecappelle, M., De Lathauwer, L.: A recursive eigenspace computation for the canonical polyadic decomposition. SIAM J. Matrix Anal. Appl. 43(1), 274\u2013300 (2022). https:\/\/doi.org\/10.1137\/21M1423026","DOI":"10.1137\/21M1423026"},{"key":"2111_CR36","doi-asserted-by":"publisher","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer, New York (2006). https:\/\/doi.org\/10.1007\/978-0-387-40065-5","DOI":"10.1007\/978-0-387-40065-5"},{"issue":"2","key":"2111_CR37","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1137\/110836067","volume":"34","author":"N Vannieuwenhoven","year":"2012","unstructured":"Vannieuwenhoven, N., Vandebril, R., Meerbergen, K.: A new truncation strategy for the higher-order singular value decomposition. SIAM J. Sci. Comput. 34(2), 1027\u20131052 (2012). https:\/\/doi.org\/10.1137\/110836067","journal-title":"SIAM J. Sci. Comput."},{"key":"2111_CR38","doi-asserted-by":"publisher","unstructured":"Breiding, P., Vannieuwenhoven, N.: The condition number of join decompositions. SIAM J. Matrix Anal. Appl. 39(1), 287\u2013309 (2018). https:\/\/doi.org\/10.1137\/17M1142880","DOI":"10.1137\/17M1142880"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02111-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-025-02111-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02111-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T07:32:20Z","timestamp":1758526340000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-025-02111-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,5]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["2111"],"URL":"https:\/\/doi.org\/10.1007\/s11075-025-02111-y","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-6234994\/v1","asserted-by":"object"}]},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,5]]},"assertion":[{"value":"15 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2025","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":"Competing interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval\/Availability of supporting data\/Conflict of interest"}}]}}