Typical and generic ranks in matrix completion
From MaRDI portal
Publication:2332456
DOI10.1016/j.laa.2019.09.001zbMath1425.15024arXiv1802.09513OpenAlexW2976194898WikidataQ114664052 ScholiaQ114664052MaRDI QIDQ2332456
Daniel Irving Bernstein, Rainer Sinn, Grigoriy Blekherman
Publication date: 4 November 2019
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.09513
Real algebraic sets (14P05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Matrix completion problems (15A83)
Related Items
The algebraic matroid of the finite unit norm tight frame (funtf) variety ⋮ Typical ranks in symmetric matrix completion
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometry of maximum likelihood estimation in Gaussian graphical models
- Zero forcing sets and bipartite circulants
- The lower order of lower triangular operators and minimal rank extensions
- Maximum likelihood threshold and generic completion rank of graphs
- The Schur complement and its applications
- On real typical ranks
- Computing images of polynomial maps
- Completion of tree metrics and rank 2 matrices
- The maximum likelihood threshold of a graph
- On maximum, typical and generic ranks
- Exact matrix completion via convex optimization
- Bipartite rigidity
- Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
- A remark on global positioning from local distances
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Perfect Elimination and Chordal Bipartite Graphs
- Paths in graphs
- Ideals, Varieties, and Algorithms
- Matrix Completion From a Few Entries
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Rank-one completions of partial matrices and completely rank-nonincreasing linear functionals
- The Geometry of Rank-One Tensor Completion
- The Algebraic Combinatorial Approach for Low-Rank Matrix Completion
