Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing (Q1749455)
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: Minimization of transformed Lā penalty: theory, difference of convex function algorithm, and robust application in compressed sensing |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing |
scientific article |
Statements
Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing (English)
0 references
16 May 2018
0 references
transformed \(l_1\) penalty
0 references
sparse signal recovery theory
0 references
difference of convex function algorithm
0 references
convergence analysis
0 references
coherent random matrices
0 references
compressed sensing
0 references
robust recovery
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.90071905
0 references
0.89458066
0 references
0.89135206
0 references
0.8860761
0 references
0 references
0.88465536
0 references
0.8796103
0 references
0.8756908
0 references
0.8721738
0 references
