Exact Complexity Certification of Active-Set Methods for Quadratic Programming
From MaRDI portal
Recommendations
- A Unifying Complexity Certification Framework for Active-Set Methods for Convex Quadratic Programming
- On active-set methods for the quadratic programming problem
- An O(n^ 2) active set method for solving a certain parametric quadratic program
- An \(O(n^2)\) active set algorithm for the solution of a parametric quadratic program
- An O(N^2) active set method for solving a parametric quadratic program
- A feasible active set method for strictly convex quadratic problems with simple bounds
- Active set methods with reoptimization for convex quadratic integer programming
- An active-set algorithm for norm constrained quadratic problems
- scientific article; zbMATH DE number 1131695
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints
Cited in
(9)- Complexity and convergence certification of a block principal pivoting method for box-constrained quadratic programs
- Improved recurrent neural network-based manipulator control with remote center of motion constraints: experimental results
- ROTEC: robust to early termination command governor for systems with limited computing capacity
- \texttt{acados} -- a modular open-source framework for fast embedded optimal control
- Linear complementarity model predictive control with limited iterations for box-constrained problems
- Optimal error governor for PID controllers
- Model predictive control of switched affine systems with dwell time constraints -- efficient formulation, approximation and embedded implementation
- Practical considerations for implementing robust-to-early termination model predictive control
- Active constraints, indefinite quadratic test problems, and complexity
This page was built for publication: Exact Complexity Certification of Active-Set Methods for Quadratic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4566978)
