Properties Of Primal Interior Point Methods For QP∗

DOI10.1080/02331939608844216zbMath0867.90088OpenAlexW2016449665MaRDI QIDQ5689843

Tian-de Guo, Shiquan Wu

Publication date: 7 January 1997

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939608844216

zbMATH Keywords

convex quadratic programsKarmarkar's methodapproximately projected Newton directionlog-barrier functionrank-one techniquesnull space techniquesprimal interior point algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• A new polynomial-time algorithm for linear programming
• A polynomial-time algorithm, based on Newton's method, for linear programming
• An extension of Karmarkar's projective algorithm for convex quadratic programming
• Interior path following primal-dual algorithms. I: Linear programming
• A polynomial method of approximate centers for linear programming
• On the convergence of the method of analytic centers when applied to convex quadratic programs
• An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
• An Algorithm for Convex Quadratic Programming That Requires O(n^3.5L) Arithmetic Operations