We prove that the distance between the minimizer of the -anisotropic Rudin-Osher-Fatemi (ROF) functional and its minimizer over the space of piecewise constant functions on a rectilinear grid is , where is the grid’s mesh size and the datum belongs to , . These convergence rates are valid in any dimension . However, in dimension they can be further improved to . To establish the error bounds, 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.

生成讲解博客的中文版本

生成AI智能校验的中文版本