2008•Computational Mathematics and Mathematical PhysicsRequires access

A primal interior point method for the linear semidefinite programming problem

M. S. Babynin, V. G. Zhadan

Abstract

The linear semidefinite programming problem is examined. A primal interior point method is proposed to solve this problem. It extends the barrier-projection method used for linear programs. The basic properties of the proposed method are discussed, and its local convergence is proved.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

Key concepts: Interior point method, Semidefinite programming, Mathematics, Linear programming, Semidefinite embedding, Mathematical optimization, Convergence (economics), Second-order cone programming