scholarly journals Risk-averse optimal control of semilinear elliptic PDEs

2020 ◽  
Vol 26 ◽  
pp. 53 ◽  
Author(s):  
D.P. Kouri ◽  
T.M. Surowiec

In this paper, we consider the optimal control of semilinear elliptic PDEs with random inputs. These problems are often nonconvex, infinite-dimensional stochastic optimization problems for which we employ risk measures to quantify the implicit uncertainty in the objective function. In contrast to previous works in uncertainty quantification and stochastic optimization, we provide a rigorous mathematical analysis demonstrating higher solution regularity (in stochastic state space), continuity and differentiability of the control-to-state map, and existence, regularity and continuity properties of the control-to-adjoint map. Our proofs make use of existing techniques from PDE-constrained optimization as well as concepts from the theory of measurable multifunctions. We illustrate our theoretical results with two numerical examples motivated by the optimal doping of semiconductor devices.

2018 ◽  
Vol 70 (3) ◽  
pp. 641-675 ◽  
Author(s):  
Christoph Buchheim ◽  
Renke Kuhlmann ◽  
Christian Meyer

Author(s):  
M. Hoffhues ◽  
W. Römisch ◽  
T. M. Surowiec

AbstractThe vast majority of stochastic optimization problems require the approximation of the underlying probability measure, e.g., by sampling or using observations. It is therefore crucial to understand the dependence of the optimal value and optimal solutions on these approximations as the sample size increases or more data becomes available. Due to the weak convergence properties of sequences of probability measures, there is no guarantee that these quantities will exhibit favorable asymptotic properties. We consider a class of infinite-dimensional stochastic optimization problems inspired by recent work on PDE-constrained optimization as well as functional data analysis. For this class of problems, we provide both qualitative and quantitative stability results on the optimal value and optimal solutions. In both cases, we make use of the method of probability metrics. The optimal values are shown to be Lipschitz continuous with respect to a minimal information metric and consequently, under further regularity assumptions, with respect to certain Fortet-Mourier and Wasserstein metrics. We prove that even in the most favorable setting, the solutions are at best Hölder continuous with respect to changes in the underlying measure. The theoretical results are tested in the context of Monte Carlo approximation for a numerical example involving PDE-constrained optimization under uncertainty.


2019 ◽  
Vol 10 (1) ◽  
pp. 123-152
Author(s):  
Andrea Manzoni ◽  
Stefano Pagani

Abstract We present a certified reduced basis (RB) framework for the efficient solution of PDE-constrained parametric optimization problems. We consider optimization problems (such as optimal control and optimal design) governed by elliptic PDEs and involving possibly non-convex cost functionals, assuming that the control functions are described in terms of a parameter vector. At each optimization step, the high-fidelity approximation of state and adjoint problems is replaced by a certified RB approximation, thus yielding a very efficient solution through an “optimize-then-reduce” approach. We develop a posteriori error estimates for the solutions of state and adjoint problems, the cost functional, its gradient and the optimal solution. We confirm our theoretical results in the case of optimal control/design problems dealing with potential and thermal flows.


Sign in / Sign up

Export Citation Format

Share Document