Institutional Repository [SANDBOX]
Technical University of Crete
EN  |  EL

Search

Browse

My Space

A rigorous global optimization algorithm for problems with ordinary differential equations Journal of Global Optimization

Ioannis Papamichail, Claire S. Adjiman

Full record


URI: http://purl.tuc.gr/dl/dias/100C81A4-3DA8-4D9F-B9CF-C5159713184A
Year 2002
Type of Item Peer-Reviewed Journal Publication
License
Details
Bibliographic Citation Papamichail I. and Adjiman C.S., "A rigorous global optimization algorithm for problems with ordinary differential equations" Journal of Global Optimization, Vol. 24, no. 1, pp. 1-33, Sept. 2002. DOI: 10.1023/A:1016259507911 https://doi.org/10.1023/A:1016259507911
Appears in Collections

Summary

The optimization of systems which are described by ordinary differential equations (ODEs) is often complicated by the presence of nonconvexities. A deterministic spatial branch and bound global optimization algorithm is presented in this paper for systems with ODEs in the constraints. Upper bounds for the global optimum are produced using the sequential approach for the solution of the dynamic optimization problem. The required convex relaxation of the algebraic functions is carried out using well-known global optimization techniques. A convex relaxation of the time dependent information is obtained using the concept of differential inequalities in order to construct bounds on the space of solutions of parameter dependent ODEs as well as on their second-order sensitivities. This information is then incorporated in the convex lower bounding NLP problem. The global optimization algorithm is illustrated by applying it to four case studies. These include parameter estimation problems and simple optimal control problems. The application of different underestimation schemes and branching strategies is discussed.

Services

Statistics