On the nuclear norm and the singular value decomposition of tensors
DOI10.1007/s10208-015-9264-xzbMath1343.15016arXiv1308.3860OpenAlexW2130150942MaRDI QIDQ300892
Publication date: 29 June 2016
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.3860
singular value decompositionmatrix completiontensor producttensor decompositionnuclear normCANDECOMPPARFAC
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Eigenvalues, singular values, and eigenvectors (15A18) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Multilinear algebra, tensor calculus (15A69) Matrix completion problems (15A83)
Related Items (23)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The rank of \(n \times n\) matrix multiplication is at least \(3n^2 - 2\sqrt{2}n^{\frac{3}{2}} - 3n\)
- Multiarray signal processing: tensor decomposition meets compressed sensing
- The permanent of a square matrix
- An inequality of Hadamard type for permanents
- Matrix multiplication via arithmetic progressions
- On the ranks and border ranks of symmetric tensors
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- Beyond the Alder-Strassen bound.
- Apolarity for determinants and permanents of generic matrices
- Gaussian elimination is not optimal
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Exact matrix completion via convex optimization
- Tensor completion and low-n-rank tensor recovery via convex optimization
- Tensor rank is NP-complete
- Powers of tensors and fast matrix multiplication
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- A Multilinear Singular Value Decomposition
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Blind Multilinear Identification
- Most Tensor Problems Are NP-Hard
- Multiplying matrices faster than coppersmith-winograd
- New Lower Bounds for the Rank of Matrix Multiplication
- A Theory of Cross-Spaces. (AM-26)
- Produits tensoriels topologiques et espaces nucléaires
This page was built for publication: On the nuclear norm and the singular value decomposition of tensors