Constructing New Weighted <i>ℓ</i><sub>1</sub>-Algorithms for the Sparsest Points of Polyhedral Sets (Q2976140)
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: Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets |
scientific article; zbMATH DE number 6705633
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructing New Weighted <i>ℓ</i><sub>1</sub>-Algorithms for the Sparsest Points of Polyhedral Sets |
scientific article; zbMATH DE number 6705633 |
Statements
Constructing New Weighted <i>ℓ</i><sub>1</sub>-Algorithms for the Sparsest Points of Polyhedral Sets (English)
0 references
13 April 2017
0 references
polyhedral set
0 references
sparsest point
0 references
weighted \(l_{1}\)-algorithm
0 references
convex optimization
0 references
sparsity recovery
0 references
strict complementarity
0 references
duality theory
0 references
bilevel programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.87127244
0 references
0.8669028
0 references
0.8669028
0 references
0.8653632
0 references
0.85643756
0 references
0.8550699
0 references
0.85337746
0 references
0.8533774
0 references
