Explicit and efficient error estimation for convex minimization problems

04/22/2022
by   Sören Bartels, et al.
0

We combine a systematic approach for deriving general a posteriori error estimates for convex minimization problems based on convex duality relations with a recently derived generalized Marini formula. The a posteriori error estimates are essentially constant-free and apply to a large class of variational problems including the p-Dirichlet problem, as well as degenerate minimization, obstacle and image de-noising problems. In addition, these a posteriori error estimates are based on a comparison to a given non-conforming finite element solution. For the p-Dirichlet problem, these a posteriori error bounds are equivalent to residual type a posteriori error bounds and, hence, reliable and efficient.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/08/2023

Explicit a posteriori error representation for variational problems and application to TV-minimization

In this paper, we propose a general approach for explicit a posteriori e...
research
03/27/2019

Posteriori Probabilistic Bounds of Convex Scenario Programs with Validation Tests

Scenario programs have established themselves as efficient tools towards...
research
02/06/2020

Nonconforming discretizations of convex minimization problems and precise relations to mixed methods

This article discusses nonconforming finite element methods for convex m...
research
10/14/2020

Nodal auxiliary a posteriori error estimates

We introduce and explain key relations between a posteriori error estima...
research
11/09/2020

A posteriori verification of the positivity of solutions to elliptic problems

The purpose of this paper is to develop a unified a posteriori method fo...
research
08/17/2021

A simple equilibration procedure leading to polynomial-degree-robust a posteriori error estimators for the curl-curl problem

We introduce two a posteriori error estimators for Nédélec finite elemen...
research
04/20/2020

Error estimates for a class of discontinuous Galerkin methods for nonsmooth problems via convex duality relations

We devise and analyze a class of interior penalty discontinuous Galerkin...

Please sign up or login with your details

Forgot password? Click here to reset