Between hard and soft thresholding: optimal iterative thresholding algorithms

DOI10.1093/imaiai/iaz027zbMath1473.90162arXiv1804.08841OpenAlexW2995268158WikidataQ127232424 ScholiaQ127232424MaRDI QIDQ5006544

Rina Foygel Barber, Haoyang Liu

Publication date: 16 August 2021

Published in: Information and Inference: A Journal of the IMA (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.08841

zbMATH Keywords

condition numbernonconvex optimizationsparse optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Extreme-point and pivoting methods (90C49)

Related Items (3)

Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms ⋮ A tight bound of modified iterative hard thresholding algorithm for compressed sensing. ⋮ Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach

This page was built for publication: Between hard and soft thresholding: optimal iterative thresholding algorithms