QSPLINE

swMATH7307MaRDI QIDQ19347

No author found.

Described by source

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

Related Items (3)

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

This page was built for software: QSPLINE