Indexed metadata

On the ROF Model in Rectilinear Anisotropy: Piecewise Constant Approximation and Universal Minimality

Clemens Kirisits, Eric Setterqvist

Source record

Source: Crossref

Published: Aug 4, 2026

DOI: 10.1007/s00245-026-10483-3

Open original source ↗

Source abstract

Abstract We prove that the L2L^2 L 2 distance between the minimizer of the ℓ1\ell ^1 ℓ 1 -anisotropic Rudin-Osher-Fatemi (ROF) functional and its minimizer over the space of piecewise constant functions on a rectilinear grid is O(h1/2−q′/2q)\mathcal {O}(h^{{1}/{2} - {q'}/{2q}}) O ( h 1 / 2 - q ′ / 2 q ) , where h is the grid’s mesh size and the datum belongs to LqL^q L q , q≥2q \ge 2 q ≥ 2 . These convergence rates are valid in any dimension d≥1d\ge 1 d ≥ 1 . However, in dimension d=1d = 1 d = 1 they can be further improved to O(h1/2−1/2q)\mathcal {O}(h^{{1}/{2} - {1}/{2q}}) O ( h 1 / 2 - 1 / 2 q ) . To establish the error bounds, LqL^q L q estimates of the ROF minimizer in terms of the datum are critical. Such estimates are particular cases of a universal minimality property of the ROF minimizer derived in the second part of the paper. There it is shown, in both the finite-dimensional and infinite-dimensional settings, that the minimizer simultaneously minimizes a broad class of convex functionals over a neighbourhood of the datum arising in the convex dual of the ROF problem. This extends previous results of similar type about taut strings and the ROF problem.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.