QSPLINE

MaRDI QIDQ19347swMATHFDO

Official website http://rd.springer.com/article/10.1023%2FA%3A1024029423064

Described by source

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

Cited in

(8)

• Dominant speed factors of active set methods for fast MPC
• QPCOMP
• QPBOX
• gpcg
• QPC
• AAFAC
• Regularized gap function as penalty term for constrained minimization problems
• Maximum-likelihood detection based on branch and bound algorithm for MIMO systems

This page was built for software: QSPLINE