Matrix completion and tensor rank
From MaRDI portal
Publication:2805654
DOI10.1080/03081087.2015.1083565zbMATH Open1346.15026arXiv1302.2639OpenAlexW1870903031MaRDI QIDQ2805654FDOQ2805654
Authors: Harm Derksen
Publication date: 12 May 2016
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Abstract: In this paper, we show that the low rank matrix completion problem can be reduced to the problem of finding the rank of a certain tensor.
Full work available at URL: https://arxiv.org/abs/1302.2639
Recommendations
Cites Work
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Exact matrix completion via convex optimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Matrix Completion From a Few Entries
- Most tensor problems are NP-hard
- Tensor rank is NP-complete
- Orthogonal representations over finite fields and the chromatic number of graphs
Cited In (7)
- Tensor rank is NP-complete
- The geometry of rank-one tensor completion
- Typical and generic ranks in matrix completion
- On the equivalence between low-rank matrix completion and tensor rank
- A non-convex tensor rank approximation for tensor completion
- A tensor rank theory and maximum full rank subtensors
- Rank determination for low-rank data completion
This page was built for publication: Matrix completion and tensor rank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805654)