A note on the complexity of \(L _{p }\) minimization (Q644905)
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: A note on the complexity of L _p minimization |
scientific article; zbMATH DE number 5968804
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the complexity of \(L _{p }\) minimization |
scientific article; zbMATH DE number 5968804 |
Statements
A note on the complexity of \(L _{p }\) minimization (English)
0 references
7 November 2011
0 references
nonconvex programming
0 references
global optimization
0 references
interior-point method
0 references
sparse solution reconstruction
0 references
0.8619563579559326
0 references
0.7936182022094727
0 references
0.7877876162528992
0 references
0.7872818112373352
0 references
0.784320592880249
0 references
