On Finding a Generalized Lowest Rank Solution to a Linear Semi-definite Feasibility Problem
Abstract: 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 by solving the continuous concave minimization problem.
Keywords: Affine rank minimization problem; Vector cardinality minimization problem; Concave minimization problem.
Category 1: Linear, Cone and Semidefinite Programming (Other )
Entry Submitted: 04/17/2013
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|