A Simple Proof for Recoverability of L1-Minimization (II): the Nonnegativity Case

Date
2005-09
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract

When using L1 minimization to recover a sparse, nonnegative solution to a under-determined linear system of equations, what is the highest sparsity level at which recovery can still be guaranteed? Recently, Donoho and Tanner discovered, by invoking classic results from the theory of convex polytopes that the highest sparsity level equals half of the number of equations. In this report, we provide a completely self-contained, yet short and elementary, proof for this remarkable result. We also connect dots for different recoverability conditions obtained from different spaces.

Description
Advisor
Degree
Type
Technical report
Keywords
Citation

Zhang, Yin. "A Simple Proof for Recoverability of L1-Minimization (II): the Nonnegativity Case." (2005) https://hdl.handle.net/1911/102041.

Has part(s)
Forms part of
Published Version
Rights
Link to license
Citable link to this page