Geometrical convergence rate for distributed optimization with time-varying directed graphs and uncoordinated step-sizes
From MaRDI portal
Publication:781032
DOI10.1016/j.ins.2017.09.038zbMath1491.90118arXiv1611.00990OpenAlexW2964280898MaRDI QIDQ781032
Dawen Xia, Qingguo Lü, Huaqing Li
Publication date: 16 July 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.00990
multi-agent systemsdistributed optimizationsmall gain theoremtime-varying directed graphsuncoordinated step-sizes
Related Items (6)
Multi-agent based optimal equilibrium selection with resilience constraints for traffic flow ⋮ A distributed accelerated optimization algorithm over time‐varying directed graphs with uncoordinated step‐sizes ⋮ A resilient distributed optimization strategy against false data injection attacks ⋮ Online distributed dual averaging algorithm for multi-agent bandit optimization over time-varying general directed networks ⋮ Prescribed-time distributed optimization for time-varying objective functions: a perspective from time-domain transformation ⋮ On the convergence of exact distributed generalisation and acceleration algorithm for convex optimisation
Cites Work
- Unnamed Item
- Distributed stochastic subgradient projection algorithms for convex optimization
- Distributed multi-agent optimization with state-dependent communication
- Convergence rate for consensus with delays
- Event-triggered asynchronous intermittent communication strategy for synchronization in complex dynamical networks
- Tracking and formation control of multiple autonomous agents: a two-level consensus approach
- Stochastic Gradient-Push for Strongly Convex Functions on Time-Varying Directed Graphs
- Event-Triggering Sampling Based Leader-Following Consensus in Second-Order Multi-Agent Systems
- Distributed Optimization Over Time-Varying Directed Graphs
- Fast Distributed Gradient Methods
- Incremental Stochastic Subgradient Algorithms for Convex Optimization
- Diffusion Adaptation Strategies for Distributed Optimization and Learning Over Networks
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- Distributed Subgradient Methods for Multi-Agent Optimization
- Constrained Consensus and Optimization in Multi-Agent Networks
- Second-Order Consensus Seeking in Multi-Agent Systems With Nonlinear Dynamics Over Random Switching Directed Networks
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Asynchronous Broadcast-Based Convex Optimization Over a Network
- On Distributed Convex Optimization Under Inequality and Equality Constraints
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Convergence of a Multi-Agent Projected Stochastic Gradient Algorithm for Non-Convex Optimization
- Quantized Subgradient Algorithm and Data-Rate Analysis for Distributed Optimization
- Feedback Systems
This page was built for publication: Geometrical convergence rate for distributed optimization with time-varying directed graphs and uncoordinated step-sizes
