Newton-type optimal thresholding algorithms for sparse optimization problems
From MaRDI portal
Publication:2676159
Recommendations
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
- Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems
- Fast thresholding algorithms with feedbacks for sparse signal recovery
- A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
Cites work
- A mathematical introduction to compressive sensing
- A new computational method for the sparsest solutions to systems of linear equations
- Atomic decomposition by basis pursuit
- Compressed sensing and its applications. Selected papers of the third international MATHEON conference, TU Berlin, Berlin, Germany, December 4--8, 2017
- Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- De-noising by soft-thresholding
- Decoding by Linear Programming
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Global and quadratic convergence of Newton hard-thresholding pursuit
- Hard thresholding pursuit algorithms: number of iterations
- Hard thresholding pursuit: an algorithm for compressive sensing
- Iterative hard thresholding for compressed sensing
- Iterative thresholding algorithms
- Iterative thresholding for sparse approximations
- Newton method for \(\ell_0\)-regularized optimization
- Newton-Step-Based Hard Thresholding Algorithms for Sparse Signal Recovery
- Normalized iterative hard thresholding for matrix completion
- On the number of iterations for convergence of CoSaMP and subspace pursuit algorithms
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Reweighted _1-minimization for sparse solutions to underdetermined linear systems
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparse optimization theory and methods
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
Cited in
(7)- Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
- Weighted thresholding homotopy method for sparsity constrained optimization
- A robust reconstruction algorithm for sparse signals
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems
- From theoretical guarantee to practical performance: selectable and optimal step-lengths for IHT and HTP algorithms in compressed sensing
- Dynamic thresholding algorithm with memory for linear inverse problems
This page was built for publication: Newton-type optimal thresholding algorithms for sparse optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2676159)
