Exact solutions in low-rank approximation with zeros
arXiv:2010.15636 · doi:10.1016/j.laa.2022.01.021
Abstract
Low-rank approximation with zeros aims to find a matrix of fixed rank and with a fixed zero pattern that minimizes the Euclidean distance to a given data matrix. We study the critical points of this optimization problem using algebraic tools. In particular, we describe special linear, affine, and determinantal relations satisfied by the critical points. We also investigate the number of critical points and how this number is related to the complexity of nonnegative matrix factorization problem.
arXiv commentrevised version to appear on Linear Algebra and its Applications, 26 pages, 1 figure, 8 tables
References in corpus (6)
- Low-Rank Matrix Approximation with Weights or Missing Data is NP-hard
- Estimation of Simultaneously Sparse and Low Rank Matrices
- Improved Sparse Low-Rank Matrix Estimation
- Fixed points of the EM algorithm and nonnegative rank boundaries
- Algebraic/combinatorial proofs of Cayley-type identities for derivatives of determinants and pfaffians
- Lovasz-Saks-Schrijver ideals and coordinate sections of determinantal varieties