Constructing New Weighted <i>ℓ</i><sub>1</sub>-Algorithms for the Sparsest Points of Polyhedral Sets (Q2976140): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: PDCO / rank | |||
Normal rank | |||
Revision as of 12:17, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructing New Weighted <i>ℓ</i><sub>1</sub>-Algorithms for the Sparsest Points of Polyhedral Sets |
scientific article |
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
