On the complexity of the convex liftings-based solution to inverse parametric convex programming problems

Ngoc Anh Nguyen 1, 2 Sorin Olaru 3, 2, 1 Pedro Rodriguez-Ayerbe 2, 1
3 DISCO - Dynamical Interconnected Systems in COmplex Environments
L2S - Laboratoire des signaux et systèmes, Inria Saclay - Ile de France, SUPELEC, CNRS - Centre National de la Recherche Scientifique : UMR8506
Abstract : The link between linear model predictive control (MPC) and parametric linear/quadratic programming has reached maturity in terms of the characterization of the structural properties and the numerical methods available for the effective resolution. The computational complexity is one of the current bottlenecks for these control design methods and inverse optimality has been recently shown to provide a new perspective for this challenge. However, the question of the minimal complexity of inverse optimality formulation is still open and much under discussion. In this paper we revisit some recent results by pointing out unnecessary geometrical complications which can be avoided by the interpretation of the optimality conditions. Two algorithms for fine-tuning inverse optimality formulation will be proposed and the results will be interpreted via two illustrative examples in comparison with existing formulations.
Document type :
Conference papers
Complete list of metadatas

https://hal-supelec.archives-ouvertes.fr/hal-01140609
Contributor : Pascale Lepeltier <>
Submitted on : Thursday, April 9, 2015 - 9:50:19 AM
Last modification on : Thursday, April 26, 2018 - 3:50:31 PM

Identifiers

Citation

Ngoc Anh Nguyen, Sorin Olaru, Pedro Rodriguez-Ayerbe. On the complexity of the convex liftings-based solution to inverse parametric convex programming problems. 14th annual European Control Conference - ECC 2015, Jul 2015, Linz, Austria. ⟨10.1109/ecc.2015.7331064 ⟩. ⟨hal-01140609⟩

Share

Metrics

Record views

500