Exposed Faces of Semidefinitely Representable Sets

A linear matrix inequality (LMI) is a condition stating that a symmetric matrix whose entries are affine-linear combinations of variables is positive semidefinite. Motivated by the fact that diagonal LMIs define polyhedra, the solution set of an LMI is called a spectrahedron. Linear images of spectrahedra are called semidefinitely representable sets. Part of the interest in spectrahedra and semidefinitely representable sets arises from the fact that one can efficiently optimize linear functions on them by semidefinite programming, such as one can do on polyhedra by linear programming. It is known that every face of a spectrahedron is exposed. This is also true in the general context of rigidly convex sets. We study the same question for semidefinitely representable sets. Lasserre proposed a moment matrix method to construct semidefinite representations for certain sets. Our main result is that this method can work only if all faces of the considered set are exposed. This necessary condition complements sufficient conditions recently proved by Lasserre, Helton, and Nie.

[1]  J. William Helton,et al.  Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets , 2007, SIAM J. Optim..

[2]  A. J. Goldman,et al.  Some geometric results in semidefinite programming , 1995, J. Glob. Optim..

[4]  J. Helton,et al.  Linear matrix inequality representation of sets , 2003, math/0306180.

[5]  Claus Scheiderer,et al.  Sums of squares on real algebraic surfaces , 2006 .

[6]  C. Scheiderer Weighted sums of squares in local rings and their completions, I , 2010 .

[8]  Victoria Powers,et al.  The moment problem for non-compact semialgebraic sets , 2001 .

[9]  J. William Helton,et al.  Semidefinite representation of convex sets , 2007, Math. Program..

[10]  Stephen P. Boyd,et al.  Linear Matrix Inequalities in Systems and Control Theory , 1994 .

[11]  Jean B. Lasserre,et al.  Convex sets with semidefinite representation , 2009, Math. Program..

[12]  M. Marshall Positive polynomials and sums of squares , 2008 .

[13]  Rainer Sinn,et al.  A Note on the Convex Hull of Finitely Many Projections of Spectrahedra , 2009 .

[14]  Levent Tunçel,et al.  Invariance and efficiency of convex representations , 2007, Math. Program..

[15]  E. Yaz Linear Matrix Inequalities In System And Control Theory , 1998, Proceedings of the IEEE.

[16]  Masakazu Kojima,et al.  On the finite convergence of successive SDP relaxation methods , 2002, Eur. J. Oper. Res..

[17]  E. Alfsen Compact convex sets and boundary integrals , 1971 .

[18]  Murray Marshall Optimization of Polynomial Functions , 2003, Canadian Mathematical Bulletin.

[19]  Marie-Françoise Roy,et al.  Real algebraic geometry , 1992 .

[20]  Alexander Barvinok,et al.  A course in convexity , 2002, Graduate studies in mathematics.

[21]  James Renegar,et al.  Hyperbolic Programs, and Their Derivative Relaxations , 2006, Found. Comput. Math..

[22]  S. Verblunsky,et al.  On Positive Polynomials , 1945 .

[23]  Ulrich Eckhardt,et al.  Representation of Convex Sets , 1980 .

[24]  Salma Kuhlmann,et al.  Positivity, sums of squares and the multi-dimensional moment problem , 2002 .