Further Results on the Exploration of Combinatorial Tree in Multi-Parametric Quadratic Programming - Archive ouverte HAL Access content directly
Conference Papers Year :

Further Results on the Exploration of Combinatorial Tree in Multi-Parametric Quadratic Programming

(1) , (2, 3) , (1)
1
2
3

Abstract

— A combinatorial approach has been recently proposed for multi-parametric quadratic programming and has shown to be more effective in finding the complete solution than existing geometric methods for higher-order systems. In this paper, we propose a method for exploring the combinatorial tree which exploits some of the underlying geometric properties of adjacent critical regions as the supplementary information in combinatorial approach to exclude a noticeable number of feasible candidate active sets from combinatorial tree. This method is particularly well-suited for cases where many combinations of active constraints are feasible but not optimal. Results indicate that this method can find all critical regions corresponding to non-degenerate multi-parametric programming. A post-processing algorithm can be applied to complete the proposed method in the cases in which some critical regions might not be enumerated due to degeneracies in the problem.
Fichier principal
Vignette du fichier
ECC16_0214_FI.pdf (334.84 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01429237 , version 1 (07-01-2017)

Identifiers

Cite

Parisa Ahmadi-Moshkenani, Sorin Olaru, Tor Arne Johansen. Further Results on the Exploration of Combinatorial Tree in Multi-Parametric Quadratic Programming. 15th European Control Conference (ECC 2016), Jun 2016, Aalborg, Denmark. ⟨10.1109/ecc.2016.7810273⟩. ⟨hal-01429237⟩
432 View
278 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More