Skip to Main content Skip to Navigation
Conference papers

Inverse parametric convex programming problems via convex liftings

Abstract : The present paper introduces a procedure to recover an inverse parametric linear or quadratic programming problem from a given liftable polyhedral partition over which a continuous piecewise affine function is defined. The solution to the resulting parametric linear problem is exactly the initial piecewise affine function over the given original parameter space partition. We provide sufficient conditions for the existence of solutions for such inverse problems. Furthermore, the constructive procedure proposed here requires at most one supplementary variable in the vector of optimization arguments. The principle of this method builds upon an inverse map to the orthogonal projection, known as a convex lifting. Finally, we show that the theoretical results has a practical interest in Model Predictive Control (MPC) design. It is shown that any linear Model Predictive Controller can be obtained through a reformulated MPC problem with control horizon equal to two prediction steps.
Document type :
Conference papers
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Pascale Lepeltier Connect in order to contact the contributor
Submitted on : Friday, May 22, 2015 - 2:56:01 PM
Last modification on : Tuesday, February 23, 2021 - 7:24:06 PM
Long-term archiving on: : Tuesday, September 15, 2015 - 6:43:20 AM


Files produced by the author(s)




Ngoc Anh Nguyen, Sorin Olaru, Pedro Rodriguez-Ayerbe, Morten Hovd, Ion Necoara. Inverse parametric convex programming problems via convex liftings. 19th World Congress of the International Federation of Automatic Control - IFAC 2014, Aug 2014, Cape Town, South Africa. ⟨10.3182/20140824-6-ZA-1003.02364⟩. ⟨hal-01086492⟩



Les métriques sont temporairement indisponibles