23 citations · 47 across the 17 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.OC2020
An adaptive stochastic gradient-free approach for high-dimensional blackbox optimization
Anton Dereventsov, Clayton G. Webster, Joseph D. Daws
In this work, we propose a novel adaptive stochastic gradient-free (ASGF) approach for solving high-dimensional nonconvex optimization problems based on function evaluations. We em…
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…