.png){kind=icon}
.png){kind=icon}
Return
A TRUST-REGION ALGORITHM WITH ADAPTIVE STOCHASTIC COLLOCATION FOR PDE OPTIMIZATION UNDER UNCERTAINTY
.png){kind=icon}
OA
AI
DOI：10.1137/120892362.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The numerical solution of optimization problems governed by partial differential equations (PDEs) with random coefficients is computationally challenging because of the large number of deterministic PDE solves required at each optimization iteration. This paper introduces an efficient algorithm for solving such problems based on a combination of adaptive sparse-grid collocation for the discretization of the PDE in the stochastic space and a trust-region framework for optimization and fidelity management of the stochastic discretization. The overall algorithm adapts the collocation points based on the progress of the optimization algorithm and the impact of the random variables on the solution of the optimization problem. It frequently uses few collocation points initially and increases the number of collocation points only as necessary, thereby keeping the number of deterministic PDE solves low while guaranteeing convergence. Currently an error indicator is used to estimate gradient errors due to adaptive stochastic collocation. The algorithm is applied to three examples, and the numerical results demonstrate a significant reduction in the total number of PDE solves required to obtain an optimal solution when compared with a Newton conjugate gradient algorithm applied to a fixed high-fidelity discretization of the optimization problem.
Keywords:
PDE optimization
uncertainty
stochastic collocation
trust regions
sparse grids
adaptivity
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W
Organization
View more organizations