Linear time average consensus and distributed optimization on fixed graphs
From MaRDI portal
Recommendations
Cites work
- Accelerated Distributed Average Consensus via Localized Node State Prediction
- Adaptive Filter Algorithms for Accelerated Discrete-Time Consensus
- Adding a Single State Memory Optimally Accelerates Symmetric Linear Maps
- An <formula formulatype="inline"><tex Notation="TeX">$O(1/k)$</tex> </formula> Gradient Method for Network Resource Allocation Problems
- Analysis of accelerated gossip algorithms
- Bounds for eigenvalues of certain stochastic matrices
- Consensus and Cooperation in Networked Multi-Agent Systems
- Consensus Propagation
- Convergence speed in distributed consensus and averaging
- Convergence Speed of Unsteady Distributed Consensus: Decay Estimate Along the Settling Spanning-Trees
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Decentralised minimum-time consensus
- Distributed asynchronous deterministic and stochastic gradient optimization algorithms
- Distributed stochastic subgradient projection algorithms for convex optimization
- Distributed Subgradient Methods for Multi-Agent Optimization
- DLM: Decentralized Linearized Alternating Direction Method of Multipliers
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Explicit Convergence Rate of a Distributed Alternating Direction Method of Multipliers
- EXTRA: an exact first-order algorithm for decentralized consensus optimization
- Fastest Mixing Markov Chain on a Graph
- Fastest Mixing Markov Chain on a Path
- Fastest mixing Markov chain on graphs with symmetries
- First- and second-order diffusive methods for rapid, coarse, distributed load balancing
- Graph diameter, eigenvalues, and minimum-time consensus
- Greedy Gossip With Eavesdropping
- scientific article; zbMATH DE number 5454133 (Why is no real title available?)
- Introductory lectures on convex optimization. A basic course.
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Non-Bayesian social learning
- Notes on averaging over acyclic digraphs and discrete coverage control
- On Convergence Rate of Weighted-Averaging Dynamics for Consensus Problems
- On Distributed Averaging Algorithms and Quantization Effects
- On the cover time and mixing time of random geometric graphs
- Order-Optimal Consensus Through Randomized Path Averaging
- Polynomial Filtering for Fast Convergence in Distributed Consensus
- Reaching a Consensus
- Reaching a Consensus in a Dynamically Changing Environment: Convergence Rates, Measurement Delays, and Asynchronous Events
- The hitting and cover times of Metropolis walks
- The spatial smoothing method of clock synchronization in wireless networks
Cited in
(21)- Distributed consensus-based multi-agent convex optimization via gradient tracking technique
- 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
- An anticipatory protocol to reach fast consensus in multi-agent systems
- Fast linear iterations for distributed averaging
- Graph diameter, eigenvalues, and minimum-time consensus
- Geometric bounds for convergence rates of averaging algorithms
- Distributed Stopping for Average Consensus in Digraphs
- Robust asynchronous stochastic gradient-push: asymptotically optimal and network-independent performance for strongly convex functions
- scientific article; zbMATH DE number 7626754 (Why is no real title available?)
- An Optimal Algorithm for Decentralized Finite-Sum Optimization
- Order-Optimal Consensus Through Randomized Path Averaging
- Distributed convex optimization as a tool for solving \(f\)-consensus problems
- Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks
- Optimal distributed linear averaging
- AB /Push-Pull method for distributed optimization in time-varying directed networks
- Efficient computation in congested anonymous dynamic networks
- Brief announcement: Know your audience. Communication model and computability in anonymous networks
- Efficient computation in congested anonymous dynamic networks
- Universal finite-state and self-stabilizing computation in anonymous dynamic networks
This page was built for publication: Linear time average consensus and distributed optimization on fixed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4599719)
