On the Nuclear Norm and the Singular Value Decomposition of Tensors
Author:
- 19 May 2015
- journal article
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 16 (3) , 779-811
Abstract
No abstract availableKeywords
All Related Versions
This publication has 27 references indexed in Scilit:
- Tensor completion and low-n-rank tensor recovery via convex optimizationInverse Problems, 2011
- Multiarray signal processing: Tensor decomposition meets compressed sensingComptes Rendus Mécanique, 2010
- On the Ranks and Border Ranks of Symmetric TensorsFoundations of Computational Mathematics, 2009
- Exact Matrix Completion via Convex OptimizationFoundations of Computational Mathematics, 2009
- Beyond the Alder–Strassen boundTheoretical Computer Science, 2005
- On the uniqueness of multilinear decomposition ofN-way arraysJournal of Chemometrics, 2000
- Tensor rank is NP-completeJournal of Algorithms, 1990
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Tensor rank is NP-complete1989
- O(n2.7799) complexity for n × n approximate matrix multiplicationInformation Processing Letters, 1979