A non-interior path following method for convex quadratic programming problems with bound constraints

DOI10.1023/B:COAP.0000013060.16224.31zbMath1061.90090MaRDI QIDQ1430274

Song Xu

Publication date: 27 May 2004

Published in: Computational Optimization and Applications (Search for Journal in Brave)

zbMATH Keywords

bound constraintsconvex quadratic programming problemsnon-interior path-following methods

Mathematics Subject Classification ID

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

Related Items (3)

Convex programming with single separable constraint and bounded variables ⋮ MINQ8: general definite and bound constrained indefinite quadratic programming ⋮ An exterior point polynomial-time algorithm for convex quadratic programming

This page was built for publication: A non-interior path following method for convex quadratic programming problems with bound constraints