Distributed Subgradient Methods and Quantization Effects

Details Distributed Subgradient Methods and Quantization Effects Distributed Subgradient Methods and Quantization Effects

2008-03-08

arxiv.org/abs/0803.1202v1

Mathematics

Optimization and Control

Scientific paper

We consider a convex unconstrained optimization problem that arises in a network of agents whose goal is to cooperatively optimize the sum of the individual agent objective functions through local computations and communications. For this problem, we use averaging algorithms to develop distributed subgradient methods that can operate over a time-varying topology. Our focus is on the convergence rate of these methods and the degradation in performance when only quantized information is available. Based on our recent results on the convergence time of distributed averaging algorithms, we derive improved upper bounds on the convergence rate of the unquantized subgradient method. We then propose a distributed subgradient method under the additional constraint that agents can only store and communicate quantized information, and we provide bounds on its convergence rate that highlight the dependence on the number of quantization levels.

Affiliated with

Also associated with

No associations

Rating

Distributed Subgradient Methods and Quantization Effects 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 Distributed Subgradient Methods and Quantization Effects, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed Subgradient Methods and Quantization Effects will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-445134