Search

This article investigates $H_{\infty }$ synchronization of delayed neural networks under a receding horizon scheme, where two types of interval time-varying delays are considered according to whether the lower bound of the delay derivative is known or not. Note that a receding horizon synchronization law can be regarded as an optimization solution at each timeslot to a minimaxization problem related closely with a certain cost functional. In this article, two cost functionals with some delay-dependent matrices are introduced, respectively, for the two types of time delays. In order to obtain less conservative conditions, a novel inequality on quadratic polynomial functions is established, which includes some existing ones as its special cases. Based on the novel inequality, two sufficient conditions are derived to design the terminal weighting matrices of the cost functionals such that the resulting synchronization error system can be stabilized with a prescribed infinite horizon $H_{\infty }$ performance level. Finally, three numerical examples are used to demonstrate the validity of the proposed results. [ABSTRACT FROM AUTHOR]

This paper is concerned with passivity of a class of delayed neural networks. In order to derive less conservative passivity criteria, two Lyapunov–Krasovskii functionals (LKFs) with delay-dependent matrices are introduced by taking into consideration a second-order Bessel–Legendre inequality. In one LKF, the system state vector is coupled with those vectors inherited from the second-order Bessel–Legendre inequality through delay-dependent matrices, while no such coupling of them exists in the other LKF. These two LKFs are referred to as the coupled LKF and the noncoupled LKF, respectively. A number of delay-dependent passivity criteria are derived by employing a convex approach and a nonconvex approach to deal with the square of the time-varying delay appearing in the derivative of the LKF. Through numerical simulation, it is found that: 1) the coupled LKF is more beneficial than the noncoupled LKF for reducing the conservatism of the obtained passivity criteria and 2) the passivity criteria using the convex approach can deliver larger delay upper bounds than those using the nonconvex approach. [ABSTRACT FROM AUTHOR]

This paper is concerned with the state estimation for neural networks with two additive time-varying delay components. Three cases of these two time-varying delays are fully considered: 1) both delays are differentiable uniformly bounded with delay-derivative bounded by some constants; 2) one delay is continuous uniformly bounded while the other is differentiable uniformly bounded with delay-derivative bounded by certain constants; and 3) both delays are continuous uniformly bounded. First, an extended reciprocally convex inequality is introduced to bound reciprocally convex combinations appearing in the derivative of some Lyapunov–Krasovskii functional. Second, sufficient conditions are derived based on the extended inequality for three cases of time-varying delays, respectively. Third, a linear-matrix-inequality-based approach with two tuning parameters is proposed to design desired Luenberger estimators such that the error system is globally asymptotically stable. This approach is then applied to state estimation on neural networks with a single interval time-varying delay. Finally, two numerical examples are given to illustrate the effectiveness of the proposed method. [ABSTRACT FROM PUBLISHER]