Asymptotic Properties of Monte Carlo Methods in Elliptic PDE-Constrained Optimization under Uncertainty

06/11/2021
by   Werner Römisch, et al.
0

Monte Carlo approximations for random linear elliptic PDE constrained optimization problems are studied. We use empirical process theory to obtain best possible mean convergence rates O(n^-1/2) for optimal values and solutions, and a central limit theorem for optimal values. The latter allows to determine asymptotically consistent confidence intervals by using resampling techniques.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/29/2021

Monte Carlo algorithm for the extrema of tempered stable processes

We develop a novel Monte Carlo algorithm for the vector consisting of th...
research
09/25/2022

Monte Carlo Gradient in Optimization Constrained by Radiative Transport Equation

Can Monte Carlo (MC) solvers be directly used in gradient-based methods ...
research
12/07/2022

Monte Carlo convergence rates for kth moments in Banach spaces

We formulate standard and multilevel Monte Carlo methods for the kth mom...
research
09/16/2023

Linear Monte Carlo quadrature with optimal confidence intervals

We study the numerical integration of functions from isotropic Sobolev s...
research
05/16/2019

Non-Asymptotic Inference in a Class of Optimization Problems

This paper describes a method for carrying out non-asymptotic inference ...
research
10/24/2022

An efficient Monte Carlo scheme for Zakai equations

In this paper we develop a numerical method for efficiently approximatin...
research
04/09/2018

Full version: An evaluation of estimation techniques for probabilistic reachability

We evaluate numerically-precise Monte Carlo (MC), Quasi-Monte Carlo (QMC...

Please sign up or login with your details

Forgot password? Click here to reset