Linear Time Average Consensus and Distributed Optimization on Fixed Graphs
From MaRDI portal
Publication:4599719
DOI10.1137/16M1076629zbMath1386.93015OpenAlexW2771477296MaRDI QIDQ4599719
Publication date: 4 January 2018
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m1076629
Related Items (10)
Robust Asynchronous Stochastic Gradient-Push: Asymptotically Optimal and Network-Independent Performance for Strongly Convex Functions ⋮ An anticipatory protocol to reach fast consensus in multi-agent systems ⋮ Geometric bounds for convergence rates of averaging algorithms ⋮ Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks ⋮ Distributed consensus-based multi-agent convex optimization via gradient tracking technique ⋮ Unnamed Item ⋮ An Optimal Algorithm for Decentralized Finite-Sum Optimization ⋮ Characterizing limits and opportunities in speeding up Markov chain mixing ⋮ On arbitrary compression for decentralized consensus and stochastic optimization over directed networks ⋮ An accelerated distributed gradient method with local memory
Cites Work
- Unnamed Item
- Unnamed Item
- Non-Bayesian social learning
- Decentralised minimum-time consensus
- Distributed stochastic subgradient projection algorithms for convex optimization
- The hitting and cover times of Metropolis walks
- Bounds for eigenvalues of certain stochastic matrices
- First- and second-order diffusive methods for rapid, coarse, distributed load balancing
- Introductory lectures on convex optimization. A basic course.
- On the cover time and mixing time of random geometric graphs
- Notes on averaging over acyclic digraphs and discrete coverage control
- Analysis of accelerated gossip algorithms
- Graph diameter, eigenvalues, and minimum-time consensus
- Adding a Single State Memory Optimally Accelerates Symmetric Linear Maps
- Explicit Convergence Rate of a Distributed Alternating Direction Method of Multipliers
- On Convergence Rate of Weighted-Averaging Dynamics for Consensus Problems
- Consensus Propagation
- Fastest Mixing Markov Chain on Graphs with Symmetries
- Reaching a Consensus in a Dynamically Changing Environment: Convergence Rates, Measurement Delays, and Asynchronous Events
- Distributed asynchronous deterministic and stochastic gradient optimization algorithms
- Greedy Gossip With Eavesdropping
- Adaptive Filter Algorithms for Accelerated Discrete-Time Consensus
- Polynomial Filtering for Fast Convergence in Distributed Consensus
- Accelerated Distributed Average Consensus via Localized Node State Prediction
- DLM: Decentralized Linearized Alternating Direction Method of Multipliers
- Consensus and Cooperation in Networked Multi-Agent Systems
- Fastest Mixing Markov Chain on a Graph
- Reaching a Consensus
- Distributed Subgradient Methods for Multi-Agent Optimization
- On Distributed Averaging Algorithms and Quantization Effects
- Convergence Speed of Unsteady Distributed Consensus: Decay Estimate Along the Settling Spanning-Trees
- Convergence Speed in Distributed Consensus and Averaging
- EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Order-Optimal Consensus Through Randomized Path Averaging
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- An <formula formulatype="inline"><tex Notation="TeX">$O(1/k)$</tex> </formula> Gradient Method for Network Resource Allocation Problems
- The Spatial Smoothing Method of Clock Synchronization in Wireless Networks
- Fastest Mixing Markov Chain on a Path
This page was built for publication: Linear Time Average Consensus and Distributed Optimization on Fixed Graphs
