Abstract
We consider SemiDefinite Programming problems with a rank constraint which are not convex for the presence of the rank constraint. The formulation provides optimization problems between quadratic optimization and SDP. We show some properties of Low-Rank SDP, especially for cases that the problems is not identified with SDP.