Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems
From MaRDI portal
Publication:6134435
phase transitionimage processingrestricted isometry propertyheavy-ball methodoptimal \(k\)-thresholdingsparse linear inverse problems
Quadratic programming (90C20) Convex programming (90C25) 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)
Abstract: Linear inverse problems arise in diverse engineering fields especially in signal and image reconstruction. The development of computational methods for linear inverse problems with sparsity tool is one of the recent trends in this area. The so-called optimal -thresholding is a newly introduced method for sparse optimization and linear inverse problems. Compared to other sparsity-aware algorithms, the advantage of optimal -thresholding method lies in that it performs thresholding and error metric reduction simultaneously and thus works stably and robustly for solving medium-sized linear inverse problems. However, the runtime of this method remains high when the problem size is relatively large. The purpose of this paper is to propose an acceleration strategy for this method. Specifically, we propose a heavy-ball-based optimal -thresholding (HBOT) algorithm and its relaxed variants for sparse linear inverse problems. The convergence of these algorithms is shown under the restricted isometry property. In addition, the numerical performance of the heavy-ball-based relaxed optimal -thresholding pursuit (HBROTP) has been studied, and simulations indicate that HBROTP admits robust capability for signal and image reconstruction even in noisy environments.
Recommendations
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Newton-type optimal thresholding algorithms for sparse optimization problems
- Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
- Heavy-ball-based hard thresholding algorithms for sparse signal recovery
- A new iterative firm-thresholding algorithm for inverse problems with sparsity constraints
Cites work
- scientific article; zbMATH DE number 1489799 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (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 iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Analysis and design of optimization algorithms via integral quadratic constraints
- Analysis and generalizations of the linearized Bregman method
- Atomic Decomposition by Basis Pursuit
- Back-Projection Based Fidelity Term for Ill-Posed Linear Inverse Problems
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets
- Convergence rates of the heavy-ball method under the Łojasiewicz property
- De-noising by soft-thresholding
- Decoding by Linear Programming
- Differentially Private Accelerated Optimization Algorithms
- Distributed Heavy-Ball: A Generalization and Acceleration of First-Order Methods With Gradient Tracking
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Hard thresholding pursuit: an algorithm for compressive sensing
- Heavy-ball-based hard thresholding algorithms for sparse signal recovery
- Ideal spatial adaptation by wavelet shrinkage
- Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms
- Iterative thresholding for sparse approximations
- Krylov subspace split Bregman methods
- Linearized Krylov subspace Bregman iteration with nonnegativity constraint
- 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
- On the Convergence Rate of Incremental Aggregated Gradient Algorithms
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
- Performance comparisons of greedy algorithms in compressed sensing.
- Quadratic Combinatorial Optimization Using Separable Underestimators
- Regularization preconditioners for frame-based image deblurring with reduced boundary artifacts
- Robustness of Accelerated First-Order Algorithms for Strongly Convex Optimization Problems
- Sharp Time–Data Tradeoffs for Linear Inverse Problems
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Some methods of speeding up the convergence of iteration methods
- Sparse Bayesian Learning for Basis Selection
- 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
(5)- Newton-type optimal thresholding algorithms for sparse optimization problems
- An iterative thresholding-like algorithm for inverse problems with sparsity constraints in Banach space
- Heavy-ball-based hard thresholding algorithms for sparse signal recovery
- A new iterative firm-thresholding algorithm for inverse problems with sparsity constraints
- Dynamic thresholding algorithm with memory for linear inverse problems
This page was built for publication: Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134435)
