First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials
From MaRDI portal
Publication:662299
Abstract: A set is called semidefinite representable or semidefinite programming (SDP) representable if it can be represented as the projection of a higher dimensional set which is represented by some Linear Matrix Inequality (LMI). This paper discuss the semidefinite representability conditions for convex sets of the form S_D(f) = {x in D: f(x) >= 0}. Here D={xin R^n: g_1(x) >= 0, ..., g_m(x) >= 0} is a convex domain defined by some "nice" concave polynomials g_i(x) (they satisfy certain concavity certificates), and f(x) is a polynomial or rational function. When f(x) is concave over mc{D}, we prove that S_D(f) has some explicit semidefinite representations under certain conditions called preordering concavity or q-module concavity, which are based on the Positivstellensatz certificates for the first order concavity criteria. When f(x) is a polynomial or rational function having singularities on the boundary of S_D(f), a perspective transformation is introduced to find some explicit semidefinite representations for S_D(f) under certain conditions. In the particular case n=2, if the Laurent expansion of f(x) around one singular point has only two consecutive homogeneous parts, we show that S_D(f) always admits an explicitly constructible semidefinite representation.
Recommendations
- Semidefinite representation of convex sets
- Sufficient and necessary conditions for semidefinite representability of convex hulls and sets
- Semidefinite Representation of Convex Sets and Convex Hulls
- Polynomial matrix inequality and semidefinite representation
- On semidefinite representations of non-closed sets
Cites work
- scientific article; zbMATH DE number 52497 (Why is no real title available?)
- scientific article; zbMATH DE number 3572315 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1490041 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
- Convex sets with semidefinite representation
- Global optimization with polynomials and the problem of moments
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Linear matrix inequality representation of sets
- Polynomials that are positive on an interval
- Semidefinite programming relaxations for semialgebraic problems
- Semidefinite representation of convex sets
- Sufficient and necessary conditions for semidefinite representability of convex hulls and sets
- The K-moment problem for compact semi-algebraic sets
Cited in
(14)- Convex sets with semidefinite representation
- Sufficient and necessary conditions for semidefinite representability of convex hulls and sets
- Spectrahedral shadows
- Semidefinite representability
- Semidefinite Representation for Convex Hulls of Real Algebraic Curves
- A bilateral extension of the \(q\)-Selberg integral
- Gposolver: a Matlab/C++ toolbox for global polynomial optimization
- Semidefinite Representation of Convex Sets and Convex Hulls
- Exposed faces of semidefinitely representable sets
- On semidefinite representations of non-closed sets
- Free semidefinite representation of matrix power functions
- Semidefinite representation of convex sets
- Convex hulls of quadratically parameterized sets with quadratic constraints
- Semi-definite representations for sets of cubics on the two-dimensional sphere
This page was built for publication: First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q662299)
