Pages that link to "Item:Q1875003"
From MaRDI portal
The following pages link to An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints. (Q1875003):
Displayed 4 items.
- QSPLINE (Q19347) (← links)
- Regularized gap function as penalty term for constrained minimization problems (Q1018314) (← links)
- Maximum-likelihood detection based on branch and bound algorithm for MIMO systems (Q2425858) (← links)
- Dominant speed factors of active set methods for fast MPC (Q5745039) (← links)