Improving Convergence Rate of Distributed Consensus Through Asymmetric Weights

Details Improving Convergence Rate of Distributed Consensus Through Asymmetric Weights Improving Convergence Rate of Distributed Consensus Through Asymmetric Weights

2012-03-13

arxiv.org/abs/1203.2717v1

Mathematics

Optimization and Control

2012 American Control Conference

Scientific paper

We propose a weight design method to increase the convergence rate of distributed consensus. Prior work has focused on symmetric weight design due to computational tractability. We show that with proper choice of asymmetric weights, the convergence rate can be improved significantly over even the symmetric optimal design. In particular, we prove that the convergence rate in a lattice graph can be made independent of the size of the graph with asymmetric weights. We then use a Sturm-Liouville operator to approximate the graph Laplacian of more general graphs. A general weight design method is proposed based on this continuum approximation. Numerical computations show that the resulting convergence rate with asymmetric weight design is improved considerably over that with symmetric optimal weights and Metropolis-Hastings weights.

Affiliated with

Also associated with

No associations

Rating

Improving Convergence Rate of Distributed Consensus Through Asymmetric Weights does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improving Convergence Rate of Distributed Consensus Through Asymmetric Weights, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improving Convergence Rate of Distributed Consensus Through Asymmetric Weights will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-143583