2009Journal of Qingdao UniversityRequires access

An Analytic Center Cutting Plane Method for Solving Semidefinite Programming

YU Yi-dan

Open publisher page 0 citations

Abstract

This paper deals with the large-scale semidefinite programming problems.An analytic center cutting plane method is given,which solves a linear relaxation of the dual semidefinite program in every iteration,and uses an analytic center of cutting plane as the next iteration point.The convergence of this method is proved,and eventually the practical example is given.

About this research paper

What this paper is about

This paper deals with the large-scale semidefinite programming problems.An analytic center cutting plane method is given,which solves a linear relaxation of the dual semidefinite program in every iteration,and uses an analytic center of cutting plane as the next iteration point.The convergence of this method is proved,and eventually the practical example is given.

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

This paper deals with the large-scale semidefinite programming problems.An analytic center cutting plane method is given,which solves a linear relaxation of the dual semidefinite program in every iteration,and uses an analytic center of cutting plane as the next iteration point.The convergence of this method is proved,and eventually the practical example is given.

Key concepts: Cutting-plane method, Semidefinite embedding, Semidefinite programming, Linear programming, Mathematical optimization, Mathematics, Relaxation (psychology), Interior point method

Related papers

Back to paper searchBrowse research topicsOriginal source
An Analytic Center Cutting Plane Method for Solving Semidefinite Programming — Research Paper | ScholarLens