The quadratic semi-definite programming problem and its interior point algorithm

MaRDI QIDQ5319116zbMATH OpenFDO

Authors Zhilin Kang, Shenggui Zhang

Publication date 22 July 2009

zbMATH Keywords

duality theoryinterior point algorithmquadratic semi-definite programmingsemi-definite least-squares

Mathematics Subject Classification ID

Quadratic programming (90C20) Interior-point methods (90C51) Semidefinite programming (90C22)

Recommendations

• Primal dual algorithm for quadratic semi-definite programming
• Existence and uniqueness of K.\,.\,S.\,.\,H search direction of interior point algorithms for a class of quadratic semidefinite programming
• scientific article; zbMATH DE number 5629815
• A polynomial-time interior-point algorithm for convex quadratic semidefinite optimization
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming

Cited in

(4)

• An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs
• Two-point mid-range approximation enhanced recursive quadratic programming method
• Existence and uniqueness of K.\,.\,S.\,.\,H search direction of interior point algorithms for a class of quadratic semidefinite programming
• Primal dual algorithm for quadratic semi-definite programming

This page was built for publication: The quadratic semi-definite programming problem and its interior point algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5319116)