On the rank minimization problem

Yoonsoo Kim, Mehran Mesbahi

Abstract: After a brief overview of the problem of finding the extremal (minimum or maximum) rank positive semidefinite matrix subject to matrix inequalities, we identify a few new classes of such problems that can be efficiently solved. We then proceed to present an algorithm for solving the general class of rank minimization problems.