New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem
From MaRDI portal
Publication:2203360
DOI10.1007/s10851-019-00917-9zbMath1486.90158OpenAlexW2947182250MaRDI QIDQ2203360
Laure Blanc-Féraud, Gilles Aubert, Emmanuel Soubies
Publication date: 6 October 2020
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10851-019-00917-9
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Minimizers of sparsity regularized Huber loss function, A Path-Based Approach to Constrained Sparse Optimization
Uses Software
Cites Work
- Nearly unbiased variable selection under minimax concave penalty
- The Adaptive Lasso and Its Oracle Properties
- Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity
- Solve exactly an under determined linear system by minimizing least squares regularized with an \(\ell_0\) penalty
- Iterative hard thresholding for compressed sensing
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- 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
- On convex envelopes and regularization of non-convex functionals without moving global minima
- Sparse learning via Boolean relaxations
- Stability of the minimizers of least squares with a non-convex regularization. II: Global behavior
- Stability of the minimizers of least squares with a non-convex regularization. I: Local behavior
- On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms
- Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
- A Majorize-Minimize Subspace Approach for $\ell_2-\ell_0$ Image Regularization
- Description of the Minimizers of Least Squares Regularized with $\ell_0$-norm. Uniqueness of the Global Minimizer
- On optimal solutions of the constrained ℓ 0 regularization and its penalty problem
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- Better Subset Regression Using the Nonnegative Garrote
- A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Greed is Good: Algorithmic Results for Sparse Approximation
- Just relax: convex programming methods for identifying sparse signals in noise
- Greedy approximation
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- From Bernoulli–Gaussian Deconvolution to Sparse Signal Restoration
- Homotopy Based Algorithms for $\ell _{\scriptscriptstyle 0}$-Regularized Least-Squares
- Proximal Mapping for Symmetric Penalty and Sparsity
- Exact Sparse Approximation Problems via Mixed-Integer Programming: Formulations and Computational Performance
- Sparse Signal Approximation via Nonseparable Regularization
- Sparse Regularization via Convex Analysis
- Matching pursuits with time-frequency dictionaries
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- On Iteratively Reweighted Algorithms for Nonsmooth Nonconvex Optimization in Computer Vision
- A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization
- Analysis of Half-Quadratic Minimization Methods for Signal and Image Recovery
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Analysis of the Recovery of Edges in Images and Signals by Minimizing Nonconvex Regularized Least-Squares
