A set $S\subseteq\mathbb{R}^n$ is called semidefinite programming (SDP) representable or semidefinite representable if $S$ equals the projection of a set in higher dimensional space which is describable by some linear matrix inequality (LMI). Clearly, if $S$ is SDP representable, then $S$ must be convex and semialgebraic (it is describable by conjunctions and disjunctions of polynomial equalities or inequalities). This paper proves sufficient conditions and necessary conditions for SDP representability of convex sets and convex hulls by proposing a new approach to constructing SDP representations. The contributions of this paper are: (i) For bounded SDP representable sets $W_1,\dots,W_m$, we give an explicit construction of an SDP representation for $\mathrm{conv}(\cup_{k=1}^mW_k)$. This provides a technique for building global SDP representations from the local ones. (ii) For the SDP representability of a compact convex semialgebraic set $S$, we prove sufficient: the boundary $\partial S$ is nonsingular and positively curved, while necessary is: $\partial S$ has nonnegative curvature at each nonsingular point. In terms of defining polynomials for $S$, nonsingular boundary amounts to them having nonvanishing gradient at each point on $\partial S$ and the curvature condition can be expressed as their strict versus nonstrict quasi-concavity at those points on $\partial S$ where they vanish. The gaps between them are $\partial S$ having or not having singular points either of the gradient or of the curvature's positivity. A sufficient condition bypassing the gaps is when some defining polynomials of $S$ satisfy an algebraic condition called sos-concavity. (iii) For the SDP representability of the convex hull of a compact nonconvex semialgebraic set $T$, we find that the critical object is $\partial_c T$, the maximum subset of $\partial T$ contained in $\partial\mathrm{conv}(T)$. We prove sufficient for SDP representability: $\partial_c T$ is nonsingular and positively curved, and necessary is: $\partial_c T$ has nonnegative curvature at nonsingular points. The gaps between our sufficient and necessary conditions are similar to case (ii). The positive definite Lagrange Hessian (PDLH) condition, which meshes well with constructions, is also discussed.
[1]
Arkadi Nemirovski,et al.
Lectures on modern convex optimization - analysis, algorithms, and engineering applications
,
2001,
MPS-SIAM series on optimization.
[2]
J. William Helton,et al.
Semidefinite representation of convex sets
,
2007,
Math. Program..
[3]
Mohammad Ghomi,et al.
Optimal Smoothing for Convex Polytopes
,
2004
.
[4]
Henry Wolkowicz,et al.
Handbook of Semidefinite Programming
,
2000
.
[5]
A. Nemirovski.
Advances in convex optimization : conic programming
,
2005
.
[6]
M. Spivak.
A comprehensive introduction to differential geometry
,
1979
.
[7]
G. G. Stokes.
"J."
,
1890,
The New Yale Book of Quotations.
[8]
J. William Helton,et al.
Structured semidefinite representation of some convex sets
,
2008,
2008 47th IEEE Conference on Decision and Control.
[9]
丸山 徹.
Convex Analysisの二,三の進展について
,
1977
.
[10]
Donal O'Shea,et al.
Ideals, varieties, and algorithms - an introduction to computational algebraic geometry and commutative algebra (2. ed.)
,
1997,
Undergraduate texts in mathematics.
[11]
Stephen P. Boyd,et al.
Convex Optimization
,
2004,
Algorithms and Theory of Computation Handbook.
[12]
Yurii Nesterov,et al.
Interior-point polynomial algorithms in convex programming
,
1994,
Siam studies in applied mathematics.
[13]
Marie-Françoise Roy,et al.
Real algebraic geometry
,
1992
.
[14]
J. Helton,et al.
Linear matrix inequality representation of sets
,
2003,
math/0306180.