# Iterative Algorithms in Compressive Sensing

If you have a question about this talk, please contact Carola-Bibiane Schoenlieb.

Over the past few years, $\ell_1$-minimization has become the most popular method to recover sparse vectors from incomplete linear measurements. However, simpler iterative algorithms such as Iterative Hard Thresholding present the same theoretical guarantees when the measurement matrix satisfies the restricted isometry property. In this talk, I will focus on iterative algorithms that converge in a finite number of iterations proportional to the sparsity level. This fact was observed only recently for (weak) Orthogonal Matching Pursuit. I will also demonstrate a similar result for Hard Thresholding Pursuit. Advantages of the latter algorithm will be recalled along the way.

This talk is part of the Applied and Computational Analysis series.

Tell a friend about this talk:

## This talk is included in these lists:

Note that ex-directory lists are not shown.

© 2006-2021 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity