Self-Dual Polyhedral Cones and Their Slack Matrices
From MaRDI portal
Abstract: We analyze self-dual polyhedral cones and prove several properties about their slack matrices. In particular, we show that self-duality is equivalent to the existence of a positive semidefinite (PSD) slack. Beyond that, we show that if the underlying cone is irreducible, then the corresponding PSD slacks are not only doubly nonnegative matrices (DNN) but are extreme rays of the cone of DNN matrices, which correspond to a family of extreme rays not previously described. More surprisingly, we show that, unless the cone is simplicial, PSD slacks not only fail to be completely positive matrices but they also lie outside the cone of completely positive semidefinite matrices. Finally, we show how one can use semidefinite programming to probe the existence of self-dual cones with given combinatorics. Our results are given for polyhedral cones but we also discuss some consequences for negatively self-polar polytopes.
Recommendations
Cites work
- scientific article; zbMATH DE number 3845607 (Why is no real title available?)
- scientific article; zbMATH DE number 3529038 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- scientific article; zbMATH DE number 1933860 (Why is no real title available?)
- A non-involutory selfduality
- A study of projectionally exposed cones
- Amenable cones are particularly nice
- Amenable cones: error bounds without constraint qualifications
- Combining realization space models of polytopes
- Completely positive semidefinite rank
- Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone
- Deciding polyhedrality of spectrahedra
- Expressing combinatorial optimization problems by linear programs
- Extreme vectors of doubly nonnegative matrices
- Facially exposed cones are not always nice
- Functional Operators (AM-22), Volume 2
- General non-realizability certificates for spheres with linear programming
- House of Graphs: a database of interesting graphs
- Indecomposable cones
- Is Selfduality Involutory?
- Lifts of Convex Sets and Cone Factorizations
- Lifts of non-compact convex sets and cone factorizations
- Linear vs. semidefinite extended formulations
- Lower bounds on the size of semidefinite programming relaxations
- Matrices with high completely positive semidefinite rank
- Matrix iterative analysis
- On extreme points of convex sets
- On the irreducibility, Lyapunov rank, and automorphisms of special Bishop-Phelps cones
- On the symmetry of induced norm cones
- On vector configurations that can be realized in the cone of positive matrices
- Open problems in the theory of completely positive and copositive matrices
- Perfect cones
- Projectionally Exposed Cones
- Projectionally exposed cones in \(R^ 3\)
- Projectively unique polytopes and toric slack ideals
- Regularizing the abstract convex program
- Self-dual cones in Euclidean spaces
- Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
- Self-polar polytopes
- Several Jordan-algebraic aspects of optimization†
- Strongly involutive self-dual polyhedra
- The automorphism group and the non-self-duality of \(p\)-cones
- The complete enumeration of 4-polytopes and 3-spheres with nine vertices
- The construction and classification of self-dual spherical polyhedra
- The slack realization space of a polytope
- Theory of cones
- Which nonnegative matrices are slack matrices?
Cited in
(3)
This page was built for publication: Self-Dual Polyhedral Cones and Their Slack Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6116664)
