From theoretical guarantee to practical performance: selectable and optimal step-lengths for IHT and HTP algorithms in compressed sensing

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Inverse problems in linear algebra (15A29) Iterative numerical methods for linear systems (65F10) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)

Cites Work

A mathematical introduction to compressive sensing
Iterative hard thresholding methods for $l_0$ regularized convex cone programming
Computing sparse representation in a highly coherent dictionary based on difference of $L_1$ and $L_2$
Iterative hard thresholding for compressed sensing
Iterative thresholding for sparse approximations
Hard thresholding pursuit algorithms: number of iterations
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
Iterative hard thresholding for compressed data separation
Accelerated iterative hard thresholding algorithm for $l_0$ regularized regression problem
Sparse signal recovery from phaseless measurements via hard thresholding pursuit
The finite steps of convergence of the fast thresholding algorithms with $f$-feedbacks in compressed sensing
Newton-type optimal thresholding algorithms for sparse optimization problems
Normalized Iterative Hard Thresholding for Matrix Completion
A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications
Sparse Recovery Algorithms: Sufficient Conditions in Terms of Restricted Isometry Constants
Sparse Approximation using $\ell_1-\ell_2$ Minimization and Its Application to Stochastic Collocation
Multipath Matching Pursuit
Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
The Performance of Orthogonal Multi-Matching Pursuit under the Restricted Isometry Property
Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
Restricted isometry properties and nonconvex compressive sensing
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
Decoding by Linear Programming
Why Simple Shrinkage Is Still Relevant for Redundant Representations?
Ideal spatial adaptation by wavelet shrinkage
A Tight Bound of Hard Thresholding
Stagewise Weak Gradient Pursuits
An iterative hard thresholding estimator for low rank matrix recovery with explicit limiting distribution
Generalized Orthogonal Matching Pursuit
Tree-Based Pursuit: Algorithm and Properties
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
De-noising by soft-thresholding
Subspace Pursuit for Compressive Sensing Signal Reconstruction
Newton-Step-Based Hard Thresholding Algorithms for Sparse Signal Recovery
Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
Low-Rank Tensor Recovery using Sequentially Optimal Modal Projections in Iterative Hard Thresholding (SeMPIHT)
An Iteration Formula for Fredholm Integral Equations of the First Kind
Compressed sensing
Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms

This page was built for publication: From theoretical guarantee to practical performance: selectable and optimal step-lengths for IHT and HTP algorithms in compressed sensing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636480)