Network synchronization with convexity

From MaRDI portal
Publication:3457101

DOI10.1137/130950811zbMATH Open1327.93222arXiv1412.7011OpenAlexW1935710009MaRDI QIDQ3457101FDOQ3457101


Authors: Alexandre Proutiere, Karl Henrik Johansson, Guodong Shi Edit this on Wikidata


Publication date: 10 December 2015

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Abstract: In this paper, we establish a few new synchronization conditions for complex networks with nonlinear and nonidentical self-dynamics with switching directed communication graphs. In light of the recent works on distributed sub-gradient methods, we impose integral convexity for the nonlinear node self-dynamics in the sense that the self-dynamics of a given node is the gradient of some concave function corresponding to that node. The node couplings are assumed to be linear but with switching directed communication graphs. Several sufficient and/or necessary conditions are established for exact or approximate synchronization over the considered complex networks. These results show when and how nonlinear node self-dynamics may cooperate with the linear diffusive coupling, which eventually leads to network synchronization conditions under relaxed connectivity requirements.


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




Recommendations




Cites Work


Cited In (8)





This page was built for publication: Network synchronization with convexity

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