Complexity of unconstrained \(L_2 - L_p\) minimization (Q2436652)
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: Complexity of unconstrained Lā - L_p minimization |
scientific article; zbMATH DE number 6261683
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of unconstrained \(L_2 - L_p\) minimization |
scientific article; zbMATH DE number 6261683 |
Statements
Complexity of unconstrained \(L_2 - L_p\) minimization (English)
0 references
25 February 2014
0 references
nonsmooth optimization
0 references
nonconvex optimization
0 references
variable selection
0 references
sparse solution reconstruction
0 references
bridge estimator
0 references
0 references
0 references
0 references
0.9281632
0 references
0.88807446
0 references
0.8867774
0 references
0.8842204
0 references
0.87918055
0 references
0.87912184
0 references
0.8761895
0 references
0.8742652
0 references
0.87394637
0 references
