A zeroth-order variance-reduced method for decentralized stochastic non-convex optimization
From MaRDI portal
Cites work
- A Bregman Splitting Scheme for Distributed Optimization Over Networks
- A theoretical and empirical comparison of gradient approximations in derivative-free optimization
- An Improved Convergence Analysis for Decentralized Online Stochastic Non-Convex Optimization
- Distributed nonconvex constrained optimization over time-varying digraphs
- Distributed stochastic gradient tracking methods
- Distributed stochastic gradient tracking methods with momentum acceleration for non-convex optimization
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed Zero-Order Algorithms for Nonconvex Multiagent Optimization
- Exponential convergence of distributed primal-dual convex optimization algorithm without strong convexity
- Harnessing Smoothness to Accelerate Distributed Optimization
- Linear Convergence of First- and Zeroth-Order Primal–Dual Algorithms for Distributed Nonconvex Optimization
- Multi-agent reinforcement learning: a selective overview of theories and algorithms
- Random gradient-free minimization of convex functions
- Stochastic derivative-free optimization using a trust region framework
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Zeroth-order algorithms for stochastic distributed nonconvex optimization
- ZONE: Zeroth-Order Nonconvex Multiagent Optimization Over Networks
This page was built for publication: A zeroth-order variance-reduced method for decentralized stochastic non-convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7391958)
