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

Table 6

Numerical results for famous max-cut problems.

Graph		KV	GW-cut		DC		Optimal solutions
			UB		obv
C5	5	4	4.525	5	4	1	(−1; 1; −1; 1; −1)
K5	5	6	6.25	5	6	1	(−1; 1; −1; 1; −1)
AG	5	9.28	9.6040	5	9.28	1	(−1; 1; 1; −1; −1)
BG	12	88	90.3919	12	88	1	(−1; 1; 1; −1; −1; −1; −1; −1; −1; 1; 1; 1)