A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming

DOI10.1080/01630563.2010.520217zbMath1205.90214OpenAlexW2040781450MaRDI QIDQ3068659

Yanjin Wang

Publication date: 17 January 2011

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

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

zbMATH Keywords

convex quadratic programmingpolynomial complexityinfeasible interior point algorithm

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP
• A primal-dual infeasible-interior-point algorithm for linear programming
• Polynomiality of infeasible-interior-point algorithms for linear programming
• An infeasible-interior-point potential-reduction algorithm for linear programming
• An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• Predictor-corrector Methods for a Class of Linear Complementarity Problems
• Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
• Two Infeasible Interior-Point Predictor-Corrector Algorithms for Linear Programming
• A potential-reduction algorithm for linear complementarity problems

This page was built for publication: A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming