Zero order algorithm for decentralized optimization problems
From MaRDI portal
Cites work
- A Stochastic Approximation Method
- A survey of cross-validation procedures for model selection
- AN EXPONENTIAL LOWER BOUND ON THE COMPLEXITY OF REGULARIZATION PATHS
- An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback
- An accelerated method for derivative-free smooth stochastic convex optimization
- Coordinate descent algorithms
- Deep learning
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Efficiency of the accelerated coordinate descent method on structured optimization problems
- Generalized stochastic Frank-Wolfe algorithm with stochastic ``substitute gradient for structured convex optimization
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Loss landscapes and optimization in over-parameterized non-linear systems and neural networks
- Non-smooth setting of stochastic decentralized convex optimization problem over time-varying graphs
- Parallel coordinate descent methods for big data optimization
- RATQ: A Universal Fixed-Length Quantizer for Stochastic Optimization
- Random gradient-free minimization of convex functions
- Randomized smoothing for stochastic optimization
- Stochastic distributed learning with gradient quantization and double-variance reduction
This page was built for publication: Zero order algorithm for decentralized optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7007333)
