In a wide range of applications it is desirable to optimally control a dynamical system with respect to concurrent, potentially competing goals. This gives rise to a multiobjective optimal control problem where, instead of computing a single optimal solution, the set of optimal compromises, the so-called Pareto set, has to be approximated. When the problem under consideration is described by a partial differential equation (PDE), as is the case for fluid flow, the computational cost rapidly increases and makes its direct treatment infeasible. Reduced order modeling is a very popular method to reduce the computational cost, in particular in a multi query context such as uncertainty quantification, parameter estimation or optimization. In this article, we show how to combine reduced order modeling and multiobjective optimal control techniques in order to efficiently solve multiobjective optimal control problems constrained by PDEs. We consider a global, derivative free optimization method as well as a local, gradient-based approach for which the optimality system is derived in two different ways. The methods are compared with regard to the solution quality as well as the computational effort and they are illustrated using the example of the flow around a cylinder and a backward-facing-step channel flow.
We develop new algorithms for global optimization by combining well known branch and bound methods with multilevel subdivision
techniques for the computation of invariant sets of dynamical systems. The basic idea is to view iteration schemes for local
optimization problems – e.g. Newton’s method or conjugate gradient methods – as dynamical systems and to compute set coverings
of their fixed points. The combination with bounding techniques allow for the computation of coverings of the global optima
only. We show convergence of the new algorithms and present a particular implementation.
Michael Dellnitz - Research of the authors is partially supported by the Deutsche Forschungsgemeinschaft within the Sonderforschungsbereich
376 相似文献
To detect and study cohesive subgroups of actors is a main objective in social network analysis. What are the respective relations inside such groups and what separates them from the outside. Entropy-based analysis of network structures is an up-and-coming approach. It turns out to be a powerful instrument to detect certain forms of cohesive subgroups and to compress them to superactors without loss of information about their embeddedness in the net: Compressing strongly connected subgroups leaves the whole net’s and the (super-)actors’ information theoretical indices unchanged; i.e., such compression is information-invariant. The actual article relates on the reduction of networks with hundreds of actors. All entropy-based calculations are realized in an expert system shell. 相似文献
In contrast to classical optimization problems, in multiobjective optimization several objective functions are considered at the same time. For these problems, the solution is not a single optimum but a set of optimal compromises, the so-called Pareto set. In this work, we consider multiobjective optimization problems that additionally depend on an external parameter ${\lambda \in \mathbb{R}}$, so-called parametric multiobjective optimization problems. The solution of such a problem is given by the λ-dependent Pareto set. In this work we give a new definition that allows to characterize λ-robust Pareto points, meaning points which hardly vary under the variation of the parameter λ. To describe this task mathematically, we make use of the classical calculus of variations. A system of differential algebraic equations will turn out to describe λ-robust solutions. For the numerical solution of these equations concepts of the discrete calculus of variations are used. The new robustness concept is illustrated by numerical examples. 相似文献
Summary. Each invariant set of a given dynamical system is part of the global attractor. Therefore the global attractor contains all
the potentially interesting dynamics, and, in particular, it contains every (global) unstable manifold. For this reason it
is of interest to have an algorithm which allows to approximate the global attractor numerically. In this article we develop
such an algorithm using a subdivision technique. We prove convergence of this method in a very general setting, and, moreover,
we describe the qualitative convergence behavior in the presence of a hyperbolic structure. The algorithm can successfully
be applied to dynamical systems of moderate dimension, and we illustrate this fact by several numerical examples.
Received May 11, 1995 / Revised version received December 6, 1995 相似文献
In this work we investigate the convergence of stochastic search algorithms toward the Pareto set of continuous multi-objective
optimization problems. The focus is on obtaining a finite approximation that should capture the entire solution set in a suitable
sense, which will be defined using the concept of ε-dominance. Under mild assumptions about the process to generate new candidate solutions, the limit approximation set will
be determined entirely by the archiving strategy. We propose and analyse two different archiving strategies which lead to
a different limit behavior of the algorithms, yielding bounds on the obtained approximation quality as well as on the cardinality
of the resulting Pareto set approximation.
相似文献
In the last two decades, the mathematical analysis of material transport has received considerable interest in many scientific fields such as ocean dynamics and astrodynamics. In this contribution we focus on the numerical detection and approximation of transport barriers in dynamical systems. Starting from a set-oriented approximation of the dynamics we combine discrete concepts from graph theory with established geometric ideas from dynamical systems theory. We derive the global transport barriers by computing the local expansion properties of the system. For the demonstration of our results we consider two different systems. First we explore a simple flow map inspired by the dynamics of the global ocean. The second example is the planar circular restricted three body problem with Sun and Jupiter as primaries, which allows us to analyze particle transport in the solar system. 相似文献
In this work, we present a new set-oriented numerical method for the numerical solution of multiobjective optimization problems. These methods are global in nature and allow to approximate the entire set of (global) Pareto points. After proving convergence of an associated abstract subdivision procedure, we use this result as a basis for the development of three different algorithms. We consider also appropriate combinations of them in order to improve the total performance. Finally, we illustrate the efficiency of these techniques via academic examples plus a real technical application, namely, the optimization of an active suspension system for cars.The authors thank Joachim Lückel for his suggestion to get into the interesting field of multiobjective optimization. Katrin Baptist as well as Frank Scharfeld helped the authors with fruitful discussions. This work was partly supported by the
Deutsche Forschungsgemeinschaft within SFB 376 and SFB 614. 相似文献
We consider complex dynamical systems showing metastable behavior, but no local separation of fast and slow time scales. The article raises the question of whether such systems exhibit a low-dimensional manifold supporting its effective dynamics. For answering this question, we aim at finding nonlinear coordinates, called reaction coordinates, such that the projection of the dynamics onto these coordinates preserves the dominant time scales of the dynamics. We show that, based on a specific reducibility property, the existence of good low-dimensional reaction coordinates preserving the dominant time scales is guaranteed. Based on this theoretical framework, we develop and test a novel numerical approach for computing good reaction coordinates. The proposed algorithmic approach is fully local and thus not prone to the curse of dimension with respect to the state space of the dynamics. Hence, it is a promising method for data-based model reduction of complex dynamical systems such as molecular dynamics. 相似文献