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

Table 7

Numerical results for G problems.

Graph		SUB	GW-cut		DC		DC^+	BK
			obv		obv
G01	800	12078	10612	14	11281	1	11518	11624
G02	800	12084	10617	31	11261	1	11550	11620
G03	800	12077	10610	14	11275	1	11540	11622
G11	800	627	551	30	494	2	528	564
G14	800	3187	2800	13	2806	1	2980	3063
G15	800	3169	2785	70	2767	1	2969	3050
G16	800	3172	2782	14	2800	1	2974	3052
G43	1000	7027	6174	—	6321	1	6519	6660
G45	1000	7020	6168	—	6348	1	6564	6654
G52	1000	4009	3520	—	3383	1	3713	3849