A New Practically Efficient Interior Point Method for Convex Quadratic Programming

DOI10.1142/9789812813220_0003zbMath1223.90037OpenAlexW2477392069MaRDI QIDQ3542359

Katta G. Murty

Publication date: 1 December 2008

Published in: Mathematical Programming and Game Theory for Decision Making (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/9789812813220_0003

zbMATH Keywords

interior point methodconvex quadratic programmingdescent methodcentering strategy

Mathematics Subject Classification ID

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

This page was built for publication: A New Practically Efficient Interior Point Method for Convex Quadratic Programming