Pinning impulsive synchronization of stochastic delayed coupled networks

In this paper, the pinning synchronization problem of stochastic delayed complex network （SDCN） is investigated by using a novel hybrid pinning controller. The proposed hybrid pinning controller is composed of adaptive controller and impulsive controller, where the two controllers are both added to a fraction of nodes in the network. Using the Lyapunov stability theory and the novel hybrid pinning controller, some sufficient conditions are derived for the exponential synchronization of such dynamical networks in mean square. Two numerical simulation examples are provided to verify the effectiveness of the proposed approach. The simulation results show that the proposed control scheme has a fast convergence rate compared with the conventional adaptive pinning method.

Global synchronization of general delayed complex networks with stochastic disturbances

In this paper, global synchronization of general delayed complex networks with stochastic disturbances, which is a zero-mean real scalar Wiener process, is investigated. The networks under consideration are continuous-time networks with time-varying delay. Based on the stochastic Lyapunov stability theory, Ito＇s differential rule and the linear matrix inequality （LMI） optimization technique, several delay-dependent synchronous criteria are established, which guarantee the asymptotical mean-square synchronization of drive networks and response networks with stochastic disturbances. The criteria are expressed in terms of LMI, which can be easily solved using the Matlab LMI Control Toolbox. Finally, two examples show the effectiveness and feasibility of the proposed synchronous conditions.

Synchronization of stochastic complex networks with time-delayed coupling

Noise and time delay are inevitable in real-world networks. In this article, the framework of master stability function is generalized to stochastic complex networks with time-delayed coupling. The focus is on the effects of noise, time delay,and their inner interactions on the network synchronization. It is found that when there exists time-delayed coupling in the network and noise diffuses through all state variables of nodes, appropriately increasing the noise intensity can effectively improve the network synchronizability;otherwise, noise can be either beneficial or harmful. For stochastic networks, large time delays will lead to desynchronization. These findings provide valuable references for designing optimal complex networks in practical applications.

Delay-Dependent H_∞ Synchronization for General Delayed Complex Networks with Stochastic Disturbances

In this paper, the H∞ synchronization is intensively investigated for general delayed complex dynamical networks. The network under consideration contains unknown but bounded nonlinear coupling functions, time-varying delay, external distur- bances, and lt6-type stochastic disturbances, which is a zero-mean real scalar Wiener process. Based on the stochastic Lyapunov stability theory, Ito＇s differential rule, and linear matrix inequality （LMI） optimization technique, some delay-dependent H∞ synchro- nization schemes are established, which guarantee robust stochas- tically mean square asymptotically synchronization for drive net- work and noise-perturbed response network as well as achieving a prescribed stochastic robust H∞ performance level. Finally, de- tailed and satisfactory numerical results have validated the feasi- bility and the correctness of the proposed techniques.

Randomized Primal–Dual Proximal Block Coordinate Updates

In this paper,we propose a randomized primal–dual proximal block coordinate updating framework for a general multi-block convex optimization model with coupled objective function and linear constraints.Assuming mere convexity,we establish its O(1/t)convergence rate in terms of the objective value and feasibility measure.The framework includes several existing algorithms as special cases such as a primal–dual method for bilinear saddle-point problems(PD-S),the proximal Jacobian alternating direction method of multipliers(Prox-JADMM)and a randomized variant of the ADMM for multi-block convex optimization.Our analysis recovers and/or strengthens the convergence properties of several existing algorithms.For example,for PD-S our result leads to the same order of convergence rate without the previously assumed boundedness condition on the constraint sets,and for Prox-JADMM the new result provides convergence rate in terms of the objective value and the feasibility violation.It is well known that the original ADMM may fail to converge when the number of blocks exceeds two.Our result shows that if an appropriate randomization procedure is invoked to select the updating blocks,then a sublinear rate of convergence in expectation can be guaranteed for multi-block ADMM,without assuming any strong convexity.The new approach is also extended to solve problems where only a stochastic approximation of the subgradient of the objective is available,and we establish an O(1/√t)convergence rate of the extended approach for solving stochastic programming.