Dynamic thresholding algorithm with memory for linear inverse problems
From MaRDI portal
image denoisinglinear inverse problemsrestricted isometry propertysignal reconstructionthresholding algorithm
Convex programming (90C25) Linear programming (90C05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Nonlinear programming (90C30) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Iterative numerical methods for linear systems (65F10)
Recommendations
- Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems
- Matrix recipes for hard thresholding methods
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Eigenvalue-free iterative shrinkage-thresholding algorithm for solving the linear inverse problems
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Cites work
- scientific article; zbMATH DE number 1489799 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A mathematical introduction to compressive sensing
- AMP-Inspired Deep Networks for Sparse Linear Inverse Problems
- An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations
- An Improved RIP-Based Performance Guarantee for Sparse Signal Recovery via Orthogonal Matching Pursuit
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
- Bregman Iterative Algorithms for \ell₁-Minimization with Applications to Compressed Sensing
- Constructing Generalized Mean Functions Using Convex Functions with Regularity Conditions
- Cost-Aware Activity Scheduling for Compressive Sleeping Wireless Sensor Networks
- De-noising by soft-thresholding
- Decoding by Linear Programming
- Generalized Orthogonal Matching Pursuit
- Hard thresholding pursuit: an algorithm for compressive sensing
- Heavy-ball-based hard thresholding algorithms for sparse signal recovery
- Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems
- Inequalities.
- Iterative thresholding for sparse approximations
- Matrix recipes for hard thresholding methods
- Newton-Step-Based Hard Thresholding Algorithms for Sparse Signal Recovery
- Newton-type optimal thresholding algorithms for sparse optimization problems
- Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Why Simple Shrinkage Is Still Relevant for Redundant Representations?
Cited in
(2)
This page was built for publication: Dynamic thresholding algorithm with memory for linear inverse problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659673)
