Основні поняття
The authors present a combination technique (CT) to efficiently solve optimal control problems constrained by random partial differential equations. The CT combines solutions computed on coarse spatial grids and with few quadrature points to obtain an accurate approximation, while drastically reducing the computational cost compared to standard approaches.
Анотація
The content presents a new framework to discretize and solve optimal control problems (OCPs) constrained by random partial differential equations (PDEs). The authors consider the following optimization problem:
min_u E[F(y(ζ))] + ν/2 ||u||^2_U
s.t. <e(y(ζ), ζ), v> = <φ + Bu, v> ∀v ∈ V, ρ-a.e. ζ ∈ Γ
where y(ζ) ∈ V solves the random PDE constraint, F is a convex quantity of interest, and u ∈ U is the control variable.
The authors propose a Combination Technique (CT) to efficiently solve this problem. The CT relies on a hierarchical representation of the optimal control specified by a set of multi-indices (α, β). Each multi-index corresponds to a level of discretization in the spatial variables and the stochastic parameters ζ.
The key aspects of the CT are:
- It solves the OCP on several coarse tensor product grids and with few quadrature points, and then linearly combines the computed solutions.
- Under suitable regularity assumptions, the CT can achieve the same accuracy as the full tensor product discretization, but at a greatly reduced computational cost.
- The CT avoids the issues of sparse grids and multilevel Monte Carlo methods, as it only uses positive quadrature weights, preserving the convexity of the discretized OCP.
- The authors propose an a-priori construction of the multi-index set based on a "profit" metric that balances the spatial and stochastic error contributions.
- A theoretical complexity analysis shows that the asymptotic complexity of the CT depends only on the deterministic PDE solver, as in the MISC method for forward UQ problems.
Numerical experiments validate the effectiveness of the CT approach.