Dynamic thresholding algorithm with memory for linear inverse problems
DOI10.1088/1361-6420/ad9d73MaRDI QIDQ6659673
Yun-bin Zhao, Zheng-Hai Huang, Zhongfeng Sun, Jin Chuan Zhou
Publication date: 9 January 2025
Published in: Inverse Problems (Search for Journal in Brave)
image denoisingsignal reconstructionlinear inverse problemsrestricted isometry propertythresholding algorithm
Convex programming (90C25) Nonlinear programming (90C30) Linear programming (90C05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Iterative numerical methods for linear systems (65F10)
Cites Work
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A mathematical introduction to compressive sensing
- Iterative thresholding for sparse approximations
- Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
- Matrix recipes for hard thresholding methods
- Newton-type optimal thresholding algorithms for sparse optimization problems
- An Improved RIP-Based Performance Guarantee for Sparse Signal Recovery via Orthogonal Matching Pursuit
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations
- Decoding by Linear Programming
- Why Simple Shrinkage Is Still Relevant for Redundant Representations?
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse and Redundant Representations
- Generalized Orthogonal Matching Pursuit
- Cost-Aware Activity Scheduling for Compressive Sleeping Wireless Sensor Networks
- AMP-Inspired Deep Networks for Sparse Linear Inverse Problems
- 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
- Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Constructing Generalized Mean Functions Using Convex Functions with Regularity Conditions
- Inequalities.
- Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing
- Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems
- Heavy-ball-based hard thresholding algorithms for sparse signal recovery
This page was built for publication: Dynamic thresholding algorithm with memory for linear inverse problems