A Nonconvex Relaxation Approach for Rank Minimization Problems