An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints.
From MaRDI portal
Publication:1875003
DOI10.1023/A:1024029423064zbMath1081.90048MaRDI QIDQ1875003
Publication date: 24 August 2004
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Related Items
Dominant speed factors of active set methods for fast MPC, QSPLINE, Regularized gap function as penalty term for constrained minimization problems, Maximum-likelihood detection based on branch and bound algorithm for MIMO systems
Uses Software