Next Article in Journal
Rewarding Developers by Storing Applications on Non-Fungible Tokens
Previous Article in Journal
A Model in Which Well-Orderings of the Reals First Appear at a Given Projective Level, Part II
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Stability Analysis of Delayed Neural Networks via Composite-Matrix-Based Integral Inequality

1
College of Information Science and Engineering, Northeastern University, Shenyang 110819, China
2
School of Mechanical Engineering and Automation, Northeastern University, Shenyang 110819, China
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(11), 2518; https://doi.org/10.3390/math11112518
Submission received: 31 March 2023 / Revised: 19 May 2023 / Accepted: 23 May 2023 / Published: 30 May 2023
(This article belongs to the Section Computational and Applied Mathematics)

Abstract

:
This paper revisits the problem of stability analyses for neural networks with time-varying delay. A composite-matrix-based integral inequality (CMBII) is presented, which takes the delay derivative into account. In this case, the coupling information can be fully captured in integral inequalities with the delay derivative. Based on a CMBII, a new stability criterion is derived for neural networks with time-varying delay. The effectiveness of this method is verified by a numerical example.

1. Introduction

In the past few decades, neural networks have been successfully applied in many engineering and research fields, such as image processing, pattern recognition, optimization problems, and associative memory, and have received considerable attention [1,2,3,4,5]. In this application, the designed neural networks are required to have stability properties, including asymptotic stability and exponential stability [6,7]. Time delay is a common phenomenon in many control systems [8]. In general, time delays tend to lead to unstable and poorly controlled systems. The dynamic behavior of the equilibrium point has an important effect on the application of neural networks; thus, many researchers focus a lot of time and energy on stability analyses of neural networks with time delays [9,10,11].
The Lyapunov–Krasovskii functional (LKF) method is widely recognized as a highly effective tool for analyzing system stability. At its core, this method involves identifying a positive definite function whose derivative along the system trajectory is negative definite. The crucial aspect of this approach lies in selecting a suitable LKF, as it directly influences the derivation of stability criteria. By carefully choosing an appropriate LKF, researchers can enhance the accuracy and reliability of the stability analysis process. In [12], some stability conditions of delayed neural networks are obtained, in which the constraints on the interconnection matrix of neural system are imposed. The problem of delayed neural networks is investigated, in which the assumption of the symmetry of the connection matrix is removed in [13]. In [14], an exponential stability result which establishes a relation between time delay and parameters of network is proposed. The state estimation problem is studied for neural networks with time-varying delays, in which the interconnection matrix and the activation functions are assumed to be norm-bounded [15]. In [16], an efficient method named the delay-product-type functional (DPTF) method is proposed by introducing delay-amplitude-dependent matrices. For simplicity, denote d ( t ) as the delay amplitude and d ˙ ( t ) as the delay derivative. Take a DPTF V ( t ) = d ( t ) ν 1 T ( t ) P 1 ν 1 ( t ) + ( h d ( t ) ) ν 2 T ( t ) P 2 ν 2 ( t ) as an example, where d ( t ) P 1 > 0 , ( h d ( t ) ) P 2 > 0 are the delay-amplitude-dependent matrices, and ν 1 ( t ) , ν 2 ( t ) are the augmented state-related terms. Noting the derivative of V ( t ) is
V ˙ ( t ) = d ˙ ( t ) ( ν 1 T ( t ) P 1 ν 1 ( t ) ν 2 T ( t ) P 2 ν 2 ( t ) ) + 2 d ( t ) ν 1 T ( t ) P 1 ν ˙ 1 ( t ) + 2 ( h d ( t ) ) ν 2 T ( t ) P 2 ν ˙ 2 ( t ) ,
it can be seen that the coupling information among the augmented state-related terms, delay amplitude and delay derivative can be linked in the final linear matrix inequalities (LMIs). However, the conservatism suffered from incomplete state vectors ν 1 ( t ) and ν 2 ( t ) in the LKF is unavoidable. Thus, coupling information among the delay amplitude, delay derivative and state-related vectors has not been fully captured. On the other hand, many bounding methods such as the Jensen-based integral inequality [17], the Wirtinger-based integral inequality [18], various slack-matrix-based integral inequalities [19,20,21,22,23], Bessel–Legendre inequality (BLI) [24,25], and the Jacobi–Bessel inequality (JBI) [26] have been achieved. Therein, the BLI has the potential to obtain an analytical solution for constant delay systems. However, the inequality has drawbacks in the application to time-varying systems because the estimated boundary depends on the cross convex combination [27,28,29]. In [30], an affine Bessel–Legendre inequality (ABLI) was proposed for systems with a time-varying delay amplitude d ( t ) by introducing some slack matrices. However, the conservatism suffered from incomplete vectors of the LKF is unavoidable in ABLI. Thus, a generalized free matrix-based integral inequality (GFMBII) was proposed in [31], which can supplement the incomplete vectors in the ABLI. Please note that the AFLI in [30] and various integral inequalities based on slack matrices in [19,20,21,22,23] play a key role in reducing conservatism. A review of the matrix structure in ABLIs can be found in [30] and in GFMBIIs in [31]. The delay-amplitude-dependent matrix is mainly concentrated on positive definite terms such as M T R 1 M , and the slack matrix has not yet been fully coupled to the delay amplitude d ( t ) . Thus, introducing delay-amplitude-dependent slack matrices in integral inequalities is worthy of study. Recalling (1), the derivative V ˙ ( t ) contains delay-amplitude- and delay-derivative-dependent terms. However, the delay amplitude and delay derivative are separated. That is to say, the DPTF cannot fully capture the coupling information between the delay amplitude and the delay derivative. Moreover, to the authors’ best knowledge, there is no work considering the delay-derivative-dependent integral inequalities for NNs, which is the motivation behind this current work.
In this paper, we focus on a stability analysis for NNs with a time-varying delay. By introducing delay-amplitude- and delay-derivative-dependent slack matrices, a composite-matrix-based integral inequality (CMBII) is proposed. Based on the CMBII, a stability criterion is proposed for NNs with time-varying delay. The effectiveness of the stability criterion can be demonstrated by illustrating a numerical example.
Notation: In this paper, R n represents the n-dimensional Euclidean space; H e [ X ] represents X + X T ; C o { } represents a set of points; c o l [ X , Y ] represents [ X T , Y T ] T ; diag { } represents a block diagonal matrix; X T represents the transposition of X; and the abbreviations in the present paper are given in Table 1.

2. Problem Formation and Preliminaries

Consider the following generalized neural networks (GNNs) with time-varying delay
x ˙ ( t ) = A x ( t ) + W 0 f ( W 2 x ( t ) ) + W 1 f ( W 2 x ( t d ( t ) )
where x ( t ) = c o l [ x 1 ( t ) , x 2 ( t ) , x 3 ( t ) , x 4 ( t ) , x 5 ( t ) , , x n ( t ) ] R n is the state vector and f ( W 2 x ( t ) ) = c o l [ f 1 ( W 21 x ( t ) ) , f 2 ( W 22 x ( t ) ) , , f n ( W 2 n x ( t ) ) ] is the activation function. A = d i a g { a 1 , a 2 , . . a n } > 0 , and W 0 , W 1 , W 2 are are real constant matrices with appropriate dimensions. d ( t ) is the delay amplitude and d ˙ ( t ) is the delay derivative, which satisfy
0 d ( t ) h , μ d ˙ ( t ) μ
where h and μ are constants. The activation functions f i ( W 2 i x ( t ) ) , i { 1 , 2 , , n } satisfy f i ( 0 ) = 0 and
l i f i ( a ) f i ( b ) a b l i + , a b
where l i and l i + are known constants that may be positive, negative or zero. For convenience, define L = d i a g { l 1 , l 2 , , l n } and L + = d i a g { l 1 + , l 2 + , , l n + } . We can directly obtain the following inequalities from (4), with s, s 1 , s 2 R , U = d i a g { u 1 , u 2 , , u n } > 0 and U + = d i a g { u 1 + , u 2 + , , u n + } > 0 :
λ 1 ( s , U ) 0 , λ 2 ( s 1 , s 2 , U + ) 0
where
λ 1 ( s , U ) = 2 [ f ( W 2 x ( s ) ) L W 2 x ( s ) ] T U × [ L + W 2 x ( s ) f ( W 2 x ( s ) ) ] λ 2 ( s 1 , s 2 , U + ) = 2 [ f ( W 2 x ( s 1 ) ) f ( W 2 x ( s 2 ) ) L W 2 x ( s 1 ) x ( s 2 ) ] T U + [ L + W 2 ( x ( s 1 ) x ( s 2 ) ) f ( W 2 x ( s 1 ) ) + f ( W 2 x ( s 2 ) ) ] .
To keep the representation simple, the following notations are used for S N :
d = d ( t ) , h d = h d , d ¯ ˙ = 1 d ˙ g i ( a , b ) = a b ( s a b a ) i x ( s ) d s v 1 i ( t ) = g i ( t , t d ) , v 2 i ( t ) = g i ( t d , t h ) ϑ ( a , b ) = c o l x ( a ) x ( b ) , i f S = 0 c o l x ( a ) , x ( b ) , 1 h Ω 0 , , 1 h Ω S 1 , i f S > 0 Ω k = t h t L k ( s ) x ( s ) d s L k ( s ) = ( 1 ) k l = 0 k [ ( 1 ) l ( k l ) ( k + l l ) ] s t + h h l π S ( k ) = I I , i f S = 0 I , ( 1 ) k + 1 I , ς S k 0 I , , ς S k S 1 I , i f S > 0 ς S k i = ( 2 i + 1 ) ( 1 ( 1 ) k + i ) , i f i k 0 , i f i k + 1 R ˜ = d i a g { R 1 , 1 3 R 1 , , 1 2 S + 1 R 1 }
R ^ = d i a g { R , 3 R , , ( 2 S + 1 ) R } Γ S = c o l [ π S ( 0 ) , π S ( 1 ) , , π S ( S ) ] ϑ 1 = ϑ ( t d , t ) , ϑ 2 = ϑ ( t h , t d ) f i = f i ( s ) l i s , f i + = l + s f i ( s ) o ( t ) = c o l [ x ( t ) , x ( t d ) , x ( t h ) ] ϱ 0 ( s ) = c o l [ x ˙ ( s ) , x ( s ) , f ( W 2 x ( s ) ) ] ϱ 1 ( s ) = c o l [ s t x ( u ) d u , t d s x ( u ) d u ] ϱ 2 ( s ) = c o l [ s t d x ( u ) d u , t h s x ( u ) d u ] ξ 0 S ( t ) = c o l [ o ( t ) , v 10 ( t ) , v 20 ( t ) , , v 1 S ( t ) , v 2 S ( t ) ] ξ 1 S ( t ) = c o l [ o ( t ) , v 10 ( t ) d , v 11 ( t ) d , , v 1 S ( t ) d ] ξ 2 S ( t ) = c o l [ o ( t ) , v 20 ( t ) d , v 21 ( t ) h d , , v 2 S ( t ) h d ] ξ 3 S ( t , s ) = ϱ ( 0 ) ( s ) , S = 0 ϱ 0 ( s ) , ϱ 1 ( s ) , S 1 ξ 4 S ( t , s ) = ϱ ( 0 ) ( s ) , S = 0 ϱ 0 ( s ) , ϱ 5 ( s ) , S 1 ξ 5 ( t ) = c o l [ f ( W 2 x ( t ) ) , f ( W 1 x ( t d ) ) , f ( W 2 x ( t h ) ) t d t f ( W 2 x ( s ) ) d s , t h t d f ( W 2 x ( s ) ) d s ] ξ 6 ( t ) = c o l [ x ˙ ( t d ) , x ˙ ( t h ) ] ξ 7 i ( t ) = c o l [ v 1 i ( t ) d , v 2 i ( t ) h d ] ξ S ( t ) = c o l [ o ( t ) , ξ 5 ( t ) , ξ 6 ( t ) , ξ 70 ( t ) , ξ 71 ( t ) , , ξ 7 S ( t ) ] e i , N = [ 0 n × ( i 1 ) n , I n × n , 0 n × ( N i ) n ] , i 1 , 2 , , N .
In the previous literature [23,30,31], the information of the delay derivative in the final LMIs is usually introduced by the derivative of LKFs. No integral inequalities are related to the delay derivative for NNs with time-varying delay. In order to fill the gap, a composite slack matrix integral inequality (CMBII) is proposed as follows.
Lemma 1.
For any parameter γ, any symmetric positive definite matrix R, any vector ξ, any continuously differentiable function x : [ h , 0 ] R n , and slack matrices M , N , the following inequality holds:
t h h x ˙ T ( s ) R x ˙ ( s ) d s ( μ γ d ˙ ) μ ξ T d M T R ˜ M + h d N T R ˜ N ξ + μ h ( γ + d ˙ ) d μ h + ( γ + d ˙ ) d 2 μ h 2 H e [ ( ϑ 1 T Γ S T M + ϑ 2 T Γ S T N ) ξ ] ( γ + d ˙ ) μ h 2 h d ϑ 1 T Γ S T R ^ Γ S ϑ 1 + d ϑ 2 T Γ S T R ^ Γ S ϑ 2 .
Proof. 
For convex parameters α , β [ 0 , 1 ] with α + β = 1 , it yields
t h t x ˙ T ( s ) R x ˙ ( s ) d s = α t d t x ˙ T ( s ) R x ˙ ( s ) d s + α t h t d x ˙ T ( s ) R x ˙ ( s ) d s + β t d t x ˙ T ( s ) R x ˙ ( s ) d s + β t h t d x ˙ T ( s ) R x ˙ ( s ) d s .
From the inequalities in [24,31] and the relation α + β = 1 , it yields
t h t x ˙ T ( s ) R x ˙ ( s ) d s α ξ T d M T R ˜ M + h d N T R ˜ N ξ + α H e [ ( ϑ 1 T Γ S T M + ϑ 2 T Γ S T N ) ξ ] β 1 d ϑ 1 T Γ S T R ^ Γ S ϑ 1 + 1 h d ϑ 2 T Γ S T R ^ Γ S ϑ 2 .
Due to d M T R ˜ M + h d N T R ˜ N > 0 , one has
t h t x ˙ T ( s ) R x ˙ ( s ) d s ξ T d M T R ˜ M + h d N T R ˜ N ξ + α H e [ ( ϑ 1 T Γ S T M + ϑ 2 T Γ S T N ) ξ ] β 1 d ϑ 1 T Γ S T R ^ Γ S ϑ 1 + 1 h d ϑ 2 T Γ S T R ^ Γ S ϑ 2 .
Setting
α = μ h ( γ + d ˙ ) d μ h + ( γ + d ˙ ) d 2 μ h 2 , β = d h d ( γ + d ˙ ) μ h 2
it satisfies 0 α 1 , 0 β 1 , α + β = 1 .
By substituting (9) into (7), it yields
t h h x ˙ T ( s ) R x ˙ ( s ) d s μ h ( γ + d ˙ ) d μ h + ( γ + d ˙ ) d 2 μ h 2 × ξ T d M T R ˜ M + h d N T R ˜ N ξ + μ h ( γ + d ˙ ) d μ h + ( γ + d ˙ ) d 2 μ h 2 H e [ ( ϑ 1 T Γ S T M + ϑ 2 T Γ S T N ) ξ ] ( γ + d ˙ ) μ h 2 h d ϑ 1 T Γ S T R ^ Γ S ϑ 1 + d ϑ 2 T Γ S T R ^ Γ S ϑ 2
Due to d M T R ˜ M + h d N T R ˜ N > 0 , 0 d h d h 2 1 and 0 γ + d ˙ μ 1 , one has
μ h ( γ + d ˙ ) d μ h + ( γ + d ˙ ) d 2 μ h 2 μ γ d ˙ μ .
Combining (11) and (9), it yields (6). This completes the proof. □
Remark 1.
A new integral inequality is proposed in Lemma 1 by combining delay-amplitude- and delay-derivative-dependent slack matrices, which can be named CMBII. It should be pointed out that the delay derivative is first introduced in CMBII by the intermediate convex parameters α , β satisfying α + β = 1 , which has not been considered in the previous literature. The other merits can be concluded as follows. (i) Delay-amplitude- and derivative-dependent slack matrices are introduced to link the coupling information among system states, delay amplitude and delay derivative. Thus, compared with Lemma 1, more coupling information can be utilized without additional decision variables. (ii) Parameter γ is introduced to avoid some zero terms. For example, if γ = 0 and d ˙ = 0 , the last term h d ϑ 1 T Γ S T R ˜ Γ S ϑ 1 + d ϑ 2 T Γ S T R ˜ Γ S ϑ 2 will disappear. Similarly, if γ = 0 and d ˙ = μ , the first term d M T R ˜ M + h d N T R ˜ N will disappear. Moreover, it can also increase flexibility.
Remark 2.
In the previous works, the information of the delay derivative is introduced in the final LMIs by the derivative of LKF. It is well known that DPTF is an efficient way to introduce delay information. However, recalling the derivative of the DPTF (1), the delay amplitude and the delay derivative are separated in each term. Moreover, the augmented vectors ν 1 ( t ) and ν 2 ( t ) and their derivatives cannot contain all state-related terms. Due to the two limitations, the coupling information among the delay amplitude, the delay derivative and state-related vectors has not been fully captured. Fortunately, the two limitations can be simultaneously solved in CMBII, which can be concluded as follows. (I) The delay amplitude and delay derivative are coupled in CMBII. (II) Any augmented vector ξ can cover all the state-related terms in LKF and its derivative. In these two cases, CMBII can fully capture system information, which leads to less conservatism.
The main aim of the present paper is to derive a less conservative stability condition of GNNs (2) with time-varying delay. We will apply CMBII to reach this aim as follows.

3. Main Results

In order to make full use of the information of the delay derivative, the following stability criterion for system (2) is established based on the CMBII.
Theorem 1.
For given scalars γ, h and μ, system (2) is asymptotically stable if there exists positive definite symmetric matrices P, Q 1 , Q 2 and R and matrices M and N such that the following inequalities hold
Ω ˜ ( 0 , d ˙ ) ( μ γ d ˙ ) μ h e 8 T L 2 T ( μ γ d ˙ ) μ h N T * Z 0 * * R ^ < 0
Ω ˜ ( h , d ˙ ) ( μ γ d ˙ ) μ h e 7 T L 1 T ( μ γ d ˙ ) μ h M T * Z 0 * * R ^ < 0
Ω ^ ( 0 , d ˙ ) ( μ γ d ˙ ) μ h e 8 T L 2 T ( μ γ d ˙ ) μ h N T * Z 0 * * R ^ < 0
where
Ω ^ ( 0 , d ˙ ) = h 2 a 2 ( d ˙ ) + Ω ˜ ( 0 , d ˙ ) a 2 ( d ˙ ) = γ ¯ 1 T Q 1 γ ¯ 1 d ¯ ˙ γ ¯ 2 T Q 1 γ ¯ 2 + H e [ γ 3 T Q 1 γ ¯ 4 ] + d ¯ ˙ γ ¯ 5 T Q 2 γ ¯ 5 γ ¯ 6 T Q 2 γ ¯ 6 + H e [ γ 7 T Q 2 γ ¯ 8 ] + γ + d ˙ μ h H e [ E 1 S T Γ S T M + E 2 S T Γ S T N + e 7 T L 1 e 7 + e 8 T L 2 e 8 ] Ω ˜ ( d , d ˙ ) = Ω 1 ( d , d ˙ ) + Ω 2 ( d , d ˙ ) + Ω 3 ( d , d ˙ ) + Ω 4 ( d ˙ ) + Ω 5 ( d , d ˙ ) + Ω 6 Ω 1 ( d , d ˙ ) = H e [ Π 1 T ( d ) P 0 S Π 2 ( d ˙ ) ] + d ˙ Π 3 T P 1 S Π 3 + H e [ Π 3 T P 1 S Π 4 ( d , d ˙ ) ] d ˙ Π 5 T P 2 S Π 5 Ω 2 ( d , d ˙ ) = γ 1 T Q 1 γ 1 d ¯ ˙ γ 2 T Q 1 γ 2 + H e [ γ 3 T Q 1 γ 4 ] + d ¯ ˙ γ 5 T Q 2 γ 5 γ 6 T Q 2 γ 6 + H e [ γ 7 T Q 2 γ 8 ] Ω 3 ( d , d ˙ ) = h 2 e a T R e a + μ h ( γ + d ˙ ) d μ + ( γ + d ˙ ) d 2 μ h × H e [ E 1 S T Γ S T M + E 2 S T Γ S T N ) ] ( γ + d ˙ ) μ h h d E 1 S T Γ S T R ^ Γ S E 1 S + d E S 2 T Γ S T R ^ Γ S E 2 S Ω 4 ( d ˙ ) = H e [ ρ 31 T W 2 e a + d ¯ ˙ ρ 32 T W 2 e 9 + ρ 33 T W 2 e 10 ] Ω 5 ( d , d ˙ ) = h 2 e 4 T Z e 4 + μ h ( γ + d ˙ ) d μ + ( γ + d ˙ ) d 2 μ h × H e [ e 7 T L 1 e 7 + e 8 T L 2 e 8 ] ( γ + d ˙ ) μ h ( h d e 7 T Z e 7 + d e 8 T Z e 8 ) + μ h ( γ + d ˙ ) d μ + ( γ + d ˙ ) d 2 μ h × H e [ e 7 T L 1 e 7 + e 8 T L 2 e 8 ] ( γ + d ˙ ) μ h h d e 7 T Z e 7 + d e 8 T Z e 8 . Ω 6 = i = 1 3 H e [ ( e 3 + i L W 2 e i ) T U i ( L + W 2 e i e 3 + i ) ] + i = 1 2 H e [ [ e 3 + i e 4 + i L W 2 ( e i e i + 1 ) ] T U i + × [ L + W 2 ( e i e i + 1 ) e 3 + i + e 4 + i ] ] + H e [ [ e 4 e 6 L W 2 ( e 1 e 3 ) ] T U 3 + × [ L + W 2 ( e 1 e 3 ) e 4 + e 6 ] ]
Π 1 ( d ) = c o l [ e o , e u 0 , e v 0 , , e u S , e v S ] Π 2 ( d ˙ ) = c o l [ e ˙ 0 , e ˙ u 0 , e ˙ v 0 , , e ˙ u S , e ˙ v S ] Π 3 = c o l [ e 0 , e 13 , , e 2 S + 11 ] Π 4 ( d , d ˙ ) = c o l [ d e ˙ 0 , e ˙ u 0 d ˙ e 11 , e ˙ u 1 d ˙ e 13 , , e ˙ u S d ˙ e 2 S + 11 ] Π 5 = c o l [ e a , e 12 , e 14 , , e 2 S + 14 ] Π 6 = c o l [ h d e ˙ 0 , e ˙ v 0 + d ˙ e 12 , e ˙ v 1 + d ˙ e 14 , , e ˙ v S + d ˙ e 2 S + 12 ] γ 1 = c o l [ e a , e 1 , e 4 , 0 , d e 11 ] γ 2 = c o l [ e 9 , e 2 , e 5 , d e 11 , 0 ] γ 3 = c o l [ 0 , 0 , 0 , e 1 , d ¯ ˙ e 2 , 0 ] γ 4 = c o l [ e 1 e 2 , d e 11 , e 7 , d 2 e 13 , d 2 ( e 11 e 13 ) ] γ 5 = c o l [ e 9 , e 2 , e 5 , 0 , h d e 12 ] γ 6 = c o l [ e 10 , e 3 , e 6 , h d e 12 , 0 ] γ 7 = c o l [ 0 , 0 , 0 , d ¯ ˙ e 2 , e 3 ] γ 8 = c o l [ e 2 e 3 , h d e 12 , e 8 , h d 2 e 14 , h d 2 ( e 12 e 14 ) ] γ ¯ 1 = c o l [ 0 , 0 , 0 , 0 , e 11 ] γ ¯ 2 = c o l [ 0 , 0 , 0 , e 11 , 0 ] γ ¯ 4 = c o l [ 0 , 0 , 0 , e 13 , ( e 11 e 13 ) ] γ ¯ 5 = c o l [ 0 , 0 , 0 , 0 , e 12 ] γ ¯ 6 = c o l [ e 10 , 0 , 0 , e 12 , 0 ] γ ¯ 8 = c o l [ 0 , 0 , 0 , e 14 , ( e 12 e 14 ) ] ρ 31 = M 1 ( e 4 L W 2 e 1 ) + M 2 ( L + W 2 e 1 e 4 ) ρ 32 = M 3 ( e 5 L W 2 e 2 ) + M 4 ( L + W 2 e 2 e 5 ) ρ 33 = M 5 ( e 6 L W 2 e 3 ) + M 6 ( L + W 2 e 3 e 6 ) ε S 1 = c o l [ e 1 , e 2 , e 11 , 2 e 13 , ( S + 1 ) e 11 + 2 S ] ε S 2 = c o l [ e 2 , e 3 , e 12 , 2 e 14 , ( S + 1 ) e 12 + 2 S ] e u i = d e 11 + 2 i , e v i = h d e 12 + 2 i e ˙ u i = e 1 d ¯ ˙ e 2 , i = 1 e 1 i d ¯ ˙ e 11 + 2 ( i 1 ) i d ˙ e 11 + 2 i , i 1 e a = A e 1 + W 0 e 4 + W 1 e 5 e 0 = [ e 1 , e 2 , e 2 ] , e ˙ 0 = c o l [ e a , d ¯ ˙ e 9 , e 10 ] e ˙ v i = d ¯ ˙ e 2 e 3 , i = 1 d ¯ ˙ e 2 i e 12 + 2 ( i 1 ) i d ˙ e 12 + 2 i , i 1 e i = e i , 10 + 2 ( S + 1 )
and for the other symbols, see Lemma 1.
Proof. 
To better show the CMBII of the present paper, we construct the following LKF candidate, which is the same as that in [31]
V ( t ) = i = 1 5 V i ( t )
V 1 ( t ) = ξ 0 S T ( t ) P 0 S ξ 0 S ( t ) + d ξ 1 S T ( t ) P 1 S ξ 1 S ( t ) + h d ξ 2 S T ( t ) P 2 S ξ 2 S ( t ) V 2 ( t ) = t d t ξ 3 S T ( t , s ) Q 1 S ξ 3 S ( t , s ) d s + t h t d ξ 4 S T ( t , s ) Q 2 S ξ 4 S ( t , s ) V 3 ( t ) = h t h t s t x ˙ T ( u ) R x ˙ ( u ) d u d s V 4 ( t ) = 2 i = 1 n 0 W 2 i x ( t ) [ m 1 i f i ( s ) + m 2 i f i + ( s ) ] d s + 2 i = 1 n 0 W 2 i x ( t d ) [ m 3 i f i ( s ) + m 4 i f i + ( s ) ] d s + 2 i = 1 n 0 W 2 i x ( t h ) [ m 5 i f i ( s ) + m 6 i f i + ( s ) ] d s V 5 ( t ) = h t h t s t f T ( W 2 x ( u ) ) Z f ( W 2 x ( u ) ) d u d s .
Setting
S i = a b u 1 b u i 1 b d u i d u 2 d u 1 Ω 0 i = a b u 1 b u i 1 b x ( u i ) d u i d u 2 d u 1
it yields
1 S k Ω 0 k = k b a g ( a , b ) k 1 .
Setting a = t d , b = t , we have
ϑ 1 = c o l [ x ( t ) , x ( t d ) , u 0 ( t ) d , 2 u 1 ( t ) d , , ( S + 1 ) u S ( t ) d ] = ε S 1 ξ S ( t ) .
Setting a = t h , b = t d , we have
ϑ 2 = ε S 2 ξ S ( t ) .
The derivative of V ( t ) can be computed by
V ˙ 1 ( t ) = 2 ξ 0 S T ( t ) P 0 S ξ ˙ 0 S ( t ) + d ˙ ξ 1 S T ( t ) P 1 S ξ 1 S ( t ) + 2 d ξ 1 S T ( t ) P 1 S ξ ˙ 1 S ( t ) d ˙ ξ 2 S T ( t ) P 2 S ξ 2 S ( t ) + 2 h d ξ 2 S T ( t ) P 2 S ξ ˙ 2 S ( t ) = ξ S T ( t ) Ω 1 ( d , d ˙ ) ξ S ( t )
V ˙ 2 ( t ) = ξ 3 S T ( t , t ) Q 1 ξ 3 S ( t , t ) d ¯ ˙ ξ 3 S T ( t , t d ) Q 1 ξ 3 S ( t , t d ) + 2 t d t ξ 3 S T ( t , s ) Q 1 d ξ 3 S ( t , s ) d t d s + d ¯ ˙ ξ 4 S T ( t , t d ) Q 2 ξ 4 S ( t , t d ) ξ 4 S T ( t , t h ) Q 2 ξ 4 S ( t , t h ) + 2 t h t d ξ 4 S T ( t , s ) Q 2 d ξ 4 S ( t , s ) d t d s = ξ S T ( t ) Ω 2 ( d , d ˙ ) ξ S ( t )
V ˙ 3 ( t ) = h 2 x ˙ T ( t ) R x ˙ ( t ) h t h t x ˙ T ( s ) R x ˙ ( s ) d s
V ˙ 4 ( t ) = ξ S T ( t ) Ω 4 ( d ˙ ) ξ S ( t )
V ˙ 5 ( t ) = h 2 f T ( W 2 x ( t ) ) Z f ( W 2 x ( t ) ) h t h t f T ( W 2 x ( s ) ) Z f ( W 2 x ( s ) ) d s
where Ω 1 ( d , d ˙ ) , Ω 2 ( d , d ˙ ) and Ω 4 ( d ˙ ) are the same as those in Proposition 1. By differentiating v 1 i ( t ) and v 2 i ( t ) in ξ 1 S ( t ) and ξ 2 S ( t ) , it yields
g ˙ i ( a , b ) = b ˙ x ( b ) a ˙ x ( a ) , i = 0 b ˙ x ( b ) i a ˙ b a g i 1 i ( b ˙ a ˙ ) b a g i , i 1
With the help of Lemma 1, one has
V ˙ 3 ( t ) ξ S T ( t ) [ Ω ˜ 3 ( d , d ˙ ) + Ω 3 ( d , d ˙ ) ] ξ S ( t )
where Ω ˜ 3 ( d , d ˙ ) = ( μ γ d ˙ ) μ h [ d M T R ˜ M + h d N T R ˜ N ] . Applying Lemma 1 with S = 0 , it yields
V ˙ 5 ( t ) ξ S T ( t ) [ Ω 5 ( d , d ˙ ) + Ω ^ 5 ( d , d ˙ ) ] ξ S ( t )
where
Ω ^ 5 ( d , d ˙ ) = ( μ γ d ˙ ) μ h d e 7 T L 1 T Z 1 L 1 e 7 + h d e 8 T L 2 T Z 1 L 2 e 8 .
In addition, it follows from (5) that
λ 1 ( t , U 1 ) 0 λ 1 ( t d , U 2 ) 0 λ 1 ( t h , U 3 ) 0 λ 2 ( t , t d , U 1 + ) 0 λ 2 ( t d , t h , U 2 + ) 0 λ 2 ( t , t h , U 3 + ) 0
further yielding
ξ S T ( t ) Ω 6 ξ S ( t ) 0 .
According to the above-mentioned discussions, we have
V ˙ ( t ) ξ S T ( t ) Ω ¯ ( d , d ˙ ) ξ S ( t )
where Ω ¯ ( d , d ˙ ) = Ω ˜ ( d , d ˙ ) + Ω ^ 3 ( d ) + Ω ^ 5 ( d ) . Define
Ω ¯ ( d , d ˙ ) = d 2 a 2 ( d ˙ ) + d a 1 + a 0
where a 2 ( d ˙ ) can be found in Theorem 1 and a 1 and a 0 are appropriate matrices, respectively. By using Lemma 2 of ref. [8], it yields Ω ¯ ( d , μ 2 ) < 0 , which infers the asymptotical stability of NNs (2). □
Remark 3.
In previous works, such as [9,10,11,21,22,31], thet delay derivative d ˙ is introduced by the derivative of the LKF. However, the delay derivative d ˙ has not been fully captured. Instead of the LKFs, the delay derivative d ˙ is introduced by using CMBII. In this case, the delay derivative d ˙ , the delay amplitude d, the slack matrices M and N and the augmented vector ξ S ( t ) can be simultaneously introduced beside the positive definite matrices. That is, the system information can be efficiently coupled. Moreover, the parameter γ is introduced to avoid zero terms so more coupling information can be utilized. For example, for h ( μ γ d ˙ ) μ in (12), it can be seen that the coupling information between d ˙ and ξ S ( t ) linked by N will disappear if we set γ = 0 and d ˙ = μ . Meanwhile, any parameter γ 0 (due to μ γ d ˙ 0 ) can increase the flexibility of Theorem 1. As a result, Theorem 1 is less conservative.

4. Numerical Example

In this section, we will illustrate the validity of the proposed stability criterion through a numerical example.
Consider a local field neural network of the form (2) with W 2 = I , where the parameters are from [31]
A = d i a g { 1.2769 , 0.6231 , 0.9230 , 0.4480 } W 0 = 0.0373 0.4852 0.3351 0.2336 1.6033 0.5988 0.3224 1.2352 0.3394 0.086 0.3824 0.5785 0.1311 0.3253 0.9534 0.5015 W 1 = 0.8674 1.2405 0.5325 0.022 0.0474 0.9164 0.0360 0.9816 1.8495 2.6117 0.3788 0.8428 2.0413 0.5179 1.1734 0.2775 L = d i a g { 0 , 0 , 0 , 0 } L + = d i a g { 0.1137 , 0.1279 , 0.7994 , 0.2368 } .
It should be pointed out that the cited references in Table 2 means that the maximum allowable upper bounds (MAUBs) are obtained by using the methods in the mentioned references. The MAUBs of the delay amplitude calculated for different results and different μ values are listed in Table 2. It is shown in Table 2 that a larger bound can be obtained by using Theorem 2, which confirms that the conservatism of the results obtained in this paper is lower than the existing results [9,10,11,21,22,31]. Comparing Theorem 1 of this paper with the results of [31], it can be seen that CMBII is effective in reducing conservatism. Moreover, it can further seen that γ can increase the flexibility of the stability condition. It should be pointed out the CMBII can be also applied to the synchronization of time-varying neural networks such as [32,33], which have not considered the delay derivative information.

5. Conclusions

This paper studied the problem of a stability analysis of time-varying delay neural networks. By considering delay derivatives in integral inequalities, composite-matrix-based integral inequalities (CMBIIs) have been proposed. Using a CMBII, a new stability condition for neural networks with time-varying delay has been proposed. Among them, all augmented vectors and their derivatives in LKF are included in the CMBII and fully coupled to the delay amplitude and delay derivative through the slack matrix, resulting in less conservative results. The advantages of the proposed criterion are verified by numerical examples.

Author Contributions

D.Y. conceived the idea; Y.S. conducted the analyses; all authors contributed to writing and revisions. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

No additional data are available.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Sadik, H.; Abdurahman, A.; Tohti, R. Fixed-time synchronization of reaction-diffusion fuzzy neural networks with stochastic perturbations. Mathematics 2023, 11, 1493. [Google Scholar] [CrossRef]
  2. Eidinejad, Z.; Saadati, R.; Repovs, D. Mittag–Leffler stability and attractiveness of pseudo almost periodic solutions for delayed cellular neural networks. J. Funct. Spaces 2022, 2022, 3186963. [Google Scholar] [CrossRef]
  3. Ragusa, M.; Wu, F. Global regularity and stability of solutions to the 2D-doublediffusive convection system with Navier boundary conditions. Adv. Differ. 2021, 26, 281–304. [Google Scholar]
  4. Radojevic, D.; Lazarevic, M. Further results on finite-time stability of neutral nonlinear multi-term fractional order time-varying delay systems. Filomat 2022, 36, 1775–1787. [Google Scholar] [CrossRef]
  5. Wang, J.; Tian, Y.; Hua, L.; Shi, K.; Zhong, S.; Wen, S. New results on finite-time synchronization control of chaotic Memristor-based inertial neural networks with time-varying delays. Mathematics 2023, 11, 684. [Google Scholar] [CrossRef]
  6. Wang, Y.; Zhao, J. Periodic event-triggered sliding mode control for switched uncertain T-S fuzzy systems With a logistic adaptive event-triggering scheme. IEEE Trans. Fuzzy Syst. 2022, 30, 4115–4126. [Google Scholar] [CrossRef]
  7. Wang, Y.; Zhao, J. Neural-network-based event-triggered sliding mode control for networked switched linear systems with the unknown nonlinear disturbance. IEEE Trans. Neural Netw. Learn. Syst. 2021. [Google Scholar] [CrossRef]
  8. Kim, J. Further improvement of Jensen inequality and application to stability of time-delayed systems. Automatica 2016, 64, 121–125. [Google Scholar] [CrossRef]
  9. Kwon, O.-M.; Park, M.-J.; Lee, S.-M.; Park, J.H.; Cha, E.-J. Stability for neural networks with time-varying delays via some new approaches. IEEE Trans. Neural Netw. Learn. Syst. 2013, 24, 181–193. [Google Scholar] [CrossRef]
  10. Yang, B.; Wang, R.; Dimirovski, G.M. Delay-dependent stability for neural networks with time-varying delays via a novel partitioning method. Neurocomputing 2016, 173, 1017–1027. [Google Scholar] [CrossRef]
  11. Zhang, X.M.; Han, Q.L.; Zeng, Z. Hierarchical type stability criteria for delayed neural networks via canonical Bessel-Legendre inequalities. IEEE Trans. Cybern. 2018, 48, 1660–1671. [Google Scholar] [CrossRef]
  12. Arik, S. Stability analysis of delayed neural networks. IEEE Trans. Circuits Syst. I Fundam. Theory Appl. 2000, 47, 1089–1092. [Google Scholar] [CrossRef]
  13. Feng, C.; Plamondon, R. On the stability analysis of delayed neural networks systems. Neural Netw. 2001, 14, 1181–1188. [Google Scholar] [CrossRef]
  14. Arik, S. An analysis of exponential stability of delayed neural networks with time varying delays. Neural Netw. 2004, 17, 1027–1031. [Google Scholar] [CrossRef]
  15. Wang, Z.; Ho, D.W.C.; Liu, X. State estimation for delayed neural networks. IEEE Trans. Neural Netw. 2005, 16, 279–284. [Google Scholar] [CrossRef] [Green Version]
  16. Zhang, C.-K.; He, Y.; Jiang, L.; Wu, M. Notes on stability of time-delay systems: Bounding inequalities and augmented Lyapunov-Krasovskii functionals. IEEE Trans. Autom. Control 2017, 62, 5331–5336. [Google Scholar] [CrossRef] [Green Version]
  17. Gu, K.; Kharitonov, V.L.; Chen, J. Stability of Time-Delay Systems; Birkhäuser: Boston, MA, USA, 2003. [Google Scholar]
  18. Seuret, A.; Gouaisbaut, F. Wirtinger-based integral inequality: Application to time-delay systems. Automatica 2013, 49, 2860–2866. [Google Scholar] [CrossRef] [Green Version]
  19. Zeng, H.B.; He, Y.; Wu, M.; She, J. Free-matrix-based integral inequality for stability analysis of systems with time-varying delay. IEEE Trans. Autom. Control 2015, 60, 2768–2772. [Google Scholar] [CrossRef]
  20. Zeng, H.B.; He, Y.; Mu, M.; She, J. New results on stability ananlysis for systems with discrete distributed delay. Automatica 2015, 60, 189–192. [Google Scholar] [CrossRef]
  21. Zhang, C.-K.; He, Y.; Jiang, L.; Lin, W.-J.; Wu, M. Delay-dependent stability analysis of neural networks with time-varying delay: A generalized free-weighting-matrix approach. Appl. Math. Comput. 2017, 294, 102–120. [Google Scholar] [CrossRef]
  22. Zhang, X.-M.; Lin, W.-J.; Han, Q.-L.; He, Y.; Wu, M. Global asymptotic stability for delayed neural networks using an integral inequality based on nonorthogonal polynomials. IEEE Trans. Neural Netw. Learn. Syst. 2018, 29, 4487–4493. [Google Scholar] [CrossRef]
  23. Chen, J.; Xu, S.; Zhang, B. Single/Multiple integral inequalities with applications to stability analysis of time-delay systems. IEEE Trans. Autom. Control 2017, 62, 3488–3493. [Google Scholar] [CrossRef]
  24. Seuret, A.; Gouaisbaut, F. Hierarchy of LMI conditions for the stability analysis of time-delay systems. Syst. Control Lett. 2015, 81, 1–8. [Google Scholar] [CrossRef] [Green Version]
  25. Seuret, A.; Gouaisbaut, F. Stability of linear systems with time-varying delays using Bessel-Legendre inequalities. IEEE Trans. Autom. Control 2018, 63, 225–232. [Google Scholar] [CrossRef] [Green Version]
  26. Huang, Y.; He, Y.; An, J.; Wu, M. Polynomial-type Lyapunov-Krasovskii functional and Jacobi-Bessel inequality: Further results on stability analysis of time-delay systems. IEEE Trans. Autom. Control 2020, 66, 2905–2912. [Google Scholar] [CrossRef]
  27. Park, P.; Ko, J.W.; Jeong, C. Reciprocally convex approach to stability of systems with time-varying delays. Automatica 2011, 47, 235–238. [Google Scholar] [CrossRef]
  28. Zhang, X.M.; Han, Q.L.; Seuret, A.; Gouaisbaut, F. An improved reciprocally convex inequality and an augmented Lyapunov-Krasovskii functional for stability of linear systems with time-varying delay. Automatica 2017, 84, 221–226. [Google Scholar] [CrossRef] [Green Version]
  29. Zhang, C.; He, Y.; Jiang, L.; Wu, M.; Wang, Q. An extended reciprocally convex matrix inequality for stability analysis of systems with time-varying delay. Automatica 2017, 85, 481–485. [Google Scholar] [CrossRef]
  30. Lee, W.I.; Lee, S.Y.; Park, P.G. Affine Bessel-Legendre inequality: Application to stability analysis for systems with time-varying delays. Automatica 2018, 93, 535–539. [Google Scholar] [CrossRef]
  31. Chen, J.; Park, J.H.; Xu, S. Stability analysis for delayed neural networks with an improved general free-matrix-based integral inequality. IEEE Trans. Neural Netw. Learn. Syst. 2020, 31, 675–684. [Google Scholar] [CrossRef] [PubMed]
  32. Yu, L.; Chen, G.; Jiang, F.; Wang, Z. New criterias of synchronization for discrete-time recurrent neural networks with time-varying delay via event-triggered control. Mathematics 2022, 10, 2816. [Google Scholar] [CrossRef]
  33. Wang, S.; Zhang, S.; Zhang, W.; Zhang, H. Finite-time projective synchronization of Caputo type fractional complex-valued delayed neural networks. Mathematics 2021, 9, 1406. [Google Scholar] [CrossRef]
Table 1. A list of abbreviations.
Table 1. A list of abbreviations.
CMBIIcomposite-matrix-based integral inequality
LKFLyapunov–Krasovskii functional
DPTFdelay-product-type functional
LMIslinear matrix inequalities
BLIBessel–Legendre inequality
JBIJacobi–Bessel inequality
ABLIaffine Bessel–Legendre inequality
GFMBIIgeneralized free-matrix-based integral inequality
GNNsgeneralized neural networks
MAUBmaximum allowable upper bound
Table 2. MAUBs of h for different μ .
Table 2. MAUBs of h for different μ .
μ 0.10.50.9NVs
Th.3, [9]3.93373.53073.2627 42 n 2 + 27 n
Th. 3, [21]4.41673.59863.3755 79 n 2 + 15 n
Th. 1, [10]4.50863.80913.2895 153 n 2 + 22 n
Pr.1 [22]4.53823.93133.4763 60 n 2 + 22 n
Pr. 3, [11] ( N = 3 )4.54684.02533.6246 198 n 2 + 26 n
Th. 1, [31] ( S = 0 )4.49243.76803.2251 44.5 n 2 + 22.5 n
Th 1, [31] ( S = 1 )4.54263.94383.4688 83.5 n 2 + 26.5 n
Th 1, [31] ( S = 2 )4.54703.97493.5052 112.5 n 2 + 28.5 n
Th.1 ( S = 0 , γ = 0 )4.74173.95073.4291 44.5 n 2 + 22.5 n
Th 1 ( S = 1 , γ = 0 )4.81544.10283.5174 83.5 n 2 + 26.5 n
Th 1 ( S = 2 , γ = 0 )4.90494.21453.7101 112.5 n 2 + 28.5 n
Th 1 ( S = 2 , γ = 0.02 )4.92044.34113.8517 112.5 n 2 + 28.5 n
Th 1 ( S = 2 , γ = 0.05 )4.95174.37413.9144 112.5 n 2 + 28.5 n
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Shi, Y.; Ye, D. Stability Analysis of Delayed Neural Networks via Composite-Matrix-Based Integral Inequality. Mathematics 2023, 11, 2518. https://doi.org/10.3390/math11112518

AMA Style

Shi Y, Ye D. Stability Analysis of Delayed Neural Networks via Composite-Matrix-Based Integral Inequality. Mathematics. 2023; 11(11):2518. https://doi.org/10.3390/math11112518

Chicago/Turabian Style

Shi, Yupeng, and Dayong Ye. 2023. "Stability Analysis of Delayed Neural Networks via Composite-Matrix-Based Integral Inequality" Mathematics 11, no. 11: 2518. https://doi.org/10.3390/math11112518

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop