Online Distributed Convex Optimization on Dynamic Networks
From MaRDI portal
Abstract: This paper presents a distributed optimization scheme over a network of agents in the presence of cost uncertainties and over switching communication topologies. Inspired by recent advances in distributed convex optimization, we propose a distributed algorithm based on a dual sub-gradient averaging. The objective of this algorithm is to minimize a cost function cooperatively. Furthermore, the algorithm changes the weights on the communication links in the network to adapt to varying reliability of neighboring agents. A convergence rate analysis as a function of the underlying network topology is then presented, followed by simulation results for representative classes of sensor networks.
Cited in
(34)- A multi-scale method for distributed convex optimization with constraints
- A distributed conjugate gradient online learning method over networks
- A unitary distributed subgradient method for multi-agent optimization with different coupling sources
- An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs
- Distributed multi-step subgradient optimization for multi-agent system
- Personalized optimization with user's feedback
- Event-triggered distributed online convex optimization with delayed bandit feedback
- Projection-free decentralized online learning for submodular maximization over time-varying networks
- Online Distributed Optimization With Strongly Pseudoconvex-Sum Cost Functions
- Asynchronous Broadcast-Based Convex Optimization Over a Network
- Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization
- Dynamic online convex optimization with long-term constraints via virtual queue
- A gradient‐free distributed optimization method for convex sum of nonconvex cost functions
- Distributed online bandit linear regressions with differential privacy
- Differentially private distributed online learning over time‐varying digraphs via dual averaging
- A differentially private distributed optimization method for constrained optimization
- Online distributed optimization with strongly pseudoconvex-sum cost functions and coupled inequality constraints
- 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
- Dynamic regret of adaptive gradient methods for strongly convex problems
- Distributed constrained optimization for multi-agent networks with communication delays under time-varying topologies
- Online convex optimization using coordinate descent algorithms
- An accelerated distributed online gradient push-sum algorithm on time-varying directed networks
- Privacy-preserving distributed projected one-point bandit online optimization over directed graphs
- Distributed online optimization subject to long-term constraints and time-varying topology: an event-triggered and bandit feedback approach
- 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 stochastic gradients: high probability bound of regrets
- Decentralized online strongly convex optimization with general compressors and random disturbances
- Online distributed algorithms for mixed equilibrium problems in dynamic environments
- Distributed online adaptive subgradient optimization with dynamic bound of learning rate over time-varying networks
- On the convergence analysis of the decentralized projected gradient descent method
- Dynamic regret for decentralized online bandit gradient descent with local steps
- Distributed online optimization with edge-based event-triggered communication
This page was built for publication: Online Distributed Convex Optimization on Dynamic Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980291)
