A new computational method for the sparsest solutions to systems of linear equations (Q5258945)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6449609
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new computational method for the sparsest solutions to systems of linear equations |
scientific article; zbMATH DE number 6449609 |
Statements
A New Computational Method for the Sparsest Solutions to Systems of Linear Equations (English)
0 references
24 June 2015
0 references
\(\ell_0\)-minimization
0 references
sparsest solution
0 references
reweighted \(\ell_1\)-method
0 references
convex optimization
0 references
linear programming
0 references
bilevel optimization
0 references
sparsity recovery
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.847542941570282
0 references
0.8424236178398132
0 references
0.8211103677749634
0 references
0.8139777779579163
0 references
0.8109596371650696
0 references
