An Efficient Method for Convex Constrained Rank Minimization Problems Based on DC Programming

Table 1

DC versus SeDuMi in time (second).

	800	900	1000	1100	1200	1500
DC	46.82	50.49	50.78	51.38	51.96	54.09
SeDuMi	93.26	120.16	138.24	159.44	161.76	245.38