Semidefinite representation of convex sets (Q847843): Difference between revisions

A question arising from [\textit{Y. Nesterov} and \textit{A. Nemirovski}, Interior-point polynomial algorithms in convex programming, Philadelphia, PA: SIAM (1994; Zbl 0824.90112)] is that which sets are SDP representable (semidefinite representable)? In this paper, the authors establish sufficient conditions ensuring the set \(S: = \{x \in \mathbb R^n: g_i(x) \geq 0\), \(i=1,\dots,m\}\) to be SDP representable. We can see here that \(S\) is SDP representable if the positive definite Lagrange Hessian condition holds. In case each \(g_i(x)\) is either sos-concave or strictly quasi-concave, \(S\) is also SDP representable.