Semidefinite Representation of Convex Sets and Convex Hulls
From MaRDI portal
Publication:2802520
DOI10.1007/978-1-4614-0769-0_4zbMath1334.90104OpenAlexW2139023954MaRDI QIDQ2802520
Jia-Wang Nie, J. William Helton
Publication date: 26 April 2016
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0769-0_4
Semidefinite programming (90C22) Convex programming (90C25) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (3)
Polyhedral approximation of spectrahedral shadows via homogenization ⋮ Maximum semidefinite and linear extension complexity of families of polytopes ⋮ Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Obstructions to determinantal representability
- Semidefinite representation of convex hulls of rational varieties
- Convex hulls of curves of genus one
- First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials
- A convex polynomial that is not sos-convex
- Semidefinite representation of convex sets
- Noncommutative convexity arises from linear matrix inequalities
- Convex sets with semidefinite representation
- On the convex hull of a space curve
- The Convex Hull of a Variety
- Exposed Faces of Semidefinitely Representable Sets
- ORBITOPES
- Differential equations, difference equations and matrix theory
- Linear matrix inequality representation of sets
- Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- The Lax conjecture is true
- OPTIMAL SMOOTHING FOR CONVEX POLYTOPES
This page was built for publication: Semidefinite Representation of Convex Sets and Convex Hulls
