Sparse Approximate Solutions to Linear Systems
SIAM Journal on Computing
Atomic Decomposition by Basis Pursuit
SIAM Journal on Scientific Computing
Convergence of the simulated annealing algorithm for continuous global optimization
Journal of Optimization Theory and Applications
Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
SIAM Journal on Scientific Computing
Sparse reconstruction by separable approximation
IEEE Transactions on Signal Processing
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
SIAM Journal on Imaging Sciences
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
SIAM Journal on Imaging Sciences
Matching pursuits with time-frequency dictionaries
IEEE Transactions on Signal Processing
Greed is good: algorithmic results for sparse approximation
IEEE Transactions on Information Theory
On the exponential convergence of matching pursuits in quasi-incoherent dictionaries
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
IEEE Transactions on Information Theory
Hi-index | 0.08 |
In this paper we present a new hybrid simulated annealing thresholding (HSAT) algorithm which preserves the computational simplicity of thresholding algorithm but with the global convergence. We verify the convergence of the new hybrid simulated annealing thresholding algorithm and provide a series of experiments and applications to assess performance of the algorithm. The experiments and applications show that the proposed hybrid algorithm is global convergence and can be accepted as a solver for signal and image reconstruction problems.