New nonsmooth equations-based algorithms for \(\ell_1\)-norm minimization and applications
From MaRDI portal
Publication:1952757
DOI10.1155/2012/139609zbMath1268.65084OpenAlexW2049954874WikidataQ58905746 ScholiaQ58905746MaRDI QIDQ1952757
Publication date: 3 June 2013
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/139609
algorithmnumerical resultsconvex optimizationnonsmooth equations\(\ell_1\)-norm minimization problem
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
- Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing
- Extensions of compressed sensing
- A nonsmooth version of Newton's method
- Computation of error bounds for P-matrix linear complementarity problems
- Spectral gradient projection method for solving nonlinear monotone equations
- A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
- A globally convergent BFGS method for nonlinear monotone equations without any merit functions
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- A class of derivative-free methods for large-scale nonlinear monotone equations
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Optimization and nonsmooth analysis
- Two-Point Step Size Gradient Methods
- Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage
- Sparse Reconstruction by Separable Approximation
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Stable signal recovery from incomplete and inaccurate measurements
- A modified BFGS method and its global convergence in nonconvex minimization
This page was built for publication: New nonsmooth equations-based algorithms for \(\ell_1\)-norm minimization and applications
