Semidefinite Representation of Convex Sets
Abstract
Let S =\x∈ n: g1(x)≥ 0, ..., gm(x)≥ 0\ be a semialgebraic set defined by multivariate polynomials gi(x). Assume S is convex, compact and has nonempty interior. Let Si =\x∈ n: gi(x)≥ 0\, and (resp. i) be the boundary of S (resp. Si). This paper discusses whether S can be represented as the projection of some LMI representable set. Such S is called semidefinite representable or SDP representable. The contributions of this paper: (i) Assume gi(x) are all concave on S. If the positive definite Lagrange Hessian (PDLH) condition holds, i.e., the Hessian of the Lagrange function for optimization problem of minimizing any nonzero linear function Tx on S is positive definite at the minimizer, then S is SDP representable. (ii) If each gi(x) is either sos-concave (-∇2gi(x)=W(x)TW(x) for some possibly nonsquare matrix polynomial W(x)) or strictly quasi-concave on S, then S is SDP representable. (iii) If each Si is either sos-convex or poscurv-convex (Si is compact convex, whose boundary has positive curvature and is nonsingular, i.e. ∇ gi(x) = 0 on i S), then S is SDP representable. This also holds for Si for which i S extends smoothly to the boundary of a poscurv-convex set containing S. (iv) We give the complexity of Schm\"udgen and Putinar's matrix Positivstellensatz, which are critical to the proofs of (i)-(iii).