Abstract
The set of matrices of given positive semidefinite rank is semialgebraic. In this paper we study the geometry of this set, and in small cases we describe its boundary. For general values of positive semidefinite rank we provide a conjecture for the description of this boundary. Our proof techniques are geometric in nature and rely on nesting spectrahedra between polytopes.
| Original language | English |
|---|---|
| Pages (from-to) | 1952-1974 |
| Journal | Linear and Multilinear Algebra |
| Volume | 66 |
| Issue number | 10 |
| Early online date | 2017 |
| DOIs | |
| Publication status | Published - 2018 |
| MoE publication type | A1 Journal article-refereed |
Keywords
- Mathematics - Algebraic Geometry
- Mathematics - Optimization and Control
- positive semidefinite rank
- algebraic boundaries
- spectrahedra
- polytopes
Fingerprint
Dive into the research topics of 'Positive semidefinite rank and nested spectrahedra'. Together they form a unique fingerprint.Equipment
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver