A SUCCESSIVE QUADRATIC PROGRAMMING ALGORITHM FOR SDP RELAXATION OF MAX-BISECTION

摘要

A successive quadratic programming algorithm for solving SDP relaxation of Max-Bisection is provided and its convergence result is given. The step-size in the algorithm is obtained by solving n easy quadratic equations without using the linear search technique. The numerical experiments show that this algorithm is rather faster than the interior-point method.