Convex sets with semidefinite representation
From MaRDI portal
Recommendations
- Semidefinite representation of convex sets
- Sufficient and necessary conditions for semidefinite representability of convex hulls and sets
- Semidefinite representations of noncompact convex sets
- Polynomial matrix inequality and semidefinite representation
- First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials
Cites work
- An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
- Complementarity and nondegeneracy in semidefinite programming
- Computing uniform convex approximations for convex envelopes and convex hulls
- Distinguished representations of strictly positive polynomials
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- Invariance and efficiency of convex representations
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Linear matrix inequality representation of sets
- New Results on Quadratic Minimization
- On the complexity of Putinar's Positivstellensatz
- On the complexity of Schmüdgen's Positivstellensatz
- On the generic properties of convex optimization problems in conic form
- Semidefinite Programming
- Semidefinite representation of convex sets
- SOS approximations of nonnegative polynomials via simple high degree perturbations
- Sufficient conditions for a real polynomial to be a sum of squares
- The K-moment problem for compact semi-algebraic sets
- The Lax conjecture is true
Cited in
(43)- Exact SDP relaxations for classes of nonlinear semidefinite programming problems
- The tropical analogue of the Helton-Nie conjecture is true
- On the exactness of Lasserre relaxations and pure states over real closed fields
- Semi-definite representations for sets of cubics on the two-dimensional sphere
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
- Tractable approximations of sets defined with quantifiers
- Algebraic boundaries of \(\mathrm{SO}(2)\)-orbitopes
- The tracial Hahn-Banach theorem, polar duals, matrix convex sets, and projections of free spectrahedra
- Sums of squares characterizations of containment of convex semialgebraic sets
- Matrix convex hulls of free semialgebraic sets
- Semidefinite Representation of Convex Sets and Convex Hulls
- Convex hulls of algebraic sets
- Convex hulls of quadratically parameterized sets with quadratic constraints
- LMI representations of convex semialgebraic sets and determinantal representations of algebraic hypersurfaces: past, present, and future
- Semidefinite representability
- Exposed faces of semidefinitely representable sets
- Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies
- LMI representations of the convex hulls of quadratic basic semialgebraic sets
- On the exactness of Lasserre relaxations for compact convex basic closed semialgebraic sets
- Semidefinite Representation for Convex Hulls of Real Algebraic Curves
- Spectrahedral shadows
- Semidefinite Approximation of Closed Convex Set
- A new proof for the existence of degree bounds for Putinar's positivstellensatz
- Free semidefinite representation of matrix power functions
- Semidefinite Programming and Nash Equilibria in Bimatrix Games
- Lifting for simplicity: concise descriptions of convex sets
- A matrix Positivstellensatz with lifting polynomials
- Semidefinite representations of noncompact convex sets
- Convex inner approximations of nonconvex semialgebraic sets applied to fixed-order controller design
- An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials
- Semidefinite representation of convex hulls of rational varieties
- Convex hulls of curves of genus one
- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets
- First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials
- A refinement of Hilbert's 1888 theorem: separating cones along the Veronese variety
- A semidefinite relaxation method for linear and nonlinear complementarity problems with polynomials
- Linear optimization with cones of moments and nonnegative polynomials
- Detecting rigid convexity of bivariate polynomials
- Semidefinite representation of convex sets
- Semidefinite representations for finite varieties
- Representation of nonnegative convex polynomials
- On semidefinite representations of non-closed sets
- Certificates of convexity for basic semi-algebraic sets
This page was built for publication: Convex sets with semidefinite representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391000)
