23 citations · 47 across the 17 of their papers we have counts for
Showing math.NAShow all
3 papers · 1 filter
math.NA2020★ 1 cited
Biorthogonal Greedy Algorithms in Convex Optimization
Anton Dereventsov, Vladimir Temlyakov
The study of greedy approximation in the context of convex optimization is becoming a promising research direction as greedy algorithms are actively being employed to construct spa…
math.NA2018★ 23 cited
A unified way of analyzing some greedy algorithms
Anton Dereventsov, Vladimir Temlyakov
In this paper we propose a unified way of analyzing a certain kind of greedy-type algorithms in Banach spaces. We define a class of the Weak Biorthogonal Greedy Algorithms that con…
math.NA2015★ 9 cited
On the Approximate Weak Chebyshev Greedy Algorithm in Uniformly Smooth Banach Spaces
A. V. Dereventsov
We study greedy approximation in uniformly smooth Banach spaces. The Weak Chebyshev Greedy Algorithm (WCGA) is defined for any Banach space and a dictionary , and…