Network synchronization with convexity
From MaRDI portal
Publication:3457101
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.
Recommendations
- New conditions on synchronization of networks of linearly coupled dynamical systems with non-Lipschitz right-hand sides
- Synchronization in networks of identical linear systems
- Synchronization in networks of nonlinear dynamical systems coupled via a directed graph
- Global synchronization for directed complex networks
- Nonlinear synchronization on connected undirected networks
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3855514 (Why is no real title available?)
- scientific article; zbMATH DE number 3524004 (Why is no real title available?)
- Connection graph stability method for synchronized coupled chaotic systems
- Consensus of Multiagent Systems and Synchronization of Complex Networks: A Unified Viewpoint
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
- Constrained Consensus and Optimization in Multi-Agent Networks
- Cooperative Convex Optimization in Networked Systems: Augmented Lagrangian Algorithms With Directed Gossip Communication
- Cooperative oscillatory behavior of mutually coupled dynamical systems
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Coupling Strength Allocation for Synchronization in Complex Networks Using Spectral Graph Theory
- Discontinuous dynamical systems
- Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed asynchronous deterministic and stochastic gradient optimization algorithms
- Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
- Global target aggregation and state agreement of nonlinear multi-agent systems with switching topologies
- Incremental gradient algorithms with stepsizes bounded away from zero
- Incremental stochastic subgradient algorithms for convex optimization
- Incremental subgradient methods for nondifferentiable optimization
- Information Flow and Cooperative Control of Vehicle Formations
- Network Topology and Communication Data Rate for Consensusability of Discrete-Time Multi-Agent Systems
- Partial synchronization: from symmetry towards stability
- Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
- Reaching an Optimal Consensus: Dynamical Systems That Compute Intersections of Convex Sets
- Robust consensus for continuous-time multiagent dynamics
- Stability of a Class of Linear Switching Systems with Applications to Two Consensus Problems
- Stability of multiagent systems with time-dependent communication links
- Stability theory by Liapunov's direct method
- State Agreement for Continuous‐Time Coupled Nonlinear Systems
- Synchronization and transient stability in power networks and nonuniform Kuramoto oscillators
- Synchronization in an array of linearly coupled dynamical systems
- Synchronization in complex networks of nonlinear dynamical systems
- Synchronization in complex networks of phase oscillators: a survey
- Synchronization in networks of identical linear systems
- The Theory of Max-Min, with Applications
Cited in
(8)- A unifying convex analysis and switching system approach to consensus with undirected communication graphs
- Estimating the region of attraction on a complex dynamical network
- The lower bound of the network connectivity guaranteeing in-phase synchronization
- Stochastic mirror descent for convex optimization with consensus constraints
- Optimal gradient clock synchronization in dynamic networks
- Further on pinning synchronization of dynamical networks with coupling delay
- New conditions for synchronization in dynamical communication networks
- On stochastic mirror descent with interacting particles: convergence properties and variance reduction
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)
