A nonconvex penalization algorithm with automatic choice of the regularization parameter in sparse imaging

DOI10.1088/1361-6420/AB1C6BzbMATH Open1428.94027OpenAlexW2941047389WikidataQ127984220 ScholiaQ127984220MaRDI QIDQ5228006FDOQ5228006

Authors: D. Lazzaro, E. Loli Piccolomini, F. Zama 

Publication date: 8 August 2019

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11585/698194

Recommendations

• Well-posedness and convergence rates for sparse regularization with sublinear \(l^q\) penalty term
• On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty
• A new iterative firm-thresholding algorithm for inverse problems with sparsity constraints
• Computational approaches to non-convex, sparsity-inducing multi-penalty regularization
• Iterative regularization with a general penalty term-theory and application to \(L^{1}\) and \(TV\) regularization

zbMATH Keywords

nonconvex minimizationnonconvex regularizationiterative reweightingsparse imagingautomatic selection of regularization parameter

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computing methodologies for image processing (68U10)

Cites Work

• A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• The Split Bregman Method for L1-Regularized Problems
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Compressed sensing
• Signal Recovery by Proximal Forward-Backward Splitting
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Optimal approximations by piecewise smooth functions and associated variational problems
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Online learning and online convex optimization
• Accelerating the Nonuniform Fast Fourier Transform
• On iteratively reweighted algorithms for nonsmooth nonconvex optimization in computer vision
• Decoupled algorithm for MRI reconstruction using nonlocal block matching model: BM3D-MRI
• An Iterative $L_{1}$-Based Image Restoration Algorithm With an Adaptive Parameter Estimation

Cited In (11)

• A projected gradient method for nonlinear inverse problems with \(\alpha \ell_1 - \beta \ell_2\) sparsity regularization
• A scaled and adaptive FISTA algorithm for signal-dependent sparse image super-resolution problems
• Computational approaches to non-convex, sparsity-inducing multi-penalty regularization
• Algorithmic versatility of SPF-regularization methods
• Nonconvex sparse regularization and splitting algorithms
• 2DNMR data inversion using locally adapted multi-penalty regularization
• A projected gradient method for \(\alpha\ell_1-\beta\ell_2\) sparsity regularization
• A majorize-minimize subspace approach for \(\ell_2-\ell_0\) image regularization
• Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods
• Adaptive multi-penalty regularization based on a generalized Lasso path
• Morozov's discrepancy principle for \(\alpha\ell_1-\beta\ell_2\) sparsity regularization

This page was built for publication: A nonconvex penalization algorithm with automatic choice of the regularization parameter in sparse imaging

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