Algorithms for structured sparsity promoting functions regularized image restoration model

DOI10.1007/S43670-025-00102-7MaRDI QIDQ6893054zbMATH OpenFDO

Authors Ashley Prater-Bennette, Lixin Shen, Erin E. Tripp, Jianchen Wei

Publication date 27 November 2025

Published in Sampling Theory, Signal Processing, and Data Analysis (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S43670-025-00102-7

zbMATH Keywords

difference of convex algorithmsimage restorationproximity operatorsparsity promoting function

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical optimization and variational techniques (65K10) Convex programming (90C25)

Cites work

• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A general double-proximal gradient algorithm for d.c. programming
• A majorize-minimize subspace approach for _2-_0 image regularization
• A nonconvex model with minimax concave penalty for image restoration
• A proximal difference-of-convex algorithm with extrapolation
• A Statistical View of Some Chemometrics Regression Tools
• A unified view of exact continuous penalties for _2-_0 minimization
• Acceleration of primal-dual methods by preconditioning and simple subproblem procedures
• Adaptive Inpainting Algorithm Based on DCT Induced Wavelet Regularization
• Algorithmic versatility of SPF-regularization methods
• Aspects of Total Variation RegularizedL¹Function Approximation
• DC approximation approaches for sparse optimization
• DC programming and DCA: thirty years of developments
• First-order methods in optimization
• Global convergence of a proximal linearized algorithm for difference of convex functions
• Global convergence of splitting methods for nonconvex composite optimization
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• scientific article; zbMATH DE number 5065880 (Why is no real title available?)
• iPiano: inertial proximal algorithm for nonconvex optimization
• Mathematical models for local nontexture inpaintings
• Minimization of \(\ell_{1-2}\) for compressed sensing
• Multi-step fixed-point proximity algorithms for solving a class of optimization problems arising from image processing
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Nearly unbiased variable selection under minimax concave penalty
• Numerical algorithms for polyenergetic digital breast tomosynthesis reconstruction
• Preconditioned alternating projection algorithms for maximum \textit{a posteriori} ECT reconstruction
• Proximité et dualité dans un espace hilbertien
• Proximity algorithms for image models: denoising
• Structured sparsity promoting functions
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings
• Total generalized variation
• Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Wavelet Algorithms for High-Resolution Image Reconstruction

This page was built for publication: Algorithms for structured sparsity promoting functions regularized image restoration model

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