Primal-dual gap estimators for a posteriori error analysis of nonsmooth minimization problems
This work offers a theoretically grounded error estimation framework for nonsmooth minimization problems, benefiting researchers in numerical analysis and computational optimization.
The paper introduces primal-dual gap estimators for a posteriori error analysis of nonsmooth minimization problems, providing a reliable upper bound for the energy error and error in the energy norm. Numerical experiments on nonlinear Laplace and Rudin-Osher-Fatemi problems demonstrate accurate local mesh refinement and moderate overestimation of the error.
The primal-dual gap is a natural upper bound for the energy error and, for uniformly convex minimization problems, also for the error in the energy norm. This feature can be used to construct reliable primal-dual gap error estimators for which the constant in the reliability estimate equals one for the energy error and equals the uniform convexity constant for the error in the energy norm. In particular, it defines a reliable upper bound for any functions that are feasible for the primal and the associated dual problem. The abstract a posteriori error estimate based on the primal-dual gap is provided in this article, and the abstract theory is applied to the nonlinear Laplace problem and the Rudin-Osher-Fatemi image denoising problem. The discretization of the primal and dual problems with conforming, low-order finite element spaces is addressed. The primal-dual gap error estimator is used to define an adaptive finite element scheme and numerical experiments are presented, which illustrate the accurate, local mesh refinement in a neighborhood of the singularities, the reliability of the primal-dual gap error estimator and the moderate overestimation of the error.