QSPLINE

swMATH7307MaRDI QIDQ19347FDOQ19347

Author name not available (Why is that?)

Described by source

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

Cited In (3)

• Dominant speed factors of active set methods for fast MPC
• 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