Distributed Mirror Descent for Online Composite Optimization
From MaRDI portal
Cited in
(22)- Distributed resource allocation via multi-agent systems under time-varying networks
- Distributed online bandit optimization under random quantization
- Distributed ergodic algorithms for mixed equilibrium problems: absent of cut property
- Event-triggered distributed online convex optimization with delayed bandit feedback
- Analysis of Online Composite Mirror Descent Algorithm
- Distributed mirror descent algorithm over unbalanced digraphs based on gradient weighting technique
- Online distributed detection of sensor networks with delayed information
- Distributed regularized online optimization using forward-backward splitting
- Federated learning for minimizing nonsmooth convex loss functions
- Distributed constrained optimization with periodic dynamic quantization
- Distributed online optimisation in unknown dynamic environment
- Distributed inertial online game algorithm for tracking generalized Nash equilibria
- Online composite optimization with time-varying regularizers
- Online distributed optimization with stochastic gradients: high probability bound of regrets
- Online distributed algorithms for mixed equilibrium problems in dynamic environments
- Communication-efficient online federated composite optimization
- Distributed mirror descent for online bandit saddle point problem
- Privacy-preserving distributed online mirror descent for nonconvex optimization
- Distributed online path-length-independent algorithm for noncooperative games over unbalanced digraphs
- Distributed constrained optimization over unbalanced graphs and delayed gradient
- Prescribed-time distributed optimization for multi-agent systems over unbalanced directed networks
- Forgetting-factor regrets for distributed second-order online optimisation
This page was built for publication: Distributed Mirror Descent for Online Composite Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5854051)
