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

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

Cited literature [15 references]  Display  Hide  Download

Contributor : Sorin Olaru <>
Submitted on : Saturday, January 7, 2017 - 1:22:37 PM
Last modification on : Friday, December 20, 2019 - 11:48:05 AM
Long-term archiving on: Saturday, April 8, 2017 - 12:13:54 PM


Files produced by the author(s)



Parisa Ahmadi-Moshkenani, Sorin Olaru, Tor 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⟩



Record views


Files downloads