Thu.2 10:45–12:00 | H 2013 | PDE
.

PDE-constrained Optimization Under Uncertainty (2/3)

Chair: Harbir Antil Organizers: Harbir Antil, Drew Philip Kouri, Thomas Michael Surowiec, Stefan Ulbrich, Michael Ulbrich
10:45

Thomas Michael Surowiec

joint work with Drew Philip Kouri

A primal-dual algorithm for PDE-constrained optimization under uncertainty

We propose a primal-dual algorithm for solving nonsmooth risk-averse optimization problems in Banach spaces motivated by PDE-constrained optimization under uncertainty. The overall algorithm is based on the well-known method of multipliers, whereas the subproblem solves are based on inexact Newton solvers for smooth PDE-constrained problems. The analysis exploits a number of recent results on the epigraphical regularization of risk measures. We prove convergence of the algorithm for solutions and stationary points and we conclude with several illustrative numerical examples

11:10

Ekaterina Kostina

Robustness aspects in model validation for dynamic processes

Development and quantitative validation of complex nonlinear dynamic models is a difficult task that requires the support by numerical methods for parameter estimation, and the optimal design of experiments. In this talk special emphasis is placed on issues of robustness, i.e. how to take into account uncertainties - such as outliers in the measurements for parameter estimation, and the dependence of optimal experiments on unknown values of model parameters. New numerical methods will be presented, and applications will be discussed that indicate a wide scope of applicability of the methods.

11:35

Andreas Van Barel

joint work with Stefan Vandewalle

Multilevel Quasi-Monte Carlo for stochastic PDE constrained optimization

This talk explores the use of multilevel quasi-Monte Carlo methods to generate estimations of gradients and Hessian-vector products for the optimization of PDEs with random coefficients. In ideal circumstances, the computational effort may scale linearly with the required accuracy, instead of quadratically, as is the case for Monte Carlo based methods. The performance is tested for a tracking type robust optimization problem constrained by an elliptic diffusion PDE with lognormal diffusion coefficient.