Distributed mirror descent for online bandit saddle point problem
From MaRDI portal
Cites work
- A distributed simultaneous perturbation approach for large-scale dynamic optimization problems
- A unitary distributed subgradient method for multi-agent optimization with different coupling sources
- Clustering with Bregman divergences.
- Distributed adaptive Newton methods with global superlinear convergence
- Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Distributed consensus-based solver for semi-definite programming: an optimization viewpoint
- Distributed Mirror Descent for Online Composite Optimization
- Distributed Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Distributed Online Optimization in Dynamic Environments Using Mirror Descent
- Distributed Saddle-Point Subgradient Algorithms With Laplacian Averaging
- Distributed zeroth-order optimization: convergence rates that match centralized counterpart
- Dynamic regret of distributed online saddle point problem
- Exploiting problem structure in optimization under uncertainty via online convex optimization
- Non-stationary stochastic optimization
- Online convex optimization in the bandit setting: gradient descent without a gradient
- Online Learning Over Dynamic Graphs via Distributed Proximal Gradient Algorithm
- Robust optimization
- Subgradient methods for saddle-point problems
- The online saddle point problem and online convex optimization with knapsacks
This page was built for publication: Distributed mirror descent for online bandit saddle point problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6933784)
