A Class of Semidefinite Programs with rank-one solutions

Details A Class of Semidefinite Programs with rank-one solutions A Class of Semidefinite Programs with rank-one solutions

2009-09-30

arxiv.org/abs/0909.5577v4

Mathematics

Optimization and Control

16 pages

Scientific paper

We show that a class of semidefinite programs (SDP) admits a solution that is a positive semidefinite matrix of rank at most $r$, where $r$ is the rank of the matrix involved in the objective function of the SDP. The optimization problems of this class are semidefinite packing problems, which are the SDP analogs to vector packing problems. Of particular interest is the case in which our result guarantees the existence of a solution of rank one: we show that the computation of this solution actually reduces to a Second Order Cone Program (SOCP). We point out an application in statistics, in the optimal design of experiments.

Affiliated with

Also associated with

No associations

Rating

A Class of Semidefinite Programs with rank-one solutions 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 A Class of Semidefinite Programs with rank-one solutions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Class of Semidefinite Programs with rank-one solutions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-590027