Bibliographic Details
| Title: |
NETWORK SYNCHRONIZATION WITH CONVEXITY. |
| Authors: |
GUODONG SHI1 guodong.shi@anu.edu.au, PROUTIERE, ALEXANDRE2 alepro@kth.se, JOHANSSON, KARL HENRIK1 kallej@ee.kth.se |
| Source: |
SIAM Journal on Control & Optimization. 2015, Vol. 53 Issue 6, p3562-3583. 22p. |
| Subjects: |
Convex domains, Synchronization, Computer networks, Subgradient methods, Directed graphs, Mathematical models |
| 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 subgradient 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. [ABSTRACT FROM AUTHOR] |
|
Copyright of SIAM Journal on Control & Optimization is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
