An interior-exterior approach for convex quadratic programming

DOI10.1016/j.apnum.2011.03.004zbMath1256.65053OpenAlexW2090094417MaRDI QIDQ436003

Khalid El Yassini, Safae El-Haj Ben-Ali

Publication date: 13 July 2012

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apnum.2011.03.004

zbMATH Keywords

polynomial time algorithmconvex quadratic programmingnumerical resultinterior-exterior approach

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20) Interior-point methods (90C51)

Related Items (1)

An exterior point polynomial-time algorithm for convex quadratic programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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. II: Convex quadratic programming
• A new polynomial time method for a linear complementarity problem
• Condition measures and properties of the central trajectory of a linear program
• Path-Following Methods for Linear Programming

This page was built for publication: An interior-exterior approach for convex quadratic programming