A tight bound of modified iterative hard thresholding algorithm for compressed sensing.

DOI10.21136/am.2023.0221-22OpenAlexW4328122708MaRDI QIDQ6177911

Jiao-Jiao Jiang, Shanshan Yang, Hai-Bin Zhang, Jinyao Ma

Publication date: 18 January 2024

Published in: Applications of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.21136/am.2023.0221-22

zbMATH Keywords

classification problemsignal reconstructioniterative hard thresholdingleast squares support vector machine

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Periodic solutions to ordinary differential equations (34C25) Singular nonlinear boundary value problems for ordinary differential equations (34B16)

Cites Work

• Unnamed Item
• A mathematical introduction to compressive sensing
• Iterative hard thresholding for compressed sensing
• Iterative thresholding for sparse approximations
• A note on guaranteed sparse recovery via \(\ell_1\)-minimization
• A short note on compressed sensing with partially known signal support
• Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
• Atomic Decomposition by Basis Pursuit
• Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
• Decoding by Linear Programming
• A Tight Bound of Hard Thresholding
• Modified-CS: Modifying Compressive Sensing for Problems With Partially Known Support
• Between hard and soft thresholding: optimal iterative thresholding algorithms
• Fast Thresholding Algorithms with Feedbacks and Partially Known Support for Compressed Sensing
• Model-Based Compressive Sensing

This page was built for publication: A tight bound of modified iterative hard thresholding algorithm for compressed sensing.