A $\operatorname{prox}$-Based Semi-Smooth Newton Method for TV-Minimization
S\"oren Bartels, Alex Kaltenbach

TL;DR
This paper introduces a novel semi-smooth Newton method based on proximal operators for TV-minimization, demonstrating global well-posedness, local super-linear convergence, and robust practical performance in numerical experiments.
Contribution
It develops a new proximal-based semi-smooth Newton approach for TV-minimization, extending to convex problems and showing superior convergence and robustness.
Findings
Proven global well-posedness and local super-linear convergence in finite element discretization.
Numerical experiments show reliable primal-dual gap reduction to machine precision.
Method exhibits robustness to proximity parameters and effective on graded meshes.
Abstract
In this paper, we devise a -based semi-smooth Newton method for the non-differentiable TV-minimization problem. To this end, the primal-dual optimality conditions are reformulated as a nonlinear operator equation with Newton-(type-)differentiable structure. We investigate the question of well-posedness of the resulting semi-smooth Newton scheme in the infinite-dimensional setting and identify structural properties of the associated Newton-type derivatives. For a conforming finite element discretization, we prove that the resulting semi-smooth Newton method is globally well-posed and locally super-linearly convergent. The approach extends to a large class of convex minimization problems, coincides with established semi-smooth Newton methods for obstacle problems, satisfies a primal-dual invariance, and, under suitable additional assumptions, is well-posed in the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
