Optimality Conditions for Nonconvex Semidefinite Programming and Augmented Lagrangian Method;

A cut-plane algorithm for nonlinear convex semidefinite programming;

A new homotopy method,called boundary moving combined homotopy method,for solving nonconvex programming is given,and the existence and convergence of the homotopy path is proved under some weak conditions.

To the nonconvex programming, the article makes it local convexification by introducing a simple penalty function into the obje ctive function, and solves it like solving convex programming.

The present paper deals with the association of the solution and lagrange multiplier of nonconvex programming with quadratic constraint, and it is shown by means of some examples that the association is hardly programmed for general nonconvex programming problems.

A sequential linearization method for a class of nonlinear semidefinite programming;

A nonsmooth Newton’s method for nonlinear semidefinite programming was discussed by using 4-tensor analysis.

We give a updated sequential linearization method for a class of nonlinear semidefinite programmings.

Application of semidefinite programming to near - field multiple source localization;

Predictor-corrector Interior-point algorithm for semidefinite programming;

A semidefinite programming algorithm for QoS routing problem;

This paper mainly presents the general model,optimal conditions of the semi-definite programming and its primal-dual potential reduction interior-point algorithm.