A Simple Proof for Recoverability of L1-Minimization: Go Over or Under?

Simple item page
dc.contributor.authorZhang, Yin
dc.date.accessioned2018-06-18T17:56:58Z
dc.date.available2018-06-18T17:56:58Z
dc.date.issued2005-08
dc.date.noteAugust 2005
dc.description.abstractIt is well-known by now that L1 minimization can help recover sparse solutions to under-determined linear equations or sparsely corrupted solutions to over-determined equations, and the two problems are equivalent under appropriate conditions. So far almost all theoretic results have been obtained through studying the ``under-determined side'' of the problem. In this note, we take a different approach from the ``over-determined side'' and show that a recoverability result (with the best available order) follows almost immediately from an inequality of Garnaev and Gluskin. We also connect dots with recoverability conditions obtained from different spaces.
dc.format.extent9 pp
dc.identifier.citationZhang, Yin. "A Simple Proof for Recoverability of L1-Minimization: Go Over or Under?." (2005) <a href="https://hdl.handle.net/1911/102040">https://hdl.handle.net/1911/102040</a>.
dc.identifier.digitalTR05-09
dc.identifier.urihttps://hdl.handle.net/1911/102040
dc.language.isoeng
dc.titleA Simple Proof for Recoverability of L1-Minimization: Go Over or Under?
dc.typeTechnical report
dc.type.dcmiText
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR05-09.pdf
Size:
98.19 KB
Format:
Adobe Portable Document Format
Download
Collections
CAAM Technical Reports