{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:41:32Z","timestamp":1740123692528,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T00:00:00Z","timestamp":1687564800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T00:00:00Z","timestamp":1687564800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["445466444"],"award-info":[{"award-number":["445466444"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["12E8119N"],"award-info":[{"award-number":["12E8119N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004497","name":"Onderzoeksraad, KU Leuven","doi-asserted-by":"publisher","award":["STG\/19\/002"],"award-info":[{"award-number":["STG\/19\/002"]}],"id":[{"id":"10.13039\/501100004497","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s11075-023-01526-9","type":"journal-article","created":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T11:46:34Z","timestamp":1687607194000},"page":"1003-1029","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The condition number of many tensor decompositions is invariant under Tucker compression"],"prefix":"10.1007","volume":"94","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5558-4782","authenticated-orcid":false,"given":"Nick","family":"Dewaele","sequence":"first","affiliation":[]},{"given":"Paul","family":"Breiding","sequence":"additional","affiliation":[]},{"given":"Nick","family":"Vannieuwenhoven","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,24]]},"reference":[{"issue":"3","key":"1526_CR1","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 Review 51(3), 455\u2013500 (2009)","journal-title":"SIAM Review"},{"issue":"13","key":"1526_CR2","doi-asserted-by":"publisher","first-page":"3551","DOI":"10.1109\/TSP.2017.2690524","volume":"65","author":"ND Sidiropoulos","year":"2017","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 Transactions on Signal Processing 65(13), 3551\u20133582 (2017)","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"1","key":"1526_CR3","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1137\/17M1142880","volume":"39","author":"P Breiding","year":"2018","unstructured":"Breiding, P., Vannieuwenhoven, N.: The Condition Number of Join Decompositions. SIAM Journal on Matrix Analysis and Applications 39(1), 287\u2013309 (2018)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"1\u20134","key":"1526_CR4","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1002\/sapm192761164","volume":"6","author":"FL Hitchcock","year":"1927","unstructured":"Hitchcock, F.L.: The Expression of a Tensor or a Polyadic as a Sum of Products. Journal of Mathematics and Physics 6(1\u20134), 164\u2013189 (1927)","journal-title":"Journal of Mathematics and Physics"},{"issue":"3","key":"1526_CR5","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1137\/070690729","volume":"30","author":"L De Lathauwer","year":"2008","unstructured":"De Lathauwer, L.: Decompositions of a Higher-Order Tensor in Block Terms-Part II: Definitions and Uniqueness. SIAM Journal on Matrix Analysis and Applications 30(3), 1033\u20131066 (2008)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"5","key":"1526_CR6","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 Journal on Scientific Computing 33(5), 2295\u20132317 (2011)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"1526_CR7","doi-asserted-by":"crossref","unstructured":"Ehrlacher, V., Fuente-Ruiz, M., Lombardi, D.: SoTT: greedy approximation of a tensor as a sum of Tensor Trains (2021)","DOI":"10.1137\/20M1381472"},{"issue":"5","key":"1526_CR8","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1007\/s00041-009-9094-9","volume":"15","author":"W Hackbusch","year":"2009","unstructured":"Hackbusch, W., K\u00fchn, S.: A new scheme for the tensor representation. Journal of Fourier Analysis and Applications 15(5), 706\u2013722 (2009)","journal-title":"Journal of Fourier Analysis and Applications"},{"issue":"4","key":"1526_CR9","doi-asserted-by":"publisher","first-page":"2029","DOI":"10.1137\/090764189","volume":"31","author":"L Grasedyck","year":"2010","unstructured":"Grasedyck, L.: Hierarchical singular value decomposition of tensors. SIAM Journal on Matrix Analysis and Applications 31(4), 2029\u20132054 (2010)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"4","key":"1526_CR10","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1002\/cem.790","volume":"17","author":"CM Andersen","year":"2003","unstructured":"Andersen, C.M., Bro, R.: Practical aspects of PARAFAC modeling of fluorescence excitation-emission data. Journal of Chemometrics 17(4), 200\u2013215 (2003)","journal-title":"Journal of Chemometrics"},{"key":"1526_CR11","unstructured":"Harshman, R.a.: Foundations of the PARAFAC procedure: Models and conditions for an \u201cexplanatory\u201d multimodal factor analysis. UCLA Working Papers in Phonetics 16(10), 1\u201384 (1970)"},{"issue":"4","key":"1526_CR12","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0895479896305696","volume":"21","author":"L De Lathauwer","year":"2000","unstructured":"De Lathauwer, L., De Moor, B., Vandewalle, J.: A multilinear singular value decomposition. SIAM Journal on Matrix Analysis and Applications 21(4), 1253\u20131278 (2000)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"3","key":"1526_CR13","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02289464","volume":"31","author":"LR Tucker","year":"1966","unstructured":"Tucker, L.R.: Some mathematical notes on three-mode factor analysis. Psychometrika 31(3), 279\u2013311 (1966)","journal-title":"Psychometrika"},{"issue":"3","key":"1526_CR14","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/06066518X","volume":"30","author":"V de Silva","year":"2008","unstructured":"de Silva, V., Lim, L.-H.: Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem. SIAM Journal on Matrix Analysis and Applications 30(3), 1084\u20131127 (2008)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"1526_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9425-9","volume-title":"Multilinear Algebra","author":"W Greub","year":"1978","unstructured":"Greub, W.: Multilinear Algebra, 2nd edn. Springer, New York (1978)","edition":"2"},{"issue":"1\u20132","key":"1526_CR16","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0169-7439(98)00011-2","volume":"42","author":"R Bro","year":"1998","unstructured":"Bro, R., Andersson, C.A.: Improving the speed of multiway algorithms part II: Compression. Chemometrics and Intelligent Laboratory Systems 42(1\u20132), 105\u2013113 (1998)","journal-title":"Chemometrics and Intelligent Laboratory Systems"},{"issue":"2","key":"1526_CR17","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 Journal on Scientific Computing 34(2), 1027\u20131052 (2012)","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"2","key":"1526_CR18","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1137\/0703023","volume":"3","author":"JR Rice","year":"1966","unstructured":"Rice, J.R.: A Theory of Condition. SIAM Journal on Numerical Analysis 3(2), 287\u2013310 (1966)","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"1526_CR19","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.laa.2017.08.014","volume":"535","author":"N Vannieuwenhoven","year":"2017","unstructured":"Vannieuwenhoven, N.: Condition numbers for the tensor rank decomposition. Linear Algebra and its Applications 535, 35\u201386 (2017)","journal-title":"Linear Algebra and its Applications"},{"key":"1526_CR20","doi-asserted-by":"crossref","unstructured":"B\u00fcrgisser, P., Cucker, F.: Condition. Grundlehren der mathematischen Wissenschaften, vol. 349. Springer, Berlin, Heidelberg (2013)","DOI":"10.1007\/978-3-642-38896-5"},{"issue":"2","key":"1526_CR21","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1137\/17M1148943","volume":"40","author":"B Arslan","year":"2019","unstructured":"Arslan, B., Noferini, V., Tisseur, F.: The structured condition number of a differentiable map between matrix manifolds, with applications. SIAM Journal on Matrix Analysis and Applications 40(2), 774\u2013799 (2019)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"1526_CR22","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer Series in Operations Research and Financial Engineering. Springer, New York (2006)"},{"key":"1526_CR23","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830244","volume-title":"Optimization Algorithms on Matrix Manifolds","author":"P-A Absil","year":"2008","unstructured":"Absil, P.-A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton (2008)"},{"key":"1526_CR24","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.aml.2017.10.009","volume":"78","author":"P Breiding","year":"2018","unstructured":"Breiding, P., Vannieuwenhoven, N.: Convergence analysis of Riemannian Gauss-Newton methods and its connection with the geometric condition number. Applied Mathematics Letters 78, 42\u201350 (2018)","journal-title":"Applied Mathematics Letters"},{"issue":"1","key":"1526_CR25","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/141000671","volume":"59","author":"J Bezanson","year":"2017","unstructured":"Bezanson, J., Edelman, A., Karpinski, S., Shah, V.B.: Julia: A Fresh Approach to Numerical Computing. SIAM Review 59(1), 65\u201398 (2017)","journal-title":"SIAM Review"},{"key":"1526_CR26","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.aop.2014.06.013","volume":"349","author":"R Or\u00fas","year":"2014","unstructured":"Or\u00fas, R.: A practical introduction to tensor networks: Matrix product states and projected entangled pair states. Annals of Physics 349, 117\u2013158 (2014)","journal-title":"Annals of Physics"},{"issue":"1","key":"1526_CR27","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.laa.2013.03.016","volume":"439","author":"A Uschmajew","year":"2013","unstructured":"Uschmajew, A., Vandereycken, B.: The geometry of algorithms using hierarchical tensors. Linear Algebra and Its Applications 439(1), 133\u2013166 (2013)","journal-title":"Linear Algebra and Its Applications"},{"key":"1526_CR28","doi-asserted-by":"crossref","unstructured":"Landsberg, J.M.: Tensors: Geometry and Applications Graduate Studies in Mathematics vol. 128, (2012)","DOI":"10.1090\/gsm\/128"},{"key":"1526_CR29","volume-title":"Introduction to Smooth Manifolds","author":"JM Lee","year":"2013","unstructured":"Lee, J.M.: Introduction to Smooth Manifolds. Springer, New York (2013)"},{"key":"1526_CR30","volume-title":"Topology","author":"J Munkres","year":"2014","unstructured":"Munkres, J.: Topology, 2nd edn. Pearson Education, Harlow (2014)","edition":"2"},{"issue":"1","key":"1526_CR31","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1137\/S0895479800368354","volume":"23","author":"TG Kolda","year":"2001","unstructured":"Kolda, T.G.: Orthogonal tensor decompositions. SIAM Journal on Matrix Analysis and Applications 23(1), 243\u2013255 (2001)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"1526_CR32","unstructured":"Navasca, C., De Lathauwer, L., Kindermann, S.: Swamp reducing technique for tensor decomposition. European Signal Processing Conference (Eusipco) (2008)"},{"issue":"2","key":"1526_CR33","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1137\/120868323","volume":"23","author":"L Sorber","year":"2013","unstructured":"Sorber, L., Van Barel, M., De Lathauwer, L.: Optimization-based algorithms for tensor decompositions: Canonical polyadic decomposition, decomposition in rank-(Lr, Lr, 1) terms, and a new generalization. SIAM Journal on Optimization 23(2), 695\u2013720 (2013)","journal-title":"SIAM Journal on Optimization"},{"issue":"3","key":"1526_CR34","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1137\/070690730","volume":"30","author":"L De Lathauwer","year":"2008","unstructured":"De Lathauwer, L., Nion, D.: Decompositions of a Higher-Order Tensor in Block Terms-Part III: Alternating Least Squares Algorithms. SIAM Journal on Matrix Analysis and Applications 30(3), 1067\u20131083 (2008)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"1526_CR35","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.laa.2020.03.042","volume":"599","author":"E Angelini","year":"2020","unstructured":"Angelini, E., Chiantini, L.: On the identifiability of ternary forms. Linear Algebra and its Applications 599, 36\u201365 (2020)","journal-title":"Linear Algebra and its Applications"},{"key":"1526_CR36","doi-asserted-by":"publisher","DOI":"10.56021\/9781421407944","volume-title":"Matrix Computations","author":"GH Golub","year":"2013","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, vol. 3. JHU press, Baltimore (2013)"},{"key":"1526_CR37","doi-asserted-by":"crossref","unstructured":"Olikier, G., Absil, P.A., De Lathauwer, L.: Variable projection applied to block term decomposition of higher-order tensors. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10891 LNCS(30468160), 139\u2013148 (2018)","DOI":"10.1007\/978-3-319-93764-9_14"},{"key":"1526_CR38","doi-asserted-by":"crossref","unstructured":"Phan, A.-H., Tichavsk\u00fd, P., Sobolev, K., Sozykin, K., Ermilov, D., Cichocki, A.: Canonical polyadic tensor decomposition with low-rank factor matrices. In: ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 4690\u20134694 (2021)","DOI":"10.1109\/ICASSP39728.2021.9414606"},{"issue":"1","key":"1526_CR39","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1137\/20M1323527","volume":"31","author":"P Breiding","year":"2021","unstructured":"Breiding, P., Vannieuwenhoven, N.: The Condition Number of Riemannian Approximation Problems. SIAM Journal on Optimization 31(1), 1049\u20131077 (2021)","journal-title":"SIAM Journal on Optimization"},{"key":"1526_CR40","doi-asserted-by":"crossref","unstructured":"Vervliet, N., Debals, O., De Lathauwer, L.: Tensorlab 3.0 - Numerical optimization strategies for large-scale constrained and coupled matrix\/tensor factorization. Conference Record - Asilomar Conference on Signals, Systems and Computers 32, 1733\u20131738 (2017)","DOI":"10.1109\/ACSSC.2016.7869679"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01526-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-023-01526-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01526-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,5]],"date-time":"2023-09-05T09:16:49Z","timestamp":1693905409000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-023-01526-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,24]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["1526"],"URL":"https:\/\/doi.org\/10.1007\/s11075-023-01526-9","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2023,6,24]]},"assertion":[{"value":"15 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}]}}