On semidefinite representations of non-closed sets

Details On semidefinite representations of non-closed sets On semidefinite representations of non-closed sets

2009-07-16

arxiv.org/abs/0907.2764v3

Mathematics

Optimization and Control

13 pages

Scientific paper

Spectrahedra are sets defined by linear matrix inequalities. Projections of spectrahedra are called semidefinitely 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 closed sets. In this work we develop a new method to prove semidefinite representability of sets which are not closed. For example, the interior of a semidefinite representable set is shown to be semidefinite representable. More general, one can remove faces of a semidefinite representable set and preserve semidefinite representability, as long as the faces are parametrized in a suitable way.

Affiliated with

Also associated with

No associations

Rating

On semidefinite representations of non-closed sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On semidefinite representations of non-closed sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On semidefinite representations of non-closed sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-621192