On the Nuclear Norm and the Singular Value Decomposition of Tensors
Author:
Preprint
Abstract
Finding the rank of a tensor is a problem that has many applications. Unfortunately it is often very difficult to determine the rank of a given tensor. Inspired by the heuristics of convex relaxation, we consider the nuclear norm instead of the rank of a tensor. We determine the nuclear norm of various tensors of interest. Along the way, we also do a systematic study various measures of orthogonality in tensor product spaces and we give a new generalization of the Singular Value Decomposition to higher order tensors.Keywords
All Related Versions
This publication has 19 references indexed in Scilit:
- The permanent of a square matrixEuropean Journal of Combinatorics, 2010
- 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
- Algebraic Complexity Theory1997
- Tensor rank is NP-completeJournal of Algorithms, 1990
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Analysis of Individual Differences in Multidimensional Scaling Via an N-way Generalization of “Eckart-Young” DecompositionPsychometrika, 1970
- Multiple Invariants and Generalized Rank of a P‐Way Matrix or TensorJournal of Mathematics and Physics, 1928