Convergence of distributed gradient-tracking-based optimization algorithms with random graphs
From MaRDI portal
Publication:2235622
DOI10.1007/S11424-021-9355-5zbMath1472.93006OpenAlexW3146350192MaRDI QIDQ2235622
Tao Li, Jiexiang Wang, Keli Fu, Yu Gu
Publication date: 21 October 2021
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-021-9355-5
Random graphs (graph-theoretic aspects) (05C80) Convex programming (90C25) Multi-agent systems (93A16) Networked control (93B70)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Discrete-time dynamic average consensus
- Distributed stochastic gradient tracking methods
- A distributed multiple dimensional QoS constrained resource scheduling optimization policy in computational grid
- Fast Distributed Gradient Methods
- Distributed Averaging With Random Network Graphs and Noises
- Distributed Spectrum Sensing for Cognitive Radio Networks by Exploiting Sparsity
- Distributed Consensus Algorithms in Sensor Networks With Imperfect Communication: Link Failures and Channel Noise
- On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- Harnessing Smoothness to Accelerate Distributed Optimization
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed Subgradient Methods for Convex Optimization Over Random Networks
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Measure Theory
- Robust Estimation of a Location Parameter
- Decentralized Optimization Over Time-Varying Directed Graphs With Row and Column-Stochastic Matrices
This page was built for publication: Convergence of distributed gradient-tracking-based optimization algorithms with random graphs
