Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems
DOI10.1007/s10915-023-02315-1zbMath1519.94010arXiv2305.03247OpenAlexW4385768695MaRDI QIDQ6134435
Jin Chuan Zhou, Zhongfeng Sun, Yun-bin Zhao
Publication date: 22 August 2023
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2305.03247
image processingphase transitionrestricted isometry propertyheavy-ball methodoptimal \(k\)-thresholdingsparse linear inverse problems
Convex programming (90C25) Quadratic programming (90C20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Inverse problems in linear algebra (15A29) Numerical methods of relaxation type (49M20)
Cites Work
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A mathematical introduction to compressive sensing
- Iterative thresholding for sparse approximations
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Linearized Krylov subspace Bregman iteration with nonnegativity constraint
- Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
- Krylov subspace split Bregman methods
- Matrix recipes for hard thresholding methods
- Newton-type optimal thresholding algorithms for sparse optimization problems
- Convergence rates of the heavy-ball method under the Łojasiewicz property
- Regularization Preconditioners for Frame-Based Image Deblurring with Reduced Boundary Artifacts
- Performance comparisons of greedy algorithms in compressed sensing
- Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets
- Analysis and Generalizations of the Linearized Bregman Method
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints
- 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
- Atomic Decomposition by Basis Pursuit
- Ideal spatial adaptation by wavelet shrinkage
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- 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
- Robustness of Accelerated First-Order Algorithms for Strongly Convex Optimization Problems
- Differentially Private Accelerated Optimization Algorithms
- Newton-Step-Based Hard Thresholding Algorithms for Sparse Signal Recovery
- Back-Projection Based Fidelity Term for Ill-Posed Linear Inverse Problems
- Distributed Heavy-Ball: A Generalization and Acceleration of First-Order Methods With Gradient Tracking
- Quadratic Combinatorial Optimization Using Separable Underestimators
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- On the Convergence Rate of Incremental Aggregated Gradient Algorithms
- Sparse Bayesian Learning for Basis Selection
- Sharp Time–Data Tradeoffs for Linear Inverse Problems
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Some methods of speeding up the convergence of iteration methods
- Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms
- Heavy-ball-based hard thresholding algorithms for sparse signal recovery
This page was built for publication: Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems
