On the Optimality of the Backward Greedy Algorithm for the Subset Selection Problem (Q4943659): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0895479898332928 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1986583171 / rank | |||
Normal rank | |||
Latest revision as of 11:31, 30 July 2024
scientific article; zbMATH DE number 1416886
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
