Convergence analysis in convex regularization depending on the smoothness degree of the penalizer
Erdem Altuntac

TL;DR
This paper investigates the convergence of solutions in convex regularization problems, analyzing how the smoothness degree of the penalizer affects convergence rates and stability.
Contribution
It provides a convergence analysis for regularized solutions depending on whether the regularizer is once or twice continuously differentiable, incorporating the Hessian Lipschitz constant for the second case.
Findings
Convergence depends on the smoothness degree of the regularizer.
For twice differentiable regularizers, the discrepancy can be estimated using the Hessian Lipschitz constant.
Regularization parameters are chosen to satisfy a discrepancy principle.
Abstract
The problem of minimization of the least squares functional with a smooth, lower semi-continuous, convex regularizer is considered to be solved. Over some compact and convex subset of the Hilbert space the regularizer is implicitly defined as where So the cost functional associated with some given linear, compact and injective forward operator \begin{align} F_{\alpha}(\cdot , f^{\delta}) := \frac{1}{2} \Vert \mathcal{T}( \cdot ) - f^{\delta}\Vert_{\mathcal{H}}^2 + \alpha J(\cdot) , \nonumber \end{align} where is the given perturbed data with its perturbation amount in it. Convergence of the regularized optimum solution $\varphi_{\alpha(\delta)} \in \mbox{argmin}…
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.
Taxonomy
TopicsNumerical methods in inverse problems · Sparse and Compressive Sensing Techniques · Advanced Mathematical Modeling in Engineering
