Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/21BE77EB-9F94-450B-9970-D9DA2801290E | ||
| Year | 2002 | ||
| Type of Item | Conference Short Paper | ||
| License |
|
||
| Bibliographic Citation | C. S. Adjiman, I. Papamichail, "A deterministic global optimization algorithm for problems with nonlinear dynamics," in 4th International Conference on Frontiers in Global Optimization, 2003, pp. 1-23. doi: 10.1007/978-1-4613-0251-3_1 https://doi.org/10.1007/978-1-4613-0251-3_1 | ||
| Appears in Collections |
A deterministic spatial branch and bound global optimization algorithm is presented for systems with an initial value problem for a set of first-order, typically nonlinear, differential equations in the constraints. Upper bounds on the global minimum are obtained using the sequential approach for the local solution of the dynamic optimization problem. The solution of a convex relaxation of the problem provides lower bounds. Well-known convex underestimation techniques are used for the relaxation of the algebraic functions. The concept of differential inequalities is utilized for the development of parameter independent as well as parameter dependent bounds on the dynamic system. Three convex relaxation procedures are proposed for the parameter dependent solution of the initial value problem. The global optimization algorithm is illustrated by applying it to several case studies relevant to chemical engineering.
Copyright © DIAS 2013
