On the equivalence between low-rank matrix completion and tensor rank

DOI10.1080/03081087.2017.1315044zbMath1386.15054arXiv1406.0080OpenAlexW2963971099MaRDI QIDQ4640079

H. G. J. Derksen

Publication date: 16 May 2018

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.0080

zbMATH Keywords

complexitymatrix completiontensor rankrank minimization

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Matrix completion problems (15A83)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• Fixed point and Bregman iterative methods for matrix rank minimization
• Symmetric tensor decomposition
• Rank of 3-tensors with 2 slices and Kronecker canonical forms
• A comparison of algorithms for fitting the PARAFAC model
• A connection between positive semidefinite and Euclidean distance matrix completion problems
• The geometry of graphs and some of its algorithmic applications
• General tensor decomposition, moment matrices and applications
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• Orthogonal representations over finite fields and the chromatic number of graphs
• Exact matrix completion via convex optimization
• Matrix completion and tensor rank
• A Singular Value Thresholding Algorithm for Matrix Completion
• Tensor rank is NP-complete
• Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Rank Minimization Over Finite Fields: Fundamental Limits and Coding-Theoretic Interpretations
• Index Coding With Side Information
• Matrix Completion From a Few Entries
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
• Most Tensor Problems Are NP-Hard