Kyrillidis, AnastasiosPuy, GillesCevher, Volkan2013-01-142013-01-142013-01-14201210.1109/ICASSP.2012.6288706https://infoscience.epfl.ch/handle/20.500.14299/87783WOS:000312381403179We introduce a new sparse recovery paradigm, called Normed Pursuits, where efficient algorithms from combinatorial and convex optimization interface for interpretable and model-based solutions. Synthetic and real data experiments illustrate that Normed Pursuits can significantly enhance the performance of both hard thresholding methods and convex solvers in sparse recovery.Hard Thresholding with Norm Constraintstext::conference output::conference proceedings::conference paper