2012Journal of Fujian Normal UniversityRequires access

Existence and Uniqueness of K..S..H Search Direction of Interior Point Algorithms for a Class of Quadratic Semidefinite Programming

Shenggui Zhang

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Semidefinite programming, Uniqueness, Mathematics, Semidefinite embedding, Quadratically constrained quadratic program, Interior point method, Class (philosophy), Positive-definite matrix

Related papers

Back to paper searchBrowse research topicsOriginal source
Existence and Uniqueness of K..S..H Search Direction of Interior Point Algorithms for a Class of Quadratic Semidefinite Programming — Research Paper | ScholarLens