Every Continuous Nonlinear Control System Can be Obtained by Parametric Convex Programming
- 23 September 2008
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 53 (8) , 1963-1967
Abstract
In this short note, we define parametric convex programming (PCP) in a slightly different manner than it is usually done by extending convexity not only to variables but also to the parameters, and we show that the widely applied model predictive control (MPC) technique is a particular case of PCP. The main result of the note is an answer to the inverse question of PCP: which feedback laws can be generated by PCP? By employing results of convex analysis, we provide a constructive proof-yet not computational-that allows us to conclude that every continuous feedback law can be obtained by PCP.Keywords
This publication has 12 references indexed in Scilit:
- Approximate robust dynamic programming and robustly stable MPCAutomatica, 2006
- An Algorithm for Approximate Multiparametric Convex ProgrammingComputational Optimization and Applications, 2006
- Robust Dynamic Programming for Min–Max Model Predictive Control of Constrained Uncertain SystemsIEEE Transactions on Automatic Control, 2004
- Convex Optimization2004
- An algorithm for multi-parametric quadratic programming and explicit MPC solutionsAutomatica, 2003
- The explicit linear quadratic regulator for constrained systemsAutomatica, 2002
- Constrained model predictive control: Stability and optimalityAutomatica, 2000
- Model predictive control: Theory and practice—A surveyAutomatica, 1989
- A sufficient condition for continuity of optimal sets in mathematical programmingJournal of Mathematical Analysis and Applications, 1974
- When Is a Linear Control System Optimal?Journal of Basic Engineering, 1964