Polynomial complexity of primal-dual interior-point methods for convex quadratic programming with self-regular proximity

zbMATH Open1212.90284MaRDI QIDQ3572887FDOQ3572887

Authors: Zhongyi Liu 

Publication date: 8 July 2010

Recommendations

• Properties Of Primal Interior Point Methods For QP^∗
• A new primal-dual polynomial algorithm for convex quadratic programming
• An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• A new primal-dual interior-point algorithm for convex quadratic optimization

zbMATH Keywords

polynomial complexityprimal-dualconvex quadratic programminginterior-point methodlarge-update

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25) Interior-point methods (90C51)

Cited In (1)

• A new primal-dual polynomial algorithm for convex quadratic programming

This page was built for publication: Polynomial complexity of primal-dual interior-point methods for convex quadratic programming with self-regular proximity

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