Characterization of rank-constrained feasibility problems via a finite number of convex programs | IEEE Conference Publication | IEEE Xplore