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 variable,; is positive semidefinite. :dotiv11ted 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 onc can efficiently opthnize 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 semi definitely 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 H('''CsA"ry condition cmnpJelf"'IIt� Fmfficieni nmditions recently proved by Lass"rre, IIeltoll, and Nie.
منابع مشابه
Exposed Faces of Semidefinite 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 semidefinite representable sets. Part of the interest in spectrahedra and semid...
متن کاملOn Semidefinite Representations of Non-closed Sets
Spectrahedra are sets defined by linear matrix inequalities. Projections of spectrahedra are called semidefinite representable sets. Both kinds of sets are of practical use in polynomial optimization, since they occur as feasible sets in semidefinite programming. There are several recent results on the question which sets are semidefinite representable. So far, all results focus on the case of ...
متن کاملRegularity in mixed-integer convex representability
Characterizations of the sets with mixed integer programming (MIP) formulations using only rational linear inequalities (rational MILP representable) and those with formulations that use arbitrary closed convex constraints (MICP representable) were given by Jeroslow and Lowe (1984), and Lubin, Zadik and Vielma (2017). The latter also showed that even MICP representable subsets of the natural nu...
متن کاملEigenvalue-constrained Faces
We characterize the exposed faces of convex sets C of symmetric matrices, invariant under orthogonal similarity (U T CU = C for all orthogonal U). Such sets C are exactly those determined by eigenvalue constraints: typical examples are the positive semideenite cone, and unit balls of common matrix norms. The set D of all diagonal matrices in C is known to be convex if and only if C is, and D is...
متن کاملD-representability of Simplicial Complexes of Fixed Dimension
Let K be a simplicial complex with vertex set V = {v1, . . . , vn}. The complex K is d-representable if there is a collection {C1, . . . , Cn} of convex sets in R d such that any subcollection {Ci1 , . . . , Cij} has a nonempty intersection if and only if {vi1 , . . . , vij} is a face of K. In 1967 Wegner proved that every simplicial complex of dimension d is (2d + 1)representable. He also conj...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM Journal on Optimization
دوره 20 شماره
صفحات -
تاریخ انتشار 2010