Norms of random submatrices and sparse approximation

DOI10.1016/j.crma.2008.10.008zbMath1170.46012OpenAlexW1997889147WikidataQ59750748 ScholiaQ59750748MaRDI QIDQ2378324

Joel A. Tropp

Publication date: 8 January 2009

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.crma.2008.10.008

Mathematics Subject Classification ID

Probabilistic methods in Banach space theory (46B09) Random matrices (algebraic aspects) (15B52)

Related Items

Near-ideal model selection by \(\ell _{1}\) minimization ⋮ Sparse signal recovery via non-convex optimization and overcomplete dictionaries ⋮ Norms of structured random matrices ⋮ Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization ⋮ Two are better than one: fundamental parameters of frame coherence ⋮ Paved with good intentions: analysis of a randomized block Kaczmarz method ⋮ Invertibility of random submatrices via tail-decoupling and a matrix Chernoff inequality ⋮ Consistency of \(\ell_1\) recovery from noisy deterministic measurements ⋮ Randomized block Kaczmarz method with projection for solving least squares ⋮ Construction of highly redundant incoherent unit norm tight frames as a union of orthonormal bases ⋮ On a new method for controlling the entire spectrum in the problem of column subset selection ⋮ Submatrices with NonUniformly Selected Random Supports and Insights into Sparse Approximation

Cites Work

• Unnamed Item
• Invertibility of ``large submatrices with applications to the geometry of Banach spaces and harmonic analysis
• Sampling from large matrices
• The random paving property for uniformly bounded matrices
• Operator Khintchine inequality in non-commutative probability