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

Search

Browse

My Space

A deterministic global optimization algorithm for problems with nonlinear dynamics

Papamichail Ioannis, C. S. Adjiman

Simple record

URIhttp://purl.tuc.gr/dl/dias/21BE77EB-9F94-450B-9970-D9DA2801290E-
Identifierhttps://doi.org/10.1007/978-1-4613-0251-3_1-
Languageen-
TitleA deterministic global optimization algorithm for problems with nonlinear dynamics en
CreatorPapamichail Ioannisen
CreatorC. S. Adjimanen
PublisherSpringer Verlagen
Content SummaryA 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.en
Type of ItemΣύντομη Δημοσίευση σε Συνέδριοel
Type of ItemConference Short Paperen
Licensehttp://creativecommons.org/licenses/by/4.0/en
Date of Item2015-11-09-
Date of Publication2002-
Bibliographic CitationC. 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_1en

Services

Statistics

 

Copyright © DIAS 2013