In this note, we address the theoretical properties of p, a class of compressed sensing decoders that rely on p minimization with p (0, 1) to recover estimates of sparse and compr...
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner...
—Nuclear norm minimization (NNM) has recently gained attention for its use in rank minimization problems. In this paper, we define weak, sectional and strong recovery for NNM to...
Methods based on 1-relaxation, such as basis pursuit and the Lasso, are very popular for sparse regression in high dimensions. The conditions for success of these methods are now ...
This paper introduces a simple and very general theory of compressive sensing. In this theory, the sensing mechanism simply selects sensing vectors independently at random from a ...