作者: Rob H Eggermont , Emil Horobeţ , Kaie Kubjas , None
DOI: 10.1016/J.LAA.2016.06.036
关键词:
摘要: Understanding the boundary of set matrices nonnegative rank at most r is important for applications in nonconvex optimization. The Zariski closure 3 reducible. We give a minimal generating ideal each irreducible component. In fact, this Grobner basis with respect to graded reverse lexicographic order. This solves conjecture by Robeva, Sturmfels and last author.