An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints.
From MaRDI portal
Publication:1875003
DOI10.1023/A:1024029423064zbMATH Open1081.90048MaRDI QIDQ1875003FDOQ1875003
Authors: Wu Li, J. J. de Nijs 
Publication date: 24 August 2004
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Recommendations
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Approximating quadratic programming with bound and quadratic constraints
- A new linesearch method for quadratically constrained convex programming
- scientific article; zbMATH DE number 679874
- Solving quadratically constrained convex optimization problems with an interior-point method
- A quadratically convergent method for linear programming
- An unconstrained convex programming approach to solving convex quadratic programming problems
- A branch and bound algorithm for nonconvex quadratic programming with quadratic constraints
- A branch and bound algorithm for quantified quadratic programming
- A solver for nonconvex bound-constrained quadratic optimization
Cited In (6)
- Dominant speed factors of active set methods for fast MPC
- Regularized gap function as penalty term for constrained minimization problems
- QSPLINE
- A New Algorithm for Solving Strictly Convex Quadratic Programs
- A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines
- Maximum-likelihood detection based on branch and bound algorithm for MIMO systems
Uses Software
This page was built for publication: An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1875003)
