.png){kind=icon}
Return
An improved algorithm for combinatorial multi-parametric quadratic programming
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2013.02.022.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The goal of multi-parametric quadratic programming (mpQP) is to compute analytic solutions to parameter-dependent constrained optimization problems, e.g., in the context of explicit linear MPC. We propose an improved combinatorial mpQP algorithm that is based on implicit enumeration of all possible optimal active sets and a simple saturation matrix pruning criterion which uses geometric properties of the constraint polyhedron for excluding infeasible candidate active sets. In addition, techniques are presented that allow to reduce the complexity of the discussed algorithm in the presence of symmetric problem constraints. Performance improvements are discussed for two example problems from the area of explicit linear MPC. (c) 2013 Elsevier Ltd. All rights reserved.
Keywords:
Multi-parametric programming
Explicit constrained linear quadratic regulators
Predictive control
Journal
IF:
5.9
Papers:
1.2W
Citations:
6.3W
Organization
Cited Papers
ShareSaveAn algorithm for multi-parameffic quadratic programming and explicit MPC solutions.png)
AUTOMATICAOAAI
AUTOMATICAIF5.9
OAAIShareSaveOn the facet-to-facet property of solutions to convex parametric quadratic programsAUTOMATICAOAAI
AUTOMATICAIF5.9
OAAIShareSaveShareSaveShareSave no more
no more