Multilevel Preconditioning Strategies for Convex Optimization Methods in Image Deblurring

DOI10.48550/arXiv.2607.10864MaRDI QIDQ7284030arXivFDO

Authors Stefano Aleotti, Marco Donatelli, Rolf Krause, Claudia Binda

Publication date 12 July 2026

Published in arXiv

Tldr We develop a multilevel preconditioning strategy to accelerate proximal gradient methods for image deblurring, achieving faster convergence than state-of-the-art methods with improved robustness and consistency.

Full work available at URL https://doi.org/10.48550/arXiv.2607.10864

arXiv classification

math.NA

Cites work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A first-order primal-dual algorithm with linesearch
• A framelet-based image inpainting algorithm
• A multigrid for image deblurring with Tikhonov regularization
• A multigrid frame based method for image deblurring
• A multilevel algorithm for simultaneously denoising and deblurring images
• A Preconditioned Version of a Nested Primal-Dual Algorithm for Image Deblurring
• A variable metric forward-backward method with extrapolation
• Accelerated and inexact forward-backward algorithms
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization
• Convex Analysis
• Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
• Inertial variable metric techniques for the inexact forward-backward algorithm
• Inexact successive quadratic approximation for regularized optimization
• IR tools: a MATLAB package of iterative regularization methods and large-scale test problems
• Nonlinear total variation based noise removal algorithms
• Nonstationary iterated thresholding algorithms for image deblurring
• On starting and stopping criteria for nested primal-dual iterations
• On the Regularizing Power of Multigrid-type Algorithms
• Proximal algorithms in statistics and machine learning
• Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates
• Proximité et dualité dans un espace hilbertien
• Regularization of Inverse Problems
• Signal Recovery by Proximal Forward-Backward Splitting
• Stability of over-relaxations for the forward-backward algorithm, application to FISTA
• Structured sparsity through convex optimization

This page was built for publication: Multilevel Preconditioning Strategies for Convex Optimization Methods in Image Deblurring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7284030)