An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization
From MaRDI portal
Publication:2307750
DOI10.1007/s10898-019-00830-wzbMath1451.90097OpenAlexW2972551237MaRDI QIDQ2307750
Zixin Chen, Wanyou Cheng, Qing-Jie Hu
Publication date: 25 March 2020
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-019-00830-w
active set identificationclassification of stationary points\(l_0\)-regularized optimization problems
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Complexity and performance of numerical algorithms (65Y20)
Related Items
Uses Software
Cites Work
- Nearly unbiased variable selection under minimax concave penalty
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Iterative thresholding for sparse approximations
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- A coordinate gradient descent method for nonsmooth separable 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\)
- Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- A Fast Active Set Block Coordinate Descent Algorithm for $\ell_1$-Regularized Least Squares
- Exact Penalty Decomposition Method for Zero-Norm Minimization Based on MPEC Formulation
- Activity Identification and Local Linear Convergence of Forward--Backward-type Methods
- A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
- Better Subset Regression Using the Nonnegative Garrote
- A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- A Preconditioner for A Primal-Dual Newton Conjugate Gradient Method for Compressed Sensing Problems
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Greedy approximation
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Two-Point Step Size Gradient Methods
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Sparse Reconstruction by Separable Approximation
- From Bernoulli–Gaussian Deconvolution to Sparse Signal Restoration
- Gradient-based method with active set strategy for $\ell _1$ optimization
- Proximal Mapping for Symmetric Penalty and Sparsity
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- A Nonmonotone Line Search Technique for Newton’s Method
- Sparse Approximate Solutions to Linear Systems
- Matching pursuits with time-frequency dictionaries
- A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions
- A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization
- Sparse Approximation via Penalty Decomposition Methods
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Benchmarking optimization software with performance profiles.
- Adaptive greedy approximations
