Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)

A class of Semidefinite Programs with rank-one solutions

  • 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.
Metadaten
Author:Guillaume Sagnol
Document Type:Article
Parent Title (English):Linear Algebra and its Applications
Volume:435
Issue:6
First Page:1446
Last Page:1463
Year of first publication:2011
Preprint:urn:nbn:de:0297-zib-14933
DOI:https://doi.org/10.1016/j.laa.2011.03.027
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.