Multiple-Cut Algorithm for Semidefinite Feasibility Problem

To solve the semidefinite feasibility problem,it is more efficient to apply the analytic center cutting plane method than to convert it a semidefinite programming problem.A multiple-cut algorithm for the problem was proposed by improving the single-cut algorithm.Its convergence was discussed.The conclusion is proved that it is a quadratic convergent method.