Computer Science – Systems and Control
Scientific paper
2011-04-28
Computer Science
Systems and Control
15 pages
Scientific paper
This paper presents a set of continuous-time distributed algorithms that solve unconstrained, separable, convex optimization problems over undirected networks with fixed topologies. The algorithms are developed using a Lyapunov function candidate that exploits convexity, and are called Zero-Gradient-Sum (ZGS) algorithms as they yield nonlinear networked dynamical systems that evolve invariantly on a zero-gradient-sum manifold and converge asymptotically to the unknown optimizer. We also describe a systematic way to construct ZGS algorithms, show that a subset of them actually converge exponentially, and obtain lower and upper bounds on their convergence rates in terms of the network topologies, problem characteristics, and algorithm parameters, including the algebraic connectivity, Laplacian spectral radius, and function curvatures. The findings of this paper may be regarded as a natural generalization of several well-known algorithms and results for distributed consensus, to distributed convex optimization.
Lu Jie
Tang Choon Yik
No associations
LandOfFree
Zero-Gradient-Sum Algorithms for Distributed Convex Optimization: The Continuous-Time Case 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 Zero-Gradient-Sum Algorithms for Distributed Convex Optimization: The Continuous-Time Case, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Zero-Gradient-Sum Algorithms for Distributed Convex Optimization: The Continuous-Time Case will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-450240