On the Optimality of the Backward Greedy Algorithm for the Subset Selection Problem
From MaRDI portal
Publication:4943659
DOI10.1137/S0895479898332928zbMath0994.65049OpenAlexW1986583171MaRDI QIDQ4943659
Yoram Bresler, Christophe Couvreur
Publication date: 19 March 2000
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895479898332928
subset selectionNP-hardlinear inverse problemGivens rotationsbackward greedy algorithmsparse least-squares solutions
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
Optimal column subset selection for image classification by genetic algorithms ⋮ Local search methods for \(\ell_{1}\)-minimization in frame based signal compression ⋮ Reprint of: A forward-backward greedy approach for sparse multiscale learning ⋮ Sparse approximation over the cube ⋮ Unnamed Item ⋮ A pruning method of refining recursive reduced least squares support vector regression ⋮ Subset Selection in Sparse Matrices ⋮ Unnamed Item ⋮ Variable Selection for Support Vector Machines ⋮ A forward-backward greedy approach for sparse multiscale learning
This page was built for publication: On the Optimality of the Backward Greedy Algorithm for the Subset Selection Problem
