LI Zhi-yong
Abstract
In the paper,the primal nonlinear convex semidefinite programming problem is transformed into a new problem whose subject function is linear.Then,the new problem is solved by cut-plane algorithm.At last,we show that the algorithm is convergence.
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.
In the paper,the primal nonlinear convex semidefinite programming problem is transformed into a new problem whose subject function is linear.Then,the new problem is solved by cut-plane algorithm.At last,we show that the algorithm is convergence.
Key concepts: Semidefinite programming, Semidefinite embedding, Cutting-plane method, Nonlinear programming, Mathematics, Mathematical optimization, Conic optimization, Regular polygon