On active-set methods for the quadratic programming problem
From MaRDI portal
Recommendations
- An Infeasible Active Set Method for Quadratic Problems with Simple Bounds
- Primal-dual method of solving convex quadratic programming problems
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
- An algorithm for solving quadratic programming problems with linear equality and inequality constraints.
Cited in
(11)- A dual-active-set algorithm for positive semi-definite quadratic programming
- An \(O(n^2)\) active set algorithm for the solution of a parametric quadratic program
- A perturbed SQP method with active set technology for unconstrained minimax problems
- A feasible active set method for strictly convex quadratic problems with simple bounds
- Inertia-Controlling Methods for General Quadratic Programming
- An Infeasible Active Set Method for Quadratic Problems with Simple Bounds
- Exact Complexity Certification of Active-Set Methods for Quadratic Programming
- An Active-Set Method for Quadratic Programming Based On Sequential Hot-Starts
- An active set sequential quadratic programming algorithm for nonlinear optimisation
- A random active set method for strictly convex quadratic problem with simple bounds
- Active constraints, indefinite quadratic test problems, and complexity
This page was built for publication: On active-set methods for the quadratic programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2836654)
