Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
From MaRDI portal
Publication:3053114
DOI10.1137/090750688zbMath1221.15038OpenAlexW2031327377MaRDI QIDQ3053114
Publication date: 4 November 2010
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/090750688
Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Matrix completion problems (15A83)
Related Items (27)
Matrix completion via max-norm constrained optimization ⋮ Unique low rank completability of partially filled matrices ⋮ Global completability with applications to self-consistent quantum tomography ⋮ Weak Rigidity Theory and Its Application to Formation Stabilization ⋮ Completion of tree metrics and rank 2 matrices ⋮ GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery ⋮ The Geometry of Rank-One Tensor Completion ⋮ Algebraic compressed sensing ⋮ Recovery of low-rank matrices based on the rank null space properties ⋮ Results on the algebraic matroid of the determinantal variety ⋮ Maximal matroids in weak order posets ⋮ Positive semidefinite matrix completion, universal rigidity and the strong Arnold property ⋮ Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation ⋮ Uniqueness of Nonnegative Matrix Factorizations by Rigidity Theory ⋮ Combinatorial rigidity of incidence systems and application to dictionary learning ⋮ Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics ⋮ Typical ranks in symmetric matrix completion ⋮ Low-rank matrix completion using nuclear norm minimization and facial reduction ⋮ Bipartite rigidity ⋮ Algebraic Matroids in Action ⋮ GENERIC UNLABELED GLOBAL RIGIDITY ⋮ Nonparametric estimation of low rank matrix valued function ⋮ Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries ⋮ Method of moments for 3D single particleab initiomodeling with non-uniform distribution of viewing angles ⋮ Typical and generic ranks in matrix completion ⋮ Global Registration of Multiple Point Clouds Using Semidefinite Programming ⋮ Matrix estimation by universal singular value thresholding
Uses Software
This page was built for publication: Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
