Combinatorial Multi-Parametric Quadratic Programming with Saturation Matrix Based Pruning - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Combinatorial Multi-Parametric Quadratic Programming with Saturation Matrix Based Pruning

Résumé

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 based on a saturation matrix pruning criterion which uses geometric properties of the constraint polyhedron for excluding infeasible constraint combinations from the candidate active set enumeration. Performance improvements are discussed for both practical and random example problems from the area of explicit linear MPC.
Fichier non déposé

Dates et versions

hal-00751239 , version 1 (13-11-2012)

Identifiants

Citer

Christian Feller, Tor Arme Johansen, Sorin Olaru. Combinatorial Multi-Parametric Quadratic Programming with Saturation Matrix Based Pruning. CDC 2012 - 51st IEEE Conference on Decision and Control, Dec 2012, Maui, Hawaii, United States. pp.4562-4567, ⟨10.1109/CDC.2012.6426418⟩. ⟨hal-00751239⟩
104 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More