DeepAI AI Chat
Log In Sign Up

A trust region reduced basis Pascoletti-Serafini algorithm for multi-objective PDE-constrained parameter optimization

by   Stefan Banholzer, et al.
University of Konstanz

In the present paper non-convex multi-objective parameter optimization problems are considered which are governed by elliptic parametrized partial differential equations (PDEs). To solve these problems numerically the Pascoletti-Serafini scalarization is applied and the obtained scalar optimization problems are solved by an augmented Lagrangian method. However, due to the PDE constraints, the numerical solution is very expensive so that a model reduction is utilized by using the reduced basis (RB) method. The quality of the RB approximation is ensured by a trust-region strategy which does not require any offline procedure, where the RB functions are computed in a greedy algorithm. Moreover, convergence of the proposed method is guaranteed. Numerical examples illustrate the efficiency of the proposed solution technique.


page 1

page 2

page 3

page 4


A non-conforming dual approach for adaptive Trust-Region Reduced Basis approximation of PDE-constrained optimization

In this contribution we propose and rigorously analyze new variants of a...

Discrete Empirical Interpolation and unfitted mesh FEMs: application in PDE-constrained optimization

In this work, we investigate the performance CutFEM as a high fidelity s...

Derivative-Free Multiobjective Trust Region Descent Method Using Radial Basis Function Surrogate Models

We present a flexible trust region descend algorithm for unconstrained a...

Trust Region Method for Coupled Systems of PDE Solvers and Deep Neural Networks

Physics-informed machine learning and inverse modeling require the solut...

Multilevel Active-Set Trust-Region (MASTR) Method for Bound Constrained Minimization

We introduce a novel variant of the recursive multilevel trust-region (R...