An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity

DOI10.1080/01630560701277930zbMath1117.65094OpenAlexW2103299621MaRDI QIDQ3444677

Yanjin Wang, Pusheng Fei

Publication date: 4 June 2007

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

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

zbMATH Keywords

convergenceconvex quadratic programmingpolynomial time complexityinfeasible interior point algorithmMizuno-Todd-Ye type algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20) Interior-point methods (90C51) Complexity and performance of numerical algorithms (65Y20)

Related Items (2)

An interior point-proximal method of multipliers for convex quadratic programming ⋮ A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming

Cites Work

• A new polynomial-time algorithm 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-time algorithm for a class of linear complementarity problems
• Karmarkar's linear programming algorithm and Newton's method
• Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP
• A path following method for LCP with superlinearly convergent iteration sequence
• An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
• An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
• A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
• On the Implementation of a Primal-Dual Interior Point Method
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• Predictor-corrector Methods for a Class of Linear Complementarity Problems
• A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity
• A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
• Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
• Two Infeasible Interior-Point Predictor-Corrector Algorithms for Linear Programming

This page was built for publication: An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity