A cut-plane algorithm for semidefinite programmingand its application

A cut plane algorithm for semidefinite programming is presented in this paper, which relaxs the semidefinite programming to a linear programming, thus solving large scale semidefinite programming effeciently. Its covergence is proved. As an application, a numerical example of the Max-cut problme is given.