Optimization Online


On Finding a Generalized Lowest Rank Solution to a Linear Semi-definite Feasibility Problem

Chee-Khian Sim(bizsimc***at***nus.edu.sg)

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 )

Citation: submitted

Download: [PDF]

Entry Submitted: 04/17/2013
Entry Accepted: 04/18/2013
Entry Last Modified: 04/17/2013

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society