Randomized Gradient-Free Methods in Convex Optimization
- 8 September 2023
- book chapter
- Published by Springer Nature
- p. 1-15
Abstract
No abstract availableKeywords
All Related Versions
This publication has 55 references indexed in Scilit:
- Accelerated Zero-Order SGD Method for Solving the Black Box Optimization Problem Under “Overparametrization” Condition2023
- Zero-Order Stochastic Conditional Gradient Sliding Method for Non-smooth Convex Optimization2023
- Decentralized Convex Optimization over Time-Varying Graphs2023
- Solving Smooth Min-Min and Min-Max Problems by Mixed Oracle Algorithms2021
- First-order and Stochastic Optimization Methods for Machine Learning2020
- Lectures on Convex Optimization2018
- Coordinate descent algorithmsMathematical Programming, 2015
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite functionMathematical Programming, 2012
- An optimal method for stochastic composite optimizationMathematical Programming, 2011
- Algorithms for approximate calculation of the minimum of a convex function from its valuesMathematical Notes, 1996