Published December 2008
| public
Journal Article
Norms of random submatrices and sparse approximation
- Creators
-
Tropp, Joel A.
Abstract
Many problems in the theory of sparse approximation require bounds on operator norms of a random submatrix drawn from a fixed matrix. The purpose of this Note is to collect estimates for several different norms that are most important in the analysis of ℓ1 minimization algorithms. Several of these bounds have not appeared in detail.
Additional Information
Copyright © 2008 Académie des sciences. Received 12 February 2008; accepted 13 October 2008. Available online 8 November 2008. This work was supported in part by DARPA/ONR N66001-06-1-2011.Additional details
- Eprint ID
- 13065
- DOI
- 10.1016/j.crma.2008.10.008
- Resolver ID
- CaltechAUTHORS:TROcrm08
- N66001-06-1-2011
- Office of Naval Research
- Created
-
2009-01-16Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field