Michael Dellnitz

Michael Dellnitz


Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 February 2008 in Journal of Global Optimization
Verified
Journal Article
Closed access
PDF file
Oliver SchuetzeOliver Schuetze
Oliver Schuetze
MLMarco Laumanns
Marco Laumanns
Carlos CoelloCarlos Coello
Carlos Coello
MDMichael Dellnitz
Michael Dellnitz
ETEl-Ghazali Talbi
El-Ghazali Talbi

Verified
Journal Article
Open access
PDF file
Sebastian PeitzSebastian Peitz
Sebastian Peitz
MDMichael Dellnitz
Michael Dellnitz
Multiobjective optimization plays an increasingly important role in modern applications, where several criteria are often of equal importance. The task in multiobjective optimization and multiobjective optimal control is therefore to compute the set of optimal compromises (the Pareto set) between the conflicting objectives. The advances in algorithms and the increasing interest in Pareto-optimal solutions have led to a wide range of new applications related to optimal and feedback control, which results in new challenges such as expensive models or real-time applicability. Since the Pareto set generally consists of an infinite number of solutions, the computational effort can quickly become challenging, which is particularly problematic when the objectives are costly to evaluate or when a solution has to be presented very quickly. This article gives an overview of recent developments in accelerating multiobjective optimal control for complex problems where either PDE constraints are present or where a feedback behavior has to be achieved. In the first case, surrogate models yield significant speed-ups. Besides classical meta-modeling techniques for multiobjective optimization, a promising alternative for control problems is to introduce a surrogate model for the system dynamics. In the case of real-time requirements, various promising model predictive control approaches have been proposed, using either fast online solvers or offline-online decomposition. We also briefly comment on dimension reduction in many-objective optimization problems as another technique for reducing the numerical effort.

14 October 2006
Verified
Book Chapter
Closed access
PDF file
MDMichael Dellnitz
Michael Dellnitz
MMMirko Hessel-Von Molo
Mirko Hessel-Von Molo
PMPhilipp Metzner
Philipp Metzner
RPRobert Preis
Robert Preis
CSChristof Schuette
Christof Schuette

1 January 2016 in Journal of Computational Dynamics
Verified
Journal Article
Open access
PDF file
MDMichael Dellnitz
Michael Dellnitz
MMMirko Hessel-Von Molo
Mirko Hessel-Von Molo
AZAdrian Ziessler
Adrian Ziessler
In this work we present a novel framework for the computation of finite dimensional invariant sets of infinite dimensional dynamical systems. It extends a classical subdivision technique [7] for the computation of such objects of finite dimensional systems to the infinite dimensional case by utilizing results on embedding techniques for infinite dimensional systems. We show how to implement this approach for the analysis of delay differential equations and illustrate the feasibility of our implementation by computing invariant sets for three different delay differential equations.

1 April 2006 in Journal of Global Optimization
Verified
Journal Article
Closed access
PDF file
SSStefan Sertl
Stefan Sertl
MDMichael Dellnitz
Michael Dellnitz

1 January 2005 in Discrete and Continuous Dynamical Systems
Verified
Journal Article
Open access
PDF file
ABAnthony W. Baker
Anthony W. Baker
MDMichael Dellnitz
Michael Dellnitz
OJOliver Junge
Oliver Junge
We present a technique for the rigorous computation of periodic orbits in certain ordinary differential equations. The method combines set oriented numerical techniques for the computation of invariant sets in dynamical systems with topological index arguments. It not only allows for the proof of existence of periodic orbits but also for a precise (and rigorous) approximation of these. As an example we compute a periodic orbit for a differential equation introduced in [2].