Linear Convergence of Stochastic Iterative Greedy Algorithms With Sparse Constraints
From MaRDI portal
Publication:4566535
DOI10.1109/TIT.2017.2749330zbMath1390.94326arXiv1407.0088OpenAlexW2963297739MaRDI QIDQ4566535
No author found.
Publication date: 27 June 2018
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.0088
Applications of mathematical programming (90C90) Stochastic programming (90C15) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (10)
Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms ⋮ Iterative hard thresholding for low CP-rank tensor models ⋮ Decomposable norm minimization with proximal-gradient homotopy algorithm ⋮ A Tight Bound of Hard Thresholding ⋮ Unnamed Item ⋮ Stochastic greedy algorithms for multiple measurement vectors ⋮ Consistent online Gaussian process regression without the sample complexity bottleneck ⋮ Weighted thresholding homotopy method for sparsity constrained optimization ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: Linear Convergence of Stochastic Iterative Greedy Algorithms With Sparse Constraints
