Continuous-time distributed convex optimization on directed graphs

Details Continuous-time distributed convex optimization on directed graphs Continuous-time distributed convex optimization on directed graphs

2012-04-02

arxiv.org/abs/1204.0304v1

Mathematics

Optimization and Control

Scientific paper

This paper studies the continuous-time distributed optimization of a sum of convex functions over directed graphs. Contrary to what is known in the consensus literature, where the same dynamics works for both undirected and directed scenarios, we show that the consensus-based dynamics that solves the continuous-time distributed optimization problem for undirected graphs fails to converge when transcribed to the directed setting. This study sets the basis for the design of an alternative distributed dynamics which we show is guaranteed to converge, on any strongly connected weight-balanced digraph, to the set of minimizers of a sum of convex differentiable functions with globally Lipschitz gradients. Our technical approach combines notions of invariance and cocoercivity with the positive definiteness properties of graph matrices to establish the results.

Affiliated with

Also associated with

No associations

Rating

Continuous-time distributed convex optimization on directed graphs 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 Continuous-time distributed convex optimization on directed graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Continuous-time distributed convex optimization on directed graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-509252