Algorithmic versatility of SPF-regularization methods

DOI10.1142/S0219530520400060MaRDI QIDQ5856262zbMATH OpenFDO

Authors Erin E. Tripp, Lixin Shen, Bruce W. Suter

Publication date 25 March 2021

Published in Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1909.05419

zbMATH Keywords

image denoisingDC programmingproximity algorithmssparsity promoting functions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computing methodologies for image processing (68U10)

Recommendations

• Nonconvex sparse regularization and splitting algorithms
• On the minimization of a Tikhonov functional with a non-convex sparsity constraint
• A nonconvex penalization algorithm with automatic choice of the regularization parameter in sparse imaging
• Bregmanized nonlocal regularization for deconvolution and sparse reconstruction
• Smoothing techniques and difference of convex functions algorithms for image reconstructions

Cites work

• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• scientific article; zbMATH DE number 3192366 (Why is no real title available?)
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• A Statistical View of Some Chemometrics Regression Tools
• A new primal-dual algorithm for minimizing the sum of three functions with a linear operator
• A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
• A unified view of exact continuous penalties for _2-_0 minimization
• Bregman Iterative Algorithms for \ell₁-Minimization with Applications to Compressed Sensing
• Compressed sensing
• Convex analysis and monotone operator theory in Hilbert spaces
• DC approximation approaches for sparse optimization
• DC programming and DCA: thirty years of developments
• Minimization of \(\ell_{1-2}\) for compressed sensing
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Nearly unbiased variable selection under minimax concave penalty
• On the global and linear convergence of the generalized alternating direction method of multipliers
• Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
• Proximity algorithms for image models: denoising
• Proximité et dualité dans un espace hilbertien
• Robust Statistics
• 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
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

Cited in

(6)

• A constructive approach for computing the proximity operator of the \(p\)-th power of the \(\ell_1\) norm
• On choosing initial values of iteratively reweighted \(\ell_1\) algorithms for the piece-wise exponential penalty
• scientific article; zbMATH DE number 5259795 (Why is no real title available?)
• Algorithmic Versatility of SPF-regularization Methods
• Algorithms for structured sparsity promoting functions regularized image restoration model
• A tailor-made 3-dimensional directional Haar semi-tight framelet for pMRI reconstruction

This page was built for publication: Algorithmic versatility of SPF-regularization methods

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