The Research Of Algorithms Of Semidefinite Programming

The organization and content of this thesis can be summarized as follows: In chapter 2, firstly, we define a new semidefinite nonlinear programming— semidefinite multiplicative programming, and then present the OAE algorithm for it. Secondly, we show that it can be seen as a special geometric programming, and give its geometric duality. At last, we define the fractional conic programming, and develop Charnes and Cooper's theory for the linear fractional programming. In chapter 3, on one hand, we give an example to show a mistake in Reference [19], on the other hand, we use the method which is presented in [19] to design an algorithm for the quadraic convex programming and the semidefinite linear programming.