Skip to content

On finding a generalized lowest rank solution to a linear semi-definite feasibility problem

Research output: Contribution to journalArticlepeer-review

In this note, we generalize the affine rank minimization problem and the vector cardinality minimization problem and show that the resulting generalized problem can be solved by solving a sequence of continuous concave minimization problems. In the case of the vector cardinality minimization problem, we show that it can be solved exactly by solving the continuous concave minimization problem.
Original languageEnglish
Pages (from-to)334-338
Number of pages5
JournalOperations Research Letters
Issue number3
Early online date17 Apr 2015
Publication statusPublished - 1 May 2015


Related information

Relations Get citation (various referencing formats)

ID: 2256736