Numerical experiments show that the proposed algorithm is more efficient than the interior-point algorithm for solving the semidefinite programming relaxation of the max-cut problem.

• 数值实验表明：与半定规划内点法相比，可行方向法更能有效地求解大规模的最大割问题的半定规划松弛。