Existence and Uniqueness of K..S..H Search Direction of Interior Point Algorithms for a Class of Quadratic Semidefinite Programming
Shenggui Zhang
Abstract
Shenggui Zhang
Abstract
The primal dual algorithm for semidefinite programming is generalized to solve a class of quadratic semidefinite programming.The K..S..H direction of the algorithm is obtained via solving asystem of nonlinear equations by the classic Newton method,and the existence and uniqueness of the direction is proved.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The primal dual algorithm for semidefinite programming is generalized to solve a class of quadratic semidefinite programming.The K..S..H direction of the algorithm is obtained via solving asystem of nonlinear equations by the classic Newton method,and the existence and uniqueness of the direction is proved.
Key concepts: Semidefinite programming, Uniqueness, Mathematics, Semidefinite embedding, Quadratically constrained quadratic program, Interior point method, Class (philosophy), Positive-definite matrix