An Analytic Center Cutting Plane Method for Solving Semidefinite Programming

This paper deals with the large-scale semidefinite programming problems.An analytic center cutting plane method is given,which solves a linear relaxation of the dual semidefinite program in every iteration,and uses an analytic center of cutting plane as the next iteration point.The convergence of this method is proved,and eventually the practical example is given.