Randomized gradient-free methods in convex optimization
arXiv:2211.13566 · doi:10.1007/978-3-030-54621-2_859-1
Abstract
This review presents modern gradient-free methods to solve convex optimization problems. By gradient-free methods, we mean those that use only (noisy) realizations of the objective value. We are motivated by various applications where gradient information is prohibitively expensive or even unavailable. We mainly focus on three criteria: oracle complexity, iteration complexity, and the maximum permissible noise level.
arXiv commentSurvey paper; 9 pages
References in corpus (10)
- Derivative-free optimization methods
- On the Complexity of Bandit and Derivative-Free Stochastic Convex Optimization
- An Accelerated Directional Derivative Method for Smooth Stochastic Convex Optimization
- Recent theoretical advances in decentralized distributed convex optimization
- Derivative-Free Method For Composite Optimization With Applications To Decentralized Distributed Optimization
- Smooth Monotone Stochastic Variational Inequalities and Saddle Point Problems: A Survey
- Solving smooth min-min and min-max problems by mixed oracle algorithms
- Zeroth-Order Algorithms for Smooth Saddle-Point Problems
- Decentralized convex optimization over time-varying graphs: a survey
- On the upper bound for the mathematical expectation of the norm of a vector uniformly distributed on the sphere and the phenomenon of concentration of uniform measure on the sphere