Polynomial-sized semidefinite representations of derivative relaxations of spectrahedral cones

DOI10.1007/S10107-014-0804-YzbMath1327.90180arXiv1208.1443OpenAlexW3100992911MaRDI QIDQ747766

Pablo A. Parrilo, James Saunderson

Publication date: 19 October 2015

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.1443

zbMATH Keywords

elementary symmetric polynomialhyperbolicity conehyperbolic polynomialsemidefinite representation

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Convex functions and convex programs in convex geometry (52A41) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (11)

Symbolic computation in hyperbolic programming ⋮ Automorphisms of Rank-One Generated Hyperbolicity Cones and Their Derivative Relaxations ⋮ On eigenvalues of symmetric matrices with PSD principal submatrices ⋮ Spectrahedral Shadows ⋮ Definite determinantal representations of multivariate polynomials ⋮ Spectral linear matrix inequalities ⋮ Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization ⋮ Certifying Polynomial Nonnegativity via Hyperbolic Optimization ⋮ A spectrahedral representation of the first derivative relaxation of the positive semidefinite cone ⋮ Hyperbolic polynomials, interlacers, and sums of squares ⋮ Approximate cone factorizations and lifts of polytopes

Uses Software

• SDPT3
• YALMIP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hyperbolicity cones of elementary symmetric polynomials are spectrahedral
• On hyperbolicity cones associated with elementary symmetric polynomials
• Group majorization, the convex hulls of sets of matrices, and the diagonal element - singular value inequalities
• Homogeneous multivariate polynomials with the half-plane property
• Some geometric results in semidefinite programming
• Hyperbolic programs, and their derivative relaxations
• Lectures on Modern Convex Optimization
• ORBITOPES
• Positive Polynomials and Projections of Spectrahedra
• Linear matrix inequality representation of sets
• Symmetry Matters for the Sizes of Extended Formulations
• Hyperbolic Polynomials and Interior Point Methods for Convex Programming
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• The Lax conjecture is true
• Semidefinite Optimization and Convex Algebraic Geometry
• On the derivative cones of polyhedral cones
• Lifts of Convex Sets and Cone Factorizations

This page was built for publication: Polynomial-sized semidefinite representations of derivative relaxations of spectrahedral cones