An Analytic Center Cutting Plane Method for Solving Semidefinite Programming
YU Yi-dan
Abstract
YU Yi-dan
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.
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.
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