{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:11:50Z","timestamp":1773796310602,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,5,19]],"date-time":"2015-05-19T00:00:00Z","timestamp":1431993600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s10208-015-9264-x","type":"journal-article","created":{"date-parts":[[2015,5,18]],"date-time":"2015-05-18T15:45:06Z","timestamp":1431963906000},"page":"779-811","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["On the Nuclear Norm and the Singular Value Decomposition of Tensors"],"prefix":"10.1007","volume":"16","author":[{"given":"Harm","family":"Derksen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,19]]},"reference":[{"key":"9264_CR1","unstructured":"C.\u00a0D.\u00a0Aliprantis and K.\u00a0C.\u00a0Border, Infinite Dimensional Analysis \u2013 A Hitchhiker\u2019s Guide, third edition, Springer, 2006."},{"key":"9264_CR2","doi-asserted-by":"crossref","unstructured":"D.\u00a0Bini, M.\u00a0Capovani, G.\u00a0Lotti and F.\u00a0Romani, $$O(n^{2.7799})$$ O ( n 2.7799 ) complexity for matrix multiplication, Inf. Proc. Letters\u00a08 (1979), 234\u2013235.","DOI":"10.1016\/0020-0190(79)90113-3"},{"key":"9264_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.tcs.2004.09.029","volume":"331","author":"M Bl\u00e4ser","year":"2005","unstructured":"M.\u00a0Bl\u00e4ser, Beyond the Alder-Strassen bound, Theor. Comp. Science\u00a0331 (2005), 3\u201321.","journal-title":"Theor. Comp. Science"},{"key":"9264_CR4","doi-asserted-by":"crossref","unstructured":"P.\u00a0B\u00fcrgisser, M.\u00a0Clausen and M.\u00a0A.\u00a0Shokrollahi, Algebraic Complexity Theory, Grundlehren der Mathematischen WIssenschaften\u00a0315, Springer-Verlag, Berlin, 1997.","DOI":"10.1007\/978-3-662-03338-8"},{"key":"9264_CR5","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"E.J. Cand\u00e8s and B. Recht, Exact matrix completion via convex optimization, Foundations of Computational Mathematics 9, 2009, 717\u2013772.","journal-title":"Foundations of Computational Mathematics"},{"issue":"5","key":"9264_CR6","doi-asserted-by":"crossref","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"EJ Cand\u00e8s","year":"2010","unstructured":"E. J. Cand\u00e8s and T. Tao, The power of convex relaxation: Near-optimal matrix completion, IEEE Trans. on Information Theory 56 (2010), no. 5, 2053\u20132080.","journal-title":"IEEE Trans. on Information Theory"},{"issue":"1","key":"9264_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4310\/MAA.2006.v13.n1.a1","volume":"13","author":"E Carlen","year":"2006","unstructured":"E. Carlen, E. H. Lieb and M. Loss (2006) An inequality of Hadamard type for permanents, Methods Appl. Anal. 13(1) 1\u201317.","journal-title":"Methods Appl. Anal."},{"key":"9264_CR8","doi-asserted-by":"crossref","unstructured":"J. D. Carroll and J. Chang, Analysis of individual differences in multidimensional scaling via an n-way generalization of \u201cEckart-Young\u201d decomposition, Psychometrika 35 (1970), 218\u2013319.","DOI":"10.1007\/BF02310791"},{"issue":"3","key":"9264_CR9","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D Coppersmith","year":"1990","unstructured":"D. Coppersmith and S. Winograd, Matrix Multiplication via Arithmetic Progessions, J. Symbolic Computation, 9 (3) (1990), 251\u2013280.","journal-title":"J. Symbolic Computation"},{"key":"9264_CR10","doi-asserted-by":"crossref","first-page":"1254","DOI":"10.1137\/06066518X","volume":"30","author":"V Silva De","year":"2008","unstructured":"V. De Silva and L.-H. Lim, Tensor rank and the ill-posedness of the best low-rank approximation problem, SIAM J. Matrix Anal. Appl. 30 (2008), 1254\u20131279.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9264_CR11","doi-asserted-by":"crossref","unstructured":"S. Gandy, B. Recht and I. Yamada, Tensor completion and low n-rank tensor recovery via convex optimization, Inverse Problems 27 (2011), no. 2.","DOI":"10.1088\/0266-5611\/27\/2\/025010"},{"issue":"7","key":"9264_CR12","doi-asserted-by":"crossref","first-page":"1887","DOI":"10.1016\/j.ejc.2010.01.010","volume":"31","author":"D Glynn","year":"2010","unstructured":"D. Glynn, The permanent of a square matrix, European J. Combin. 31 (2010), no. 7, 1887\u20131891.","journal-title":"European J. Combin."},{"key":"9264_CR13","unstructured":"A. Grothendieck, Produits tensoriels topologiques et espaces nucl\u00e9ares, Mem. Amer. Math. Soc. 1955 (1955), no. 16."},{"key":"9264_CR14","unstructured":"R. A. Harshman, Foundations of the PARAFAC procedure: models and conditions for an \u201cexplanatory\u201d multimodal factor analysis, UCLA working papers in Phonetics 16 (1970), 1\u201384."},{"issue":"4","key":"9264_CR15","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1016\/0196-6774(90)90014-6","volume":"11","author":"J H\u00e5stad","year":"1990","unstructured":"J. H\u00e5stad, Tensor rank is NP-complete, J. Algorithms 11 (1990), no. 4, 644\u2013654.","journal-title":"J. Algorithms"},{"key":"9264_CR16","doi-asserted-by":"crossref","unstructured":"J.\u00a0H\u00e5stad, Tensor rank is NP-complete, Automata, languages and programming (Stresa, 1989), Lecture Notes in Comput.\u00a0Sci.\u00a0372, Springer, Berlin, 1989, 451\u2013460.","DOI":"10.1007\/BFb0035776"},{"issue":"1","key":"9264_CR17","first-page":"40","volume":"7","author":"FL Hitchcock","year":"1927","unstructured":"F. L. Hitchcock, Multiple invariants and generalized rank of a p-way matrix or tensor, J. Math. and Phys. 7 (1927), no. 1, 40\u201379.","journal-title":"J. Math. and Phys."},{"key":"9264_CR18","unstructured":"C. J. Hillar and L.-H. Lim, Most tensor problems are NP-hard, Journal of the ACM 60 (2013), no. 6, Art. 45."},{"key":"9264_CR19","doi-asserted-by":"crossref","first-page":"2980","DOI":"10.1109\/TIT.2010.2046205","volume":"56","author":"RH Keshavan","year":"2010","unstructured":"R. H. Keshavan, A. Montanari and S. Oh, Matrix completion from a few entries, IEEE Trans. on Information Theory 56 (2010), 2980\u20132998.","journal-title":"IEEE Trans. on Information Theory"},{"issue":"2","key":"9264_CR20","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0024-3795(77)90069-6","volume":"18","author":"JB Kruskal","year":"1977","unstructured":"J. B. Kruskal, Three-way arrays: rank and uniqueness for trilinear decompositions, with application to arithmetic complexity and statistics, Linear Algebra Appl. 18 (2) (1977), 95\u2013138.","journal-title":"Linear Algebra Appl."},{"key":"9264_CR21","doi-asserted-by":"crossref","unstructured":"J.\u00a0M.\u00a0Landsberg, Tensors: Geometry and Applications, Graduate Studies in mathematics\u00a0128, American Mathematical Society, RI, 2012.","DOI":"10.1090\/gsm\/128"},{"issue":"1","key":"9264_CR22","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1137\/120880276","volume":"53","author":"JM Landsberg","year":"2014","unstructured":"J. M. Landsberg, New lower bounds for the rank of matrix multiplication, SIAM J. Comput. 53 (2014), no. 1, 144\u2013149.","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9264_CR23","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s10208-009-9055-3","volume":"10","author":"JM Landsberg","year":"2010","unstructured":"J. M. Landsberg and Z. Teitler, On the ranks and border ranks of symmetric tensors, Foundations of Computational Mathematics 10.3 (2010), 339\u2013366.","journal-title":"Foundations of Computational Mathematics"},{"key":"9264_CR24","doi-asserted-by":"crossref","unstructured":"L. de Lathauwer, B. de Moor and J. Vandewalle, A multilinear singular value decomposition, Siam J. Matrix Anal. Appl. 21, no. 4, 1253\u20131278.","DOI":"10.1137\/S0895479896305696"},{"key":"9264_CR25","doi-asserted-by":"crossref","unstructured":"F. Le Gall, Powers of tensors and fast matrix multiplication, Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (ISSAC 2014), 2014, 296\u2013303.","DOI":"10.1145\/2608628.2608664"},{"key":"9264_CR26","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/j.crme.2010.06.005","volume":"338","author":"L-H Lim","year":"2010","unstructured":"L.-H. Lim and P. Comon, Multiarray signal processing: tensor decomposition meets compressed sensing, Comptes Rendus Mecanique 338 (2010), 311\u2013320.","journal-title":"Comptes Rendus Mecanique"},{"key":"9264_CR27","doi-asserted-by":"crossref","first-page":"1260","DOI":"10.1109\/TIT.2013.2291876","volume":"60","author":"LH Lim","year":"2014","unstructured":"L. H. Lim and P. Comon, Blind multilinear identification, IEEE Trans. Inf. Theory 60 (2014), 1260\u20131280.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9264_CR28","doi-asserted-by":"crossref","first-page":"4500","DOI":"10.1016\/j.laa.2013.01.031","volume":"438","author":"A Massarenti","year":"2013","unstructured":"A. Massarenti and E. Raviolo, The rank of $$n\\times n$$ n \u00d7 n matrix multiplication is at least $$3n^2-2\\sqrt{2}n^{3\/2}-3n$$ 3 n 2 - 2 2 n 3 \/ 2 - 3 n , Linear Algebra and its Applications 438 (2013), 4500\u20134509.","journal-title":"Linear Algebra and its Applications"},{"issue":"3","key":"9264_CR29","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"B. Recht, M. Fazel and P. A. Parrilo, Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimzation, SIAM review 52 (2010), no. 3, 471\u2013501.","journal-title":"SIAM review"},{"key":"9264_CR30","volume-title":"A Theory of Cross-Spaces","author":"R Schatten","year":"1950","unstructured":"R. Schatten, A Theory of Cross-Spaces, Princeton University Press, Princeton, NJ, 1950."},{"key":"9264_CR31","unstructured":"M.\u00a0Shafiei, Apolarity for determinants and permanents of generic matrices, preprint, arXiv:1212.0515 ."},{"key":"9264_CR32","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V Strassen","year":"1969","unstructured":"V. Strassen, Gaussian elimination is not optimal, Numer. Math. 13 (1969), 354\u2013356.","journal-title":"Numer. Math."},{"issue":"3","key":"9264_CR33","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1002\/1099-128X(200005\/06)14:3<229::AID-CEM587>3.0.CO;2-N","volume":"14","author":"ND Sidiropoulos","year":"2000","unstructured":"N. D. Sidiropoulos and R. Bro, On the uniqueness of multilinear decomposition of N-way arrays, J. Chemometrics 14 (2000), no. 3, 229\u2013239.","journal-title":"J. Chemometrics"},{"issue":"3","key":"9264_CR34","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"B. Recht, M. Fazel and P. Parillo, Guaranteed minimum rank solutions of matrix equations via nuclear norm minimization, SIAM Review 52 (2010), no. 3, 471\u2013501.","journal-title":"SIAM Review"},{"key":"9264_CR35","unstructured":"A. J. Stothers, On the Complexity of Matrix Multiplication, Ph.D. Thesis, Univ. Edinburgh, 2010."},{"key":"9264_CR36","doi-asserted-by":"crossref","unstructured":"V.\u00a0V.\u00a0Williams, Multiplying matrices faster than Coppersmith-Winograd, STOC 2012, Proceedings of the forty-fourth annual ACM symposium on Theory of computing, ACM, 2012, 887\u2013898.","DOI":"10.1145\/2213977.2214056"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9264-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-015-9264-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9264-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,8]],"date-time":"2022-05-08T11:56:17Z","timestamp":1652010977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-015-9264-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,19]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["9264"],"URL":"https:\/\/doi.org\/10.1007\/s10208-015-9264-x","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,19]]}}}