A multi-level ADMM algorithm for elliptic PDE-constrained optimization problems (Q2027683): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3108568571 / rank | |||
Normal rank |
Revision as of 00:05, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A multi-level ADMM algorithm for elliptic PDE-constrained optimization problems |
scientific article |
Statements
A multi-level ADMM algorithm for elliptic PDE-constrained optimization problems (English)
0 references
28 May 2021
0 references
In this paper, a multi-level alternating direction method of multipliers ADMM (mADMM) algorithm is employed for solving optimization problems with PDE constraints applying the `optimize-discretize-optimize' strategy. In this way, the subproblems of the inexact ADMM algorithm are discretized by different discretization schemes. Following the multi-level strategy, the grid is refined gradually and the subproblems are solved inexactly with Krylov-based methods. Overall a fast convergent mADMM algorithm is designed, which significantly reduces the computational cost. The authors show that the iteration complexity is of order \({\mathcal O} (1/k) \), where \(k\) is the number of iterations. Numerical results demonstrate the efficiency of the proposed mADMM algorithm.
0 references
PDE-constrained optimization
0 references
ADMM
0 references
multi-level
0 references
convergence analysis
0 references