NANAOCJan 11, 2019

Adaptive finite element methods for sparse PDE-constrained optimization

arXiv:1712.0044815 citationsh-index: 11
Originality Synthesis-oriented
AI Analysis

Provides adaptive finite element methods for optimal control problems with sparsity, enabling efficient mesh refinement for practitioners in computational PDE-constrained optimization.

This paper develops reliable and efficient a posteriori error estimators for sparse PDE-constrained optimization problems with nondifferentiable cost functionals and control constraints, achieving optimal convergence rates in numerical examples.

We propose and analyze reliable and efficient a posteriori error estimators for an optimal control problem that involves a nondifferentiable cost functional, the Poisson problem as state equation and control constraints. To approximate the solution to the state and adjoint equations we consider a piecewise linear finite element method whereas three different strategies are used to approximate the control variable: piecewise constant discretization, piecewise linear discretization and the so-called variational discretization approach. For the first two aforementioned solution techniques we devise an error estimator that can be decomposed as the sum of four contributions: two contributions that account for the discretization of the control variable and the associated subgradient, and two contributions related to the discretization of the state and adjoint equations. The error estimator for the variational discretization approach is decomposed only in two contributions that are related to the discretization of the state and adjoint equations. On the basis of the devised a posteriori error estimators, we design simple adaptive strategies that yield optimal rates of convergence for the numerical examples that we perform.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes