Newton-Step-Based Hard Thresholding Algorithms for Sparse Signal Recovery

DOI10.1109/TSP.2020.3037996MaRDI QIDQ5103223zbMATH OpenOpenAlexFDO

Authors Nan Meng, Yun-Bin Zhao

Publication date 23 September 2022

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2001.07181

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(21)

• Dual-density-based reweighted \(\ell_1\)-algorithms for a class of \(\ell_0\)-minimization problems
• Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
• Fast thresholding algorithms with feedbacks for sparse signal recovery
• Newton-type optimal thresholding algorithms for sparse optimization problems
• Sparse Signal Reconstruction from Quantized Noisy Measurements via GEM Hard Thresholding
• Discrete and Continuous-Time Soft-Thresholding for Dynamic Signal Recovery
• Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms
• Accurate and efficient image segmentation and bias correction model based on entropy function and level sets
• Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems
• Scaled proximal gradient methods for sparse optimization 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
• Levenberg-Marquardt hard thresholding pursuit for sparse bilinear inverse problems
• Splitting alternating algorithms for sparse solutions of linear systems with concatenated orthogonal matrices
• Sufficient condition based on nearly optimal order RIC for IHT algorithm
• Heavy-ball enhanced pseudo-inverse-based hard thresholding algorithms for sparse linear inverse problems
• Randomized orthogonal matching pursuit algorithm with adaptive partial selection for sparse signal recovery
• Binary least squares: an algorithm for binary sparse signal recovery
• General decomposition pursuit algorithm for linear inverse problems
• Compressed Newton-direction-based thresholding methods for sparse optimization problems
• Double hard thresholding pursuit: a concise and highly efficient variant of the HTP algorithm for sparse signal recovery

This page was built for publication: Newton-Step-Based Hard Thresholding Algorithms for Sparse Signal Recovery

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