An interior-exterior approach for convex quadratic programming
From MaRDI portal
Publication:436003
DOI10.1016/J.APNUM.2011.03.004zbMATH Open1256.65053OpenAlexW2090094417MaRDI QIDQ436003FDOQ436003
Authors: 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
Recommendations
- An exterior point polynomial-time algorithm for convex quadratic programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- A new penalty function algorithm for convex quadratic programming
- scientific article; zbMATH DE number 617926
- An extension of Karmarkar's projective algorithm for convex quadratic programming
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Convex programming (90C25) Interior-point methods (90C51)
Cites Work
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Path-Following Methods for Linear Programming
- An extension of Karmarkar's projective algorithm for 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
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: An interior-exterior approach for convex quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436003)
