An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints.

DOI10.1023/A:1024029423064zbMath1081.90048MaRDI QIDQ1875003

J. J. de Nijs, Wu Li

Publication date: 24 August 2004

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Related Items (4)

Maximum-likelihood detection based on branch and bound algorithm for MIMO systems ⋮ Dominant speed factors of active set methods for fast MPC ⋮ Regularized gap function as penalty term for constrained minimization problems ⋮ QSPLINE

Uses Software

• QPCOMP
• QPBOX
• gpcg
• AAFAC

This page was built for publication: An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints.