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

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.