Premium
A convexity‐based homotopy method for nonlinear optimization in model predictive control
Author(s) -
Bonilla Julián,
Diehl Moritz,
Logist Filip,
De Moor Bart,
Van Impe Jan F. M.
Publication year - 2010
Publication title -
optimal control applications and methods
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.458
H-Index - 44
eISSN - 1099-1514
pISSN - 0143-2087
DOI - 10.1002/oca.945
Subject(s) - convexity , initialization , mathematics , mathematical optimization , convex optimization , model predictive control , benchmark (surveying) , homotopy , regular polygon , nonlinear system , nonlinear programming , optimal control , control theory (sociology) , computer science , control (management) , artificial intelligence , physics , geometry , geodesy , quantum mechanics , financial economics , pure mathematics , economics , programming language , geography
Abstract This paper presents a convexity‐based homotopy solution procedure to non‐convex optimal control problems (OCPs) arising in model predictive control. The approach deals with a special class of OCP formulations, where the dynamic system involved is control‐affine and the objective is a penalty on deviations from a state reference trajectory. The non‐convex OCP is modified by introducing a penalized pseudo state and a homotopy parameter which gradually transforms the original problem into a convex one. The method solves first this convex formulation and uses the result to initialize the solution of the next problem on the zero path, recovering the original OCP. The proposed methodology is evaluated for the benchmark control problem of an isothermal chemical reactor with Van de Vusse reactions and input multiplicity. For the simple case with control horizon one, the method is able to find the global solution due to the convex initialization, while local optimization techniques only lead to a local minimum. Copyright © 2010 John Wiley & Sons, Ltd.