A long step primal-dual path-following algorithm for convex quadratic semidefinite programming

MaRDI QIDQ4983833zbMATH OpenFDO

Authors You-fang Zeng, Jian-Ling Li, Peipei Wang, Jinbao Jian

Publication date 26 April 2021

zbMATH Keywords

central pathconvex quadratic semidefinite programmingiterative complexityNesterov-Todd directionpath-following algorithm

Mathematics Subject Classification ID

Quadratic programming (90C20) Semidefinite programming (90C22) Convex programming (90C25)

Recommendations

• A new primal-dual path-following algorithm for convex quadratic semidefinite programming
• A long-step primal-dual path-following method for semidefinite programming
• A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
• scientific article; zbMATH DE number 1182576
• A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization

Cited in

(7)

• A long-step primal-dual path-following method for semidefinite programming
• Long-step strategies in interior-point primal-dual methods
• A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP
• A new primal-dual path-following algorithm for convex quadratic semidefinite programming
• scientific article; zbMATH DE number 1182576 (Why is no real title available?)
• On Long Step Path Following and SUMT for Linear and Quadratic Programming
• A long-step barrier method for convex quadratic programming

This page was built for publication: A long step primal-dual path-following algorithm for convex quadratic semidefinite programming

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