Date(s) : 17/10/2014 iCal
14 h 00 min - 15 h 00 min
Generalizing CoSaMP and family\n\nTools like CoSaMP (Compressed Sampling Matching Pursuit)\, SP (Subspace Pursuit)\, IHT (Iterative Hard Thresholding)… are now commonly used for solving linear problems with a sparse prior. In order to analyze the behavior of all these algorithms many tools have been proposed and the RIP (restricted isometry property) is one of most famous. In the talk we propose to generalize this family of sparse algorithm to non-linear problem. Such task will ask for a new criterion for analysis and allow us to better understand to which elements these methods converge. Finally\, we will raise some open question and propose some future axes.
Catégories Pas de Catégories