On Lebesgue-type inequalities for greedy approximation.

David L. Donoho Michael Elad Vladimir N. Temlyakov

Published in: J. Approx. Theory (2007)

Keyphrases

greedy algorithm
search algorithm
approximation error
real time
neural network
sufficient conditions
closed form
hill climbing
linear inequalities
feature selection
search space
dynamic programming
upper bound
error bounds
approximation schemes