66 citations · 67 across the 9 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.IT2021
Dynamic Orthogonal Matching Pursuit for Sparse Data Reconstruction
Yun-Bin Zhao, Zhi-Quan Luo
The orthogonal matching pursuit (OMP) is one of the mainstream algorithms for sparse data reconstruction or approximation. It acts as a driving force for the development of several…
math.OC2021★ 1 cited
Partial Gradient Optimal Thresholding Algorithms for a Class of Sparse Optimization Problems
Nan Meng, Yun-Bin Zhao, Michal Kocvara
The optimization problems with a sparsity constraint is a class of important global optimization problems. A typical type of thresholding algorithms for solving such a problem adop…
eess.SP2021
Newton-Type Optimal Thresholding Algorithms for Sparse Optimization Problems
Nan Meng, Yun-Bin Zhao
Sparse signals can be possibly reconstructed by an algorithm which merges a traditional nonlinear optimization method and a certain thresholding technique. Different from existing…