Abstract
Understanding the boundary of the set of matrices of nonnegative rank at most r is important for applications in nonconvex optimization. The Zariski closure of the boundary of the set of matrices of nonnegative rank at most 3 is reducible. We give a minimal generating set for the ideal of each irreducible component. In fact, this generating set is a Gröbner basis with respect to the graded reverse lexicographic order. This solves a conjecture by Robeva, Sturmfels and the last author.
Original language | English |
---|---|
Pages (from-to) | 62-80 |
Number of pages | 19 |
Journal | Linear Algebra and Its Applications |
Volume | 508 |
DOIs | |
Publication status | Published - 1 Nov 2016 |
MoE publication type | A1 Journal article-refereed |
Keywords
- Equivariant Gröbner basis
- Mixture model
- Nonnegative rank
- Stabilization