Distributed Online Convex Optimization on Time-Varying Directed Graphs
From MaRDI portal
Publication:4560028
Cited in
(29)- Online Distributed Optimization With Strongly Pseudoconvex-Sum Cost Functions
- Decentralized online convex optimization based on signs of relative states
- Distributed nonconvex constrained optimization over time-varying digraphs
- Distributed online optimisation in unknown dynamic environment
- A privacy-masking learning algorithm for online distributed optimization over time-varying unbalanced digraphs
- Dynamic online convex optimization with long-term constraints via virtual queue
- Gradient-free algorithms for distributed online convex optimization
- Privacy-preserving distributed projected one-point bandit online optimization over directed graphs
- Distributed convex optimization with coupling constraints over time-varying directed graphs
- Distributed online bandit linear regressions with differential privacy
- Differentially private distributed online learning over time‐varying digraphs via dual averaging
- Privacy preserving distributed online projected residual feedback optimization over unbalanced directed graphs
- Online distributed dual averaging algorithm for multi-agent bandit optimization over time-varying general directed networks
- Distributed adaptive online learning for convex optimization with weight decay
- An accelerated distributed online gradient push-sum algorithm on time-varying directed networks
- Distributed constrained optimization for multi-agent networks with communication delays under time-varying topologies
- Online distributed optimization with stochastic gradients: high probability bound of regrets
- Distributed optimization of multi-integrator agent systems with mixed neighbor interactions
- Decentralized online convex optimization with compressed communications
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- Robust asynchronous stochastic gradient-push: asymptotically optimal and network-independent performance for strongly convex functions
- A distributed conjugate gradient online learning method over networks
- Distributed optimization over directed graphs with row stochasticity and constraint regularity
- Distributed finite‐time optimization algorithms for multi‐agent systems under directed graphs
- Distributed discrete-time convex optimization with nonidentical local constraints over time-varying unbalanced directed graphs
- Random gradient-free method for online distributed optimization with strongly pseudoconvex cost functions
- Online distributed nonconvex optimization with stochastic objective functions: high probability bound analysis of dynamic regrets
- Online distributed optimization with strongly pseudoconvex-sum cost functions and coupled inequality constraints
- Distributed Optimization Over Time-Varying Graphs With Imperfect Sharing of Information
This page was built for publication: Distributed Online Convex Optimization on Time-Varying Directed Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4560028)
