On the Optimality of the Backward Greedy Algorithm for the Subset Selection Problem (Q4943659)
From MaRDI portal
!
WARNING
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 1416886
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Optimality of the Backward Greedy Algorithm for the Subset Selection Problem |
scientific article; zbMATH DE number 1416886 |
Statements
On the Optimality of the Backward Greedy Algorithm for the Subset Selection Problem (English)
0 references
19 March 2000
0 references
subset selection
0 references
sparse least-squares solutions
0 references
backward greedy algorithm
0 references
NP-hard
0 references
linear inverse problem
0 references
Givens rotations
0 references
0 references
0 references
0.8719887
0 references
0.8623203
0 references
0.8583373
0 references
0.8540342
0 references
0.85358715
0 references
0.85052466
0 references
0.8502223
0 references
