Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs

From MaRDI portal
Publication:2983243

DOI10.1109/TAC.2013.2278132zbMATH Open1360.90257arXiv1204.0304OpenAlexW2164642931MaRDI QIDQ2983243FDOQ2983243


Authors: Bahman Gharesifard, J. Cortés Edit this on Wikidata


Publication date: 16 May 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1204.0304







Cited In (only showing first 100 items - show all)





This page was built for publication: Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2983243)