Lifts of convex sets and cone factorizations

Mathematics – Optimization and Control

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

20 pages, 2 figures

Scientific paper

In this paper we address the basic geometric question of when a given convex set is the image under a linear map of an affine slice of a given closed convex cone. Such a representation or 'lift' of the convex set is especially useful if the cone admits an efficient algorithm for linear optimization over its affine slices. We show that the existence of a lift of a convex set to a cone is equivalent to the existence of a factorization of an operator associated to the set and its polar via elements in the cone and its dual. This generalizes a theorem of Yannakakis that established a connection between polyhedral lifts of a polytope and nonnegative factorizations of its slack matrix. Symmetric lifts of convex sets can also be characterized similarly. When the cones live in a family, our results lead to the definition of the rank of a convex set with respect to this family. We present results about this rank in the context of cones of positive semidefinite matrices. Our methods provide new tools for understanding cone lifts of convex sets.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Lifts of convex sets and cone factorizations 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 Lifts of convex sets and cone factorizations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lifts of convex sets and cone factorizations will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-217896

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.