Combinatorial Multi-Parametric Quadratic Programming with Saturation Matrix Based Pruning

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal-supelec.archives-ouvertes.fr/hal-00751239
Contributor : Josiane Dartron <>
Submitted on : Tuesday, November 13, 2012 - 9:09:21 AM
Last modification on : Thursday, April 5, 2018 - 12:30:14 PM

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

300