Distributed Adaptive Optimization with Weight-Balancing

More Info
expand_more

Abstract

This article addresses the continuous-time distributed optimization of a strictly convex summation-separable cost function with possibly nonconvex local functions over strongly connected digraphs. Distributed optimization methods in the literature require convexity of local functions, or balanced weights, or vanishing step sizes, or algebraic information (eigenvalues or eigenvectors) of the Laplacian matrix. The solution proposed here covers both weight-balanced and unbalanced digraphs in a unified way, without any of the aforementioned requirements.

Files

09399286.pdf
(pdf | 2 Mb)
Unknown license

Download not available

Distributed_Adaptive_Optimizat... (pdf)
(pdf | 1.73 Mb)
- Embargo expired in 01-07-2023
Unknown license