Constrained distributed online convex optimization with bandit feedback for unbalanced digraphs
From MaRDI portal
Cites work
- A decomposition method for large scale MILPs, with performance guarantees and a power system application
- A new one-point residual-feedback oracle for black-box learning and control
- Decentralized Online Convex Optimization With Event-Triggered Communications
- Differentially private distributed online learning over time‐varying digraphs via dual averaging
- Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Distributed event-triggered algorithm for unconstrained convex optimisation over weight-balanced directed networks
- Distributed Online Convex Optimization on Time-Varying Directed Graphs
- Distributed Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Distributed Online Optimization for Multi-Agent Networks With Coupled Inequality Constraints
- Distributed optimization over directed graphs with row stochasticity and constraint regularity
- Distributed Randomized Gradient-Free Mirror Descent Algorithm for Constrained Optimization
- Distributed Subgradient Methods for Multi-Agent Optimization
- Dual decomposition for multi-agent distributed optimization with coupling constraints
- EXTRA: an exact first-order algorithm for decentralized consensus optimization
- Fast decentralized nonconvex finite-sum optimization with recursive variance reduction
- Gradient-free distributed optimization with exact convergence
- Gradient‐free method for distributed multi‐agent optimization via push‐sum algorithms
- Harnessing Smoothness to Accelerate Distributed Optimization
- Introduction to Online Convex Optimization
- Linear Convergence of Consensus-Based Quantized Optimization for Smooth and Strongly Convex Cost Functions
- On Distributed Convex Optimization Under Inequality and Equality Constraints
- Online Convex Optimization With Time-Varying Constraints and Bandit Feedback
- Online distributed dual averaging algorithm for multi-agent bandit optimization over time-varying general directed networks
- Randomized Gradient-Free Distributed Optimization Methods for a Multiagent System With Unknown Cost Function
- Zeroth-order algorithms for stochastic distributed nonconvex optimization
This page was built for publication: Constrained distributed online convex optimization with bandit feedback for unbalanced digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6882671)
