A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem

DOI10.1137/151003714zbMath1325.65086OpenAlexW2203973972MaRDI QIDQ3192668

Laure Blanc-Féraud, Gilles Aubert, Emmanuel Soubies

Publication date: 13 October 2015

Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/151003714

zbMATH Keywords

convergenceinverse problemsleast squares problemglobal minimizerslocal minimizers\(\ell_0\) regularizationsparse modelingunderdetermined linear systemsnonconvex algorithmcontinuous exact \(\ell_0\) penaltynonconvex nonsmooth penaltyminimizer equivalence

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Methods of successive quadratic programming type (90C55)

Related Items

A scaled and adaptive FISTA algorithm for signal-dependent sparse image super-resolution problems, Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity, Global optimization for sparse solution of least squares problems, Erratum: A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem, Approximation Bounds for Sparse Programs, Proximal algorithm for minimization problems in \(l_0\)-regularization for nonlinear inverse problems, Existence and convergence analysis of \(\ell_{0}\) and \(\ell_{2}\) regularizations for limited-angle CT reconstruction, Newton method for \(\ell_0\)-regularized optimization, Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems, Fluorescence image deconvolution microscopy via generative adversarial learning (FluoGAN), On an iteratively reweighted linesearch based algorithm for nonconvex composite optimization, Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm, Smoothing neural network for \(L_0\) regularized optimization problem with general convex constraints, Neural network for a class of sparse optimization with \(L_0\)-regularization, Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem, The geometry of off-the-grid compressed sensing, ADMM-based residual whiteness principle for automatic parameter selection in single image super-resolution problems, A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization, Inducing sparsity via the horseshoe prior in imaging problems, Sparsity-Inducing Nonconvex Nonseparable Regularization for Convex Image Processing, On the determination of Lagrange multipliers for a weighted Lasso problem using geometric and convex analysis techniques, The Capra-subdifferential of the ℓ ₀ pseudonorm, New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem, Non-convex total variation regularization for convex denoising of signals, An unbiased approach to compressed sensing, Unnamed Item, Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing, On convex envelopes and regularization of non-convex functionals without moving global minima, A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem, Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition, An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization, Nonconvex Optimization for 3-Dimensional Point Source Localization Using a Rotating Point Spread Function, Point spread function engineering for 3D imaging of space debris using a continuous exact \(\ell_0\) penalty (CEL0) based algorithm, A convex relaxation framework consisting of a primal-dual alternative algorithm for solving \(\ell_0\) sparsity-induced optimization problems with application to signal recovery based image restoration, Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions

Uses Software

• PDCO

Cites Work

• Unnamed Item
• Nearly unbiased variable selection under minimax concave penalty
• The Adaptive Lasso and Its Oracle Properties
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\)
• Iterative thresholding for sparse approximations
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
• A bilinear formulation for vector sparsity optimization
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Description of the Minimizers of Least Squares Regularized with $\ell_0$-norm. Uniqueness of the Global Minimizer
• Optimization by Stochastic Continuation
• Better Subset Regression Using the Nonnegative Garrote
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Greed is Good: Algorithmic Results for Sparse Approximation
• Greedy approximation
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Atomic Decomposition by Basis Pursuit
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
• A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
• From Bernoulli–Gaussian Deconvolution to Sparse Signal Restoration
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Sparse Approximate Solutions to Linear Systems
• Matching pursuits with time-frequency dictionaries
• On Iteratively Reweighted Algorithms for Nonsmooth Nonconvex Optimization in Computer Vision
• Clarke critical values of subanalytic Lipschitz continuous functions
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Signal Recovery by Proximal Forward-Backward Splitting
• Analysis of the Recovery of Edges in Images and Signals by Minimizing Nonconvex Regularized Least-Squares
• Adaptive greedy approximations