Sparse recovery by non-convex optimization - instance optimality (Q984656)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sparse recovery by non-convex optimization - instance optimality |
scientific article; zbMATH DE number 5757858
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sparse recovery by non-convex optimization - instance optimality |
scientific article; zbMATH DE number 5757858 |
Statements
Sparse recovery by non-convex optimization - instance optimality (English)
0 references
20 July 2010
0 references
The authors discuss the theoretical properties of a class of compressed sensing decoders that rely on \(\ell^P\) minimization with \(0<p<1\). For an introduction to the topic one may consult a paper by \textit{E. J Candès, J. Romberg} and \textit{T. Tao} [Commun. Pure Appl. Math. 59, No. 8, 1207--1223 (2006; Zbl 1098.94009)] that treats the case \(p=1\).
0 references
compressed sensing
0 references
compressive sampling
0 references
\(\ell ^{1}\) minimization
0 references
\(\ell ^p\) minimization
0 references
sparse reconstruction
0 references
instance optimality
0 references
instance optimality in probability
0 references
0 references
0 references
0 references
0 references
0 references
0 references
