Event-triggered distributed online convex optimization with delayed bandit feedback
From MaRDI portal
Recommendations
- Distributed online bandit optimization under random quantization
- Event-triggered discrete-time distributed consensus optimization over time-varying graphs
- Distributed optimization over weight-balanced digraphs with event-triggered communication
- A distributed conjugate gradient online learning method over networks
- Distributed convex optimisation with event-triggered communication in networked systems
Cites work
- An Incentive-Based Online Optimization Framework for Distribution Grids
- An Online Convex Optimization Approach to Proactive Network Resource Allocation
- Asynchronous Distributed Optimization With Event-Driven Communication
- Clustering with Bregman divergences.
- Consensus control for nonlinear multi-agent systems with event-triggered communications
- Constrained Online Convex Optimization With Feedback Delays
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Decentralized Online Convex Optimization With Event-Triggered Communications
- Decentralized Online Convex Optimization With Feedback Delays
- Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Distributed Event-Triggered Gradient Method for Constrained Convex Minimization
- Distributed Mirror Descent for Online Composite Optimization
- Distributed Online Optimization With Long-Term Constraints
- Distributed Online Optimization in Dynamic Environments Using Mirror Descent
- Distributed Randomized Gradient-Free Mirror Descent Algorithm for Constrained Optimization
- Distributed Subgradient Method With Edge-Based Event-Triggered Communication
- Distributed constraint optimization on networked multi-agent systems
- Distributed event-triggered algorithms for a class of convex optimization problems over directed networks
- Ergodic mirror descent
- Joint and separate convexity of the Bregman distance.
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Monte Carlo strategies in scientific computing
- Online Distributed Convex Optimization on Dynamic Networks
- Online convex optimization in the bandit setting: gradient descent without a gradient
- Online learning and online convex optimization
- Online strongly convex optimization with unknown delays
- Projected subgradient based distributed convex optimization with transmission noises
- Resilient filter of nonlinear network systems with dynamic event-triggered mechanism and hybrid cyber attack
- Stochastic mirror descent method for distributed multi-agent optimization
Cited in
(11)- Decentralized online convex optimization based on signs of relative states
- Dynamic regret for decentralized online bandit gradient descent with local steps
- Non-ergodic linear convergence property of the delayed gradient descent under the strongly convexity and the Polyak-Łojasiewicz condition
- Distributed constrained online convex optimization with adaptive quantization
- Online distributed dual averaging algorithm for multi-agent bandit optimization over time-varying general directed networks
- Distributed online optimization subject to long-term constraints and time-varying topology: an event-triggered and bandit feedback approach
- Distributed bandit online optimisation for energy management in smart grids
- Distributed online bandit optimization under random quantization
- Distributed optimization for discrete time-varying linear multi-agent systems with event-triggered communication
- Distributed online constrained convex optimization with event-triggered communication
- Prescribed-time distributed resource allocation algorithm for heterogeneous linear multi-agent networks with unbalanced directed communication
This page was built for publication: Event-triggered distributed online convex optimization with delayed bandit feedback
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2698149)
