Research Article Novel Global Exponential Stability Criterion for Recurrent Wenguang Luo,

advertisement
Hindawi Publishing Corporation
Abstract and Applied Analysis
Volume 2013, Article ID 540951, 7 pages
http://dx.doi.org/10.1155/2013/540951
Research Article
Novel Global Exponential Stability Criterion for Recurrent
Neural Networks with Time-Varying Delay
Wenguang Luo,1,2 Xiuling Wang,1 Yonghua Liu,1 and Hongli Lan3
1
School of Electrical and Information Engineering, Guangxi University of Science and Technology, Liuzhou 545006, China
Guangxi Key Laboratory of Automobile Components and Vehicle Technology, Guangxi University of Science and Technology,
Liuzhou 545006, China
3
School of Computer Engineering, Guangxi University of Science and Technology, Liuzhou 545006, China
2
Correspondence should be addressed to Wenguang Luo; wenguang.luo@163.com
Received 15 October 2012; Accepted 3 January 2013
Academic Editor: Massimo Furi
Copyright © 2013 Wenguang Luo et al. This is an open access article distributed under the Creative Commons Attribution License,
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
The problem of global exponential stability for recurrent neural networks with time-varying delay is investigated. By dividing the
time delay interval [0, 𝜏(𝑑)] into 𝐾 + 1 dynamical subintervals, a new Lyapunov-Krasovskii functional is introduced; then, a novel
linear-matrix-inequality (LMI-) based delay-dependent exponential stability criterion is derived, which is less conservative than
some previous literatures (Zhang et al., 2005; He et al., 2006; and Wu et al., 2008). An illustrate example is finally provided to show
the effectiveness and the advantage of the proposed result.
1. Introduction
In the past decades, recurrent neural networks (RNNs)
have been extensively investigated because of their applications, such as combinatorial optimization [1, 2], associative
memories [3–5], signal processing [6], image processing
[7], pattern recognition [8, 9], and so forth. Some of these
applications often require that equilibrium points of the
designed networks be stable. Meanwhile, in the hard implementation of RNNs, time delay commonly occurrs due to the
finite switching speed of amplifiers or finite speed of signal
processing, and its existence is always an origin of oscillation,
divergence, and instability in neural networks. Therefore,
the stability of RNNs with time delay has received much
attention, and a large amount of results have been proposed
to ensure the asymptotic or exponential stability of delayed
neural networks [10–21].
So far, there is a main means handling the stability of
delayed neural networks: free-weighting matrix approach
[22–26]. Recently, a novel method was proposed for Hopfield
neural networks with constant delay in [27], which brings
more free-weighting matrices by dividing equally the constant time delay interval [0, 𝜏] into π‘š subintervals. Further
more, by dividing the time delay interval [0, 𝜏(𝑑)] into
𝐾 + 1 dynamical subintervals, Zhang et al. [28] generalize
this method to study global asymptotic stability of RNNs
with time-varying delay. This method mainly utilizes the
information in the time delay interval [0, 𝜏(𝑑)], which brings
more freedom degrees and can reduce conservativeness.
Motivated by above-mentioned discussions, in this paper,
we consider the global exponential stability of RNNs with
time-varying delay. By dividing the time delay interval
[0, 𝜏(𝑑)] into 𝐾 + 1 dynamical subintervals, we construct
a new Lyapunov-Krasovskii functional (LKF) and derive a
novel sufficient condition, which is presented in term of linear
matrix inequality (LMI). The obtained stability result is less
conservative than some existing results [22, 23, 29]. Finally,
2
Abstract and Applied Analysis
an illustrating example is given to verify the effectiveness and
the advantage of the proposed result.
The rest of this paper is organized as follows. In Section 2,
the problem of exponential stability analysis for RNNs with
time-varying delay is formulated. Section 3 presents our main
results. An illustrating example is provided in Section 4. The
conclusion is stated in Section 5.
Throughout this paper, 𝐢 = [𝐢𝑖𝑗 ]𝑛×𝑛 denotes an 𝑛 × π‘› real
matrix. 𝐢𝑇 , ‖𝐢‖, πœ† π‘š (𝐢), and πœ† 𝑀(𝐢) represent the transpose,
the Euclidean norm, the minimum eigenvalue, and the
maximum eigenvalue of matrix 𝐢, respectively. 𝐢 > 0 (𝐢 <
0) denotes that 𝐢 is a positive (negative) definite matrix. 𝐼
denotes an identify matrix with compatible dimensions, and
∗ denotes the symmetric terms in a symmetric matrix.
Assuming system (3) has an equilibrium point 𝑧∗ =
(𝑧1∗ , 𝑧2∗ , . . . , 𝑧𝑛∗ )𝑇 . Then, let π‘₯ = (π‘₯1 (𝑑), π‘₯2 (𝑑), . . . , π‘₯𝑛 (𝑑))𝑇 , and
we define π‘₯𝑖 (𝑑) = 𝑧𝑖 (𝑑) − 𝑧𝑖∗ , system (3) is transformed into the
following form:
π‘₯Μ‡ (𝑑) = − (𝐷 − 𝐴𝐿 0 ) π‘₯ (𝑑) + 𝐴𝑔 (π‘₯ (𝑑))
+ 𝐡𝑔 (π‘₯ (𝑑 − 𝜏 (𝑑))) + 𝐡𝐿 0 π‘₯ (𝑑 − 𝜏 (𝑑)) ,
where 𝑔𝑖 (π‘₯𝑖 (𝑑)) = 𝑔𝑖 (π‘₯𝑖 (𝑑) + 𝑧𝑖∗ ) − 𝑔𝑖 (𝑧𝑖∗ ) with 𝑔𝑖 (0) =
0, 𝑔𝑖 (π‘₯𝑖 (𝑑 − 𝜏(𝑑))) = 𝑔𝑖 (π‘₯𝑖 (𝑑 − 𝜏(𝑑)) + 𝑧𝑖∗ ) − 𝑔𝑖 (𝑧𝑖∗ ).
In the derivation of the main results, we need the
following lemmas and definitions.
Definition 1 (global exponential stability). System (5) is said
to be globally exponentially stable with convergence rate π‘˜, if
there exist constants π‘˜ > 0 and 𝑀 ≥ 1, such that
2. Problem Formulation
β€–π‘₯ (𝑑)β€– ≤ π‘€πœ™π‘’−π‘˜π‘‘ ,
Consider the following RNNs with time-varying delay:
𝑧̇ (𝑑) = −𝐷𝑧 (𝑑) + 𝐴𝑓 (𝑧 (𝑑)) + 𝐡𝑓 (𝑧 (𝑑 − 𝜏 (𝑑))) + 𝐽,
𝑧 (𝑑) = πœ“ (𝑑)
(1)
∀𝑑 ∈ [−𝜏, 0] ,
where 𝑧(⋅) = [𝑧1 (⋅), 𝑧2 (⋅), . . . , 𝑧𝑛 (⋅)]𝑇 is the state vector,
𝑓(𝑧(⋅)) = [𝑓1 (𝑧1 (⋅)), 𝑓2 (𝑧2 (⋅)), . . . , 𝑓𝑛 (𝑧𝑛 (⋅))]𝑇 denotes the
neuron activation function, and 𝐽 is a bias value vector. 𝐷 =
diag(𝑑𝑖 ) is diagonal matrix with 𝑑𝑖 > 0, 𝑖 = 1, 2, . . . , 𝑛. 𝐴
and 𝐡 are connection weight matrix and the delay connection
weight matrix, respectively. The initial condition πœ“(𝑑) is a
continuous and differentiable vector-valued function, where
𝑑 ∈ [−𝜏, 0]. The time delay 𝜏(𝑑) is a differentiable function that
Μ‡ ≤ πœ‡, where 𝜏 > 0 and πœ‡ ≥ 0.
satisfies: 0 ≤ 𝜏(𝑑) ≤ 𝜏, 𝜏(𝑑)
To obtain the proposal result, we assume that each 𝑓𝑖 is
bounded and satisfies
𝑙𝑖− ≤
𝑓𝑖 (𝑒) − 𝑓𝑖 (𝑣)
≤ 𝑙𝑖+ ,
𝑒−𝑣
(5)
(2)
where ∀𝑒, 𝑣 ∈ 𝑅, 𝑒 =ΜΈ 𝑣. 𝑙𝑖− and 𝑙𝑖+ are some constants, 𝑖 =
1, 2, . . . , 𝑛.
Let 𝑔𝑖 (𝑧𝑖 (𝑑)) = 𝑓𝑖 (𝑧𝑖 (𝑑)) − 𝑙𝑖− 𝑧𝑖 (𝑑), 𝑙𝑖 = 𝑙𝑖+ − 𝑙𝑖− , system (1) is
equivalent to the following form:
𝑧̇ (𝑑) = − (𝐷 − 𝐴𝐿 0 ) 𝑧 (𝑑) + 𝐴𝑔 (𝑧 (𝑑)) + 𝐡𝑔 (𝑧 (𝑑 − 𝜏 (𝑑)))
+ 𝐡𝐿 0 𝑧 (𝑑 − 𝜏 (𝑑)) + 𝐽,
(3)
∀𝑑 ≥ 0,
(6)
where πœ™ = sup−𝜏≤πœƒ≤0 β€–π‘₯(πœƒ)β€–.
Lemma 2. Let π‘₯(𝑑) ∈ 𝑅𝑛 be a vector-valued function with the
first-order continuous-derivative entries. Then, the following
integral inequality holds for matrix 𝑋 = 𝑋𝑇 > 0 and any
matrices 𝑀1 , 𝑀2 , and two scalar functions β„Ž1 (𝑑) and β„Ž2 (𝑑),
where β„Ž2 (𝑑) ≥ β„Ž1 (𝑑) ≥ 0
−∫
𝑑−β„Ž1 (𝑑)
𝑑−β„Ž2 (𝑑)
π‘₯̇𝑇 (𝑠) 𝑋π‘₯Μ‡ (𝑠) 𝑑𝑠
≤ πœπ‘‡ (𝑑) [
𝑀1𝑇 + 𝑀1 −𝑀1𝑇 + 𝑀2
] 𝜁 (𝑑)
∗
−𝑀2𝑇 − 𝑀2
(7)
+ (β„Ž1 (𝑑) − β„Ž2 (𝑑)) πœπ‘‡ (𝑑) 𝐻𝑇 𝑅−1 𝐻𝜁 (𝑑) ,
where 𝐻
=
[𝑀1 , 𝑀2 ]
∈
𝑇
𝑇
𝑇
[π‘₯ (𝑑 − β„Ž1 (𝑑)) π‘₯ (𝑑 − β„Ž2 (𝑑))] .
𝑅𝑛×2𝑛 and 𝜁(𝑑)
=
Proof. This proof can be completed in a manner similar to
[30].
Lemma 3 (see [31]). For any two vectors π‘Ž, 𝑏 ∈ 𝑅𝑛 , any matrix
A, any positive definite symmetric matrix 𝐡 with the same
dimensions, and any two positive constants m, n, the following
inequality holds:
−π‘šπ‘Žπ‘‡ π΅π‘Ž + 2π‘›π‘Žπ‘‡ 𝐴𝑏 ≤ 𝑛2 𝑏𝑇 𝐴𝑇 (π‘šπ΅)−1 𝐴𝑏.
(8)
where 𝐿 0 = diag(𝑙1− , 𝑙2− , . . . , 𝑙𝑛− ), 𝐿 1 = diag(𝑙1+ , 𝑙2+ , . . . , 𝑙𝑛+ ), 𝐿 =
diag(𝑙1 , 𝑙2 , . . . , 𝑙𝑛 ) = 𝐿 1 − 𝐿 0 .
Noting assumption (2), we have
𝑔 (𝑒) − 𝑔𝑖 (𝑣)
≤ 𝑙𝑖
0≤ 𝑖
𝑒−𝑣
∀𝑒, 𝑣 ∈ 𝑅, 𝑒 =ΜΈ 𝑣, 𝑙𝑖 = 𝑙𝑖+ − 𝑙𝑖− (𝑖 = 1, 2, . . . , 𝑛) .
3. Main Results
(4)
In this section, we will consider the delay interval [0, 𝜏(𝑑)],
which is divided into 𝐾 + 1 dynamical subintervals, namely,
[0, 𝜌1 𝜏(𝑑)], . . . , [𝜌𝐾 𝜏(𝑑), 𝜏(𝑑)], where 𝜌1 < ⋅ ⋅ ⋅ < 𝜌𝐾 . This is to
Abstract and Applied Analysis
3
say, there is a parameter sequence (𝜌1 , . . . , 𝜌𝐾 ), which satisfies
the following conditions:
0 < 𝜌1 𝜏 (𝑑) < 𝜌2 𝜏 (𝑑) < ⋅ ⋅ ⋅ < 𝜌𝐾 𝜏 (𝑑) < 𝜏 (𝑑) ,
0 ≤ πœŒπ‘– πœΜ‡ (𝑑) ≤ πœŒπ‘– πœ‡,
(9)
where πœŒπ‘– ∈ (0, 1), 𝑖 = 1, 2, . . . , 𝐾, 𝐾 is positive integer.
Utilizing the useful information of 𝐾+1 dynamical subintervals, a novel LKF is constructed, and then a newly LMIbased delay-dependent sufficient condition can be proposed
to guarantee the global exponential stability of RNNs with
time-varying delay.
Theorem 4. The equilibrium point of system (5) with πœ‡ < 1
is globally exponentially stable with convergence rate π‘˜ > 0,
if there exists parameter πœŒπ‘– satisfying 0 < 𝜌1 < ⋅ ⋅ ⋅ < 𝜌𝐾 <
1, some positive definite symmetric matrices 𝑃, 𝑅1 , 𝑅2 , 𝑅3 ,
𝑄𝑖 , 𝑍, some positive definite diagonal matrices Λ, 𝑋1 , 𝑋2 , π‘Œ1
and π‘Œ2 , and any matrices 𝑀𝑗 , where 𝑖 = 1, 2, . . . , 𝐾, 𝑗 =
1, 2, . . . , 2𝐾 + 4, and 𝐾 is a positive integer, such that the
following LMI has feasible solution:
0
0
0
Σ π‘Š0
]
[
]
[ −𝑍
[∗
π‘Š1
0
0 ]
]
[
]
[
𝜌1
]
[
−𝑍
[∗ ∗
⋅⋅⋅
0 ]
] < 0,
[
]
[
𝜌2 − 𝜌1
[∗ ∗
∗
⋅ ⋅ ⋅ π‘ŠπΎ ]
]
[
]
[
]
[
[
−𝑍 ]
∗ ∗
∗
∗
1 − 𝜌𝐾 ]
[
where π‘Šπ‘– = πœπ‘’−π‘˜πœ 𝐻𝑖𝑇 , 𝐻𝑖 = [𝑀2𝑖+1 𝑀2𝑖+2 ] ∈ 𝑅𝑛×2𝑛 , 𝑖 =
0, 1, 2, . . . , 𝐾.
0
0
0
Σ1,𝐾+2
0
Σ1,𝐾+4
Σ1,𝐾+5
Σ1,1 Σ1,2 0
∗ Σ2,2 Σ2,3 0
0
0
0
0
0
0 ]
]
0
0
0
0
0 ]
∗
∗ Σ3,3 Σ3,4 0
]
∗
∗
∗ ⋅⋅⋅
0
0
0
0
0
0 ]
]
0
0
0
0 ]
∗
∗
∗
∗ Σ𝐾,𝐾 Σ𝐾,𝐾+1
,
0
0
0 ]
∗
∗
∗
∗
∗ Σ𝐾+1,𝐾+1 Σ𝐾+1,𝐾+2
]
]
∗
∗
∗
∗
∗
∗
Σ𝐾+2,𝐾+2 Σ𝐾+2,𝐾+3 Σ𝐾+2,𝐾+4 Σ𝐾+2,𝐾+5 ]
∗
∗
∗
∗
∗
∗
∗
Σ𝐾+3,𝐾+3
0
0 ]
]
∗
∗
∗
∗
∗
∗
∗
∗
Σ𝐾+4,𝐾+4 Σ𝐾+4,𝐾+5 ]
∗
∗
∗
∗
∗
∗
∗
∗
Σ𝐾+5,𝐾+5 ]
[∗
[
[
[
[
[
[
[
Σ=[
[
[
[
[
[
[
𝑇
Σ1,1 = 2π‘˜π‘ƒ − 𝑃 (𝐷 − 𝐴𝐿 0 ) − (𝐷 − 𝐴𝐿 0 ) 𝑃
𝑇
+ 𝑅1 + 𝑅3 + 𝜏2 (𝐷 − 𝐴𝐿 0 ) 𝑍 (𝐷 − 𝐴𝐿 0 )
𝐾
−2π‘˜πœ
+ ∑ 𝑄𝑖 + 𝐿𝑋1 𝐿 + πœπ‘’
𝑖=1
(𝑀1𝑇
+ 𝑀1 ) ,
Σ1,2 = πœπ‘’−2π‘˜πœ (−𝑀1𝑇 + 𝑀2 ) ,
Σ1,𝐾+2 = 𝑃𝐡𝐿 0 − 𝜏2 (𝐷 − 𝐴𝐿 0 ) 𝑍𝐡𝐿 0 ,
𝑇
Σ1,𝐾+4 = 𝑃𝐴 + 2π‘˜Λ − (𝐷 − 𝐴𝐿 0 ) Λ
𝑇
2
− 𝜏 (𝐷 − 𝐴𝐿 0 ) 𝑍𝐴 + 𝐿𝑋2 ,
2
𝑇
Σ1,𝐾+5 = 𝑃𝐡 − 𝜏 (𝐷 − 𝐴𝐿 0 ) 𝑍𝐡,
Σ2,2 = −𝑒−2π‘˜πœŒ1 𝜏 𝑄1 (1 − 𝜌1 πœ‡) + πœπ‘’−2π‘˜πœ (−𝑀2𝑇 − 𝑀2 )
+ πœπ‘’−2π‘˜πœ (𝑀3𝑇 + 𝑀3 ) ,
Σ3,4 = πœπ‘’−2π‘˜πœ (−𝑀5𝑇 + 𝑀6 ) , . . . ,
Σ𝐾+1,𝐾+1 = −𝑒−2π‘˜πœŒπΎ 𝜏 𝑄𝐾 (1 − 𝜌𝐾 πœ‡)
𝑇
− 𝑀2𝐾 )
+ πœπ‘’−2π‘˜πœ (−𝑀2𝐾
𝑇
+ 𝑀2𝐾+1 ) ,
+ πœπ‘’−2π‘˜πœ (𝑀2𝐾+1
𝑇
Σ𝐾+1,𝐾+2 = πœπ‘’−2π‘˜πœ (−𝑀2𝐾+1
+ 𝑀2𝐾+2 ) ,
Σ𝐾+2,𝐾+2 = −𝑒−2π‘˜πœ 𝑅1 (1 − πœ‡)
+ 𝜏2 𝐿 0 𝐡𝑇 𝑍𝐡𝐿 0 + πΏπ‘Œ1 𝐿
𝑇
− 𝑀2𝐾+2 )
+ πœπ‘’−2π‘˜πœ (−𝑀2𝐾+2
𝑇
+ 𝑀2𝐾+3 )
+ πœπ‘’−2π‘˜πœ (𝑀2𝐾+3
Σ2,3 = πœπ‘’−2π‘˜πœ (−𝑀3𝑇 + 𝑀4 ) ,
𝑇
+ 𝑀2𝐾+4 ) ,
Σ𝐾+2,𝐾+3 = πœπ‘’−2π‘˜πœ (−𝑀2𝐾+3
Σ3,3 = −𝑒−2π‘˜πœŒ2 𝜏 𝑄2 (1 − 𝜌2 πœ‡) + πœπ‘’−2π‘˜πœ (−𝑀4𝑇 − 𝑀4 )
Σ𝐾+2,𝐾+4 = 𝐿 0 𝐡𝑇 Λ + 𝜏2 𝐿 0 𝐡𝑇 𝑍𝐴,
+ πœπ‘’−2π‘˜πœ (𝑀5𝑇 + 𝑀5 ) ,
(10)
Σ𝐾+2,𝐾+5 = 𝜏2 𝐿 0 𝐡𝑇 𝑍𝐡 + πΏπ‘Œ2 ,
(11)
4
Abstract and Applied Analysis
Let the parameters 𝜌0 = 0, 𝜌𝐾+1 = 1; calculating the time
derivatives 𝑉𝑖 (𝑖 = 1, 2, 3, 4, 5) along the trajectories of system
(5) yields
𝑇
Σ𝐾+3,𝐾+3 = 𝑒−2π‘˜πœ 𝑅3 + πœπ‘’−2π‘˜πœ (−𝑀2𝐾+4
− 𝑀2𝐾+4 ) ,
Σ𝐾+4,𝐾+4 = Λ𝐴 + 𝐴𝑇 Λ + 𝑅2
𝑉1Μ‡ (π‘₯ (𝑑)) = 2π‘˜π‘’2π‘˜π‘‘ π‘₯𝑇 (𝑑) 𝑃π‘₯ (𝑑) + 2𝑒2π‘˜π‘‘ π‘₯𝑇 (𝑑) 𝑃π‘₯Μ‡ (𝑑) ,
+ 𝜏2 𝐴𝑇 𝑍𝐴 − 𝑋1 − 2𝑋2 ,
2
𝑛
𝑉2Μ‡ (π‘₯ (𝑑)) = 4π‘˜π‘’2π‘˜π‘‘ ∑ πœ† 𝑖 ∫
𝑇
Σ𝐾+4,𝐾+5 = Λ𝐡 + 𝜏 𝐴 𝑍𝐡,
𝑖=1
π‘₯𝑖 (𝑑)
0
𝑔𝑖 (𝑠) 𝑑𝑠
+ 2𝑒2π‘˜π‘‘ 𝑔𝑇 (π‘₯ (𝑑)) Λπ‘₯Μ‡ (𝑑) ,
Σ𝐾+2,𝐾+5 = −𝑒−2π‘˜πœ 𝑅2 (1 − πœ‡)
𝑉3Μ‡ (π‘₯ (𝑑)) = 𝑒2π‘˜π‘‘ [π‘₯𝑇 (𝑑) 𝑅1 π‘₯ (𝑑)
+ 𝜏2 𝐡𝑇 𝑍𝐡 − π‘Œ1 − 2π‘Œ2 ,
𝐿 0 = diag (𝑙𝑖− ) ,
− 𝑒−2π‘˜πœ(𝑑) π‘₯𝑇 (𝑑 − 𝜏 (𝑑)) 𝑅1 π‘₯ (𝑑 − 𝜏 (𝑑))
𝐿 1 = diag (𝑙𝑖+ ) ,
× (1 − πœΜ‡ (𝑑))
𝐿 0 = diag (𝑙𝑖 ) ,
+ 𝑔𝑇 (π‘₯ (𝑑)) 𝑅2 𝑔 (π‘₯ (𝑑))
𝐷 = diag (𝑑𝑖 ) ,
− 𝑒−2π‘˜πœ(𝑑) 𝑔𝑇 (π‘₯ (𝑑 − 𝜏 (𝑑))) 𝑅2 𝑔 (π‘₯ (𝑑 − 𝜏 (𝑑)))
𝐴 = [π‘Žπ‘–π‘— ]𝑛×𝑛 ,
× (1 − πœΜ‡ (𝑑)) + π‘₯𝑇 (𝑑) 𝑅3 π‘₯ (𝑑)
𝐡 = [𝑏𝑖𝑗 ]𝑛×𝑛 .
−𝑒−2π‘˜πœ 𝑔𝑇 (π‘₯ (𝑑 − 𝜏)) 𝑅3 𝑔 (π‘₯ (𝑑 − 𝜏))] ,
(12)
Proof. Construct the following Lyapunov-Krasovskii functional candidate:
𝑉 (π‘₯ (𝑑)) = 𝑉1 (π‘₯ (𝑑)) + 𝑉2 (π‘₯ (𝑑)) + 𝑉3 (π‘₯ (𝑑))
+ 𝑉4 (π‘₯ (𝑑)) + 𝑉5 (π‘₯ (𝑑)) ,
(13)
𝐾
𝑉4Μ‡ (π‘₯ (𝑑)) = ∑ 𝑒2π‘˜π‘‘ [π‘₯𝑇 (𝑑) 𝑄𝑖 π‘₯ (𝑑) − 𝑒−2π‘˜πœŒπ‘– 𝜏(𝑑) π‘₯𝑇 (𝑑 − πœŒπ‘– 𝜏 (𝑑))
𝑖=1
×𝑄𝑖 π‘₯ (𝑑 − πœŒπ‘– 𝜏 (𝑑)) (1 − πœŒπ‘– πœΜ‡ (𝑑)) ] ,
𝑑
𝑉5Μ‡ (π‘₯ (𝑑)) = 𝜏2 𝑒2π‘˜π‘‘ π‘₯̇𝑇 (𝑑) 𝑍π‘₯Μ‡ (𝑑) − 𝜏 ∫
𝑑−𝜏
𝑒2π‘˜π‘  π‘₯̇𝑇 (𝑠) 𝑍π‘₯Μ‡ (𝑠) 𝑑𝑠.
(15)
where
It is clear that the following inequality is true:
𝑉1 (π‘₯ (𝑑)) = 𝑒2π‘˜π‘‘ π‘₯𝑇 (𝑑) 𝑃π‘₯ (𝑑) ,
𝑛
𝑉2 (π‘₯ (𝑑)) = 2𝑒2π‘˜π‘‘ ∑ πœ† 𝑖 ∫
0
𝑖=1
𝑑
𝑉3 (π‘₯ (𝑑)) = ∫
𝑑−𝜏(𝑑)
+∫
𝑑
𝑑
𝑑−𝜏
𝐾
𝑉4 (π‘₯ (𝑑)) = ∑ ∫
𝑔𝑖 (𝑠) 𝑑𝑠,
+𝐡𝑔 (π‘₯ (𝑑 − 𝜏 (𝑑))) + 𝐡π‘₯ (𝑑 − 𝜏 (𝑑))]
𝑇
× π‘ [− (𝐷 − 𝐴𝐿 0 ) π‘₯ (𝑑) + 𝐴𝑔 (π‘₯ (𝑑))
(16)
+𝐡𝑔 (π‘₯ (𝑑 − 𝜏 (𝑑))) + 𝐡π‘₯ (𝑑 − 𝜏 (𝑑))] ,
𝑒2π‘˜π‘  𝑔𝑇 (𝑠) 𝑅2 𝑔 (𝑠) 𝑑𝑠
(14)
𝑒2π‘˜π‘  π‘₯𝑇 (𝑠) 𝑅3 π‘₯ (𝑠) 𝑑𝑠,
𝑑
𝑖=1 𝑑−πœŒπ‘– 𝜏(𝑑)
0
π‘₯̇𝑇 (𝑑) 𝑍π‘₯Μ‡ (𝑑) ≤ [− (𝐷 − 𝐴𝐿 0 ) π‘₯ (𝑑) + 𝐴𝑔 (π‘₯ (𝑑))
𝑒2π‘˜π‘  π‘₯𝑇 (𝑠) 𝑅1 π‘₯ (𝑠) 𝑑𝑠
𝑑−𝜏(𝑑)
+∫
π‘₯𝑖 (𝑑)
𝑉5 (π‘₯ (𝑑)) = 𝜏 ∫ ∫
𝑑
−𝜏 𝑑+πœƒ
𝑒2π‘˜π‘  π‘₯𝑇 (𝑠) 𝑄𝑖 π‘₯ (𝑠) 𝑑𝑠,
2π‘˜π‘  𝑇
𝑒
π‘₯Μ‡ (𝑠) 𝑍π‘₯Μ‡ (𝑠) 𝑑𝑠,
where 𝑃 = 𝑃𝑇 > 0, Λ = diag(πœ† 𝑖 ) > 0, 𝑅1 = 𝑅1𝑇 > 0, 𝑅2 =
𝑅2𝑇 > 0, 𝑅3 = 𝑅3𝑇 > 0, 𝑄𝑖 = 𝑄𝑖𝑇 > 0, 𝑍 = 𝑍𝑇 > 0, and
𝑖 = 0, 1, 2, . . . , 𝐾.
According to (4), for some diagonal matrices 𝑋1 > 0, 𝑋2 >
0, π‘Œ1 > 0, π‘Œ2 > 0, we have
𝑔𝑇 (π‘₯ (𝑑)) 𝑋1 𝑔 (π‘₯ (𝑑)) ≤ π‘₯𝑇 (𝑑) 𝐿𝑋1 𝐿π‘₯ (𝑑) ,
𝑔𝑇 (π‘₯ (𝑑)) 𝑋2 𝑔 (π‘₯ (𝑑)) ≤ π‘₯𝑇 (𝑑) 𝐿𝑋1 𝑔 (π‘₯ (𝑑)) ,
𝑔𝑇 (π‘₯ (𝑑 − 𝜏 (𝑑))) π‘Œ1 𝑔 (π‘₯ (𝑑 − 𝜏 (𝑑)))
≤ π‘₯𝑇 (𝑑 − 𝜏 (𝑑)) πΏπ‘Œ1 𝐿π‘₯ (𝑑 − 𝜏 (𝑑)) ,
𝑔𝑇 (π‘₯ (𝑑 − 𝜏 (𝑑))) π‘Œ2 𝑔 (π‘₯ (𝑑 − 𝜏 (𝑑)))
≤ π‘₯𝑇 (𝑑 − 𝜏 (𝑑)) πΏπ‘Œ2 𝑔 (π‘₯ (𝑑 − 𝜏 (𝑑))) .
(17)
Abstract and Applied Analysis
5
Using Lemma 2, we have
𝑑−πœŒπ‘– 𝜏(𝑑)
−∫
𝑑−πœŒπ‘–+1 𝜏(𝑑)
≤
On the other hand, the following inequality holds:
π‘₯̇𝑇 (𝑠) π‘₯Μ‡ (𝑠) ≤ [ − (𝐷 − 𝐴𝐿 0 ) π‘₯ (𝑠) + 𝐴𝑔 (π‘₯ (𝑠))
π‘₯̇𝑇 (𝑠) 𝑍π‘₯Μ‡ (𝑠) 𝑑𝑠
𝑀𝑇
πœπ‘–π‘‡ (𝑑) [ 2𝑖+1
+
∗
𝑇
𝑀2𝑖+1 −𝑀2𝑖+1
𝑇
−𝑀2𝑖+2
+𝐡𝑔 (π‘₯ (𝑑 − 𝜏 (𝑠))) + 𝐡π‘₯ (𝑑 − 𝜏 (𝑠))]
+ 𝑀2𝑖+2
] 𝜁 (𝑑)
− 𝑀2𝑖+2 𝑖
× [ − (𝐷 − 𝐴𝐿 0 ) π‘₯ (𝑠) + 𝐴𝑔 (π‘₯ (𝑠))
𝑑−𝜏(𝑑)
𝑑−𝜏
Combining Lemma 3, we have
π‘₯̇𝑇 (𝑠) 𝑍π‘₯Μ‡ (𝑠) 𝑑𝑠
𝑇
≤ 𝜁𝐾+1
(𝑑) [
where 𝐻𝑖
𝑇
𝑇
π‘₯̇𝑇 (𝑠) π‘₯Μ‡ (𝑠) ≤ 4 [πœ† 𝑀 ((𝐷 − 𝐴𝐿 0 ) (𝐷 − 𝐴𝐿 0 ))
𝑇
𝑇
𝑀2𝐾+3
+ 𝑀2𝐾+3 −𝑀2𝐾+3
+ 𝑀2𝐾+4
] 𝜁 (𝑑) ,
𝑇
∗
−𝑀2𝐾+4
− 𝑀2𝐾+4 𝐾+1
(18)
=
𝑇
[𝑀2𝑖+1 𝑀2𝑖+2 ]
𝑇
𝑅𝑛×2𝑛 , πœπ‘– (𝑑)
∈
𝑉̇ (π‘₯ (𝑑)) ≤ 𝑒2π‘˜π‘‘ Ω,
+ πœ† 𝑀 (𝐿2 ) πœ† 𝑀 (𝐴𝑇 𝐴)
σ΅„© σ΅„©
+πœ† 𝑀 (𝐿2 ) πœ† 𝑀 (𝐡𝑇 𝐡)+πœ† 𝑀 (𝐿 0 𝐡𝑇 𝐡𝐿 0 ) ] σ΅„©σ΅„©σ΅„©πœ™σ΅„©σ΅„©σ΅„© .
(23)
=
[π‘₯ (𝑑 − πœŒπ‘– 𝜏(𝑑)) π‘₯ (𝑑 − πœŒπ‘–+1 𝜏(𝑑))] ,
𝜁𝐾+1 (𝑑)
𝑇
[π‘₯𝑇 (𝑑 − 𝜏(𝑑)) π‘₯𝑇 (𝑑 − 𝜏)] , 𝑖 = 0, 1, . . . , 𝐾.
From (15)–(17), and using (18), we finally get
=
Thus,
σ΅„© σ΅„©2
σ΅„© σ΅„©2
𝑉 (π‘₯ (0)) = πœ† 𝑀 (𝑃) σ΅„©σ΅„©σ΅„©πœ™σ΅„©σ΅„©σ΅„© + (πœ† 𝑀 (𝐿2 ) + πœ† 𝑀 (Λ𝑇 Λ)) σ΅„©σ΅„©σ΅„©πœ™σ΅„©σ΅„©σ΅„©
σ΅„© σ΅„©2
σ΅„© σ΅„©2
+ πœ† 𝑀 (𝑅1 ) πœσ΅„©σ΅„©σ΅„©πœ™σ΅„©σ΅„©σ΅„© + πœ† 𝑀 (𝑅2 ) πœ† 𝑀 (𝐿2 ) πœσ΅„©σ΅„©σ΅„©πœ™σ΅„©σ΅„©σ΅„©
(19)
where Ω = πœπ‘‡ (𝑑)Σ𝜁(𝑑) + Ω0 + Ω1 + ⋅ ⋅ ⋅ + Ω𝐾 , Σ is defined in
(11).
𝐾
σ΅„© σ΅„©2
σ΅„© σ΅„©2
+ πœ† 𝑀 (𝑅3 ) πœσ΅„©σ΅„©σ΅„©πœ™σ΅„©σ΅„©σ΅„© + ∑ πœ† 𝑀 (𝑄𝑖 ) πœŒπ‘– πœσ΅„©σ΅„©σ΅„©πœ™σ΅„©σ΅„©σ΅„©
𝑖=1
Ω𝑖 = (πœŒπ‘–+1 − πœŒπ‘– ) 𝜏2 𝑒−2π‘˜πœ πœπ‘–π‘‡ (𝑑) 𝐻𝑖𝑇 𝑍−1 𝐻𝑖 πœπ‘– (𝑑) ,
𝑇
+ 2𝜏3 πœ† 𝑀 (𝑍) [πœ† 𝑀 ((𝐷 − 𝐴𝐿 0 ) (𝐷 − 𝐴𝐿 0 ))
𝑖 = 0, 1, . . . , 𝐾,
𝑇
+ πœ† 𝑀 (𝐿2 ) πœ† 𝑀 (𝐴𝑇 𝐴)
𝑇
𝑇
πœπ‘— (𝑑) = [π‘₯ (𝑑 − πœŒπ‘— 𝜏 (𝑑)) π‘₯ (𝑑 − πœŒπ‘—+1 𝜏 (𝑑))] ,
𝑗 = 0, 1, . . . , 𝐾 + 1.
+ πœ† 𝑀 (𝐿2 ) πœ† 𝑀 (𝐡𝑇 𝐡)
(20)
σ΅„© σ΅„©
+πœ† 𝑀 (𝐿 0 𝐡𝑇 𝐡𝐿 0 ) ] σ΅„©σ΅„©σ΅„©πœ™σ΅„©σ΅„©σ΅„© ,
𝜁 (𝑑) = [π‘₯𝑇 (𝑑) , π‘₯𝑇 (𝑑 − 𝜌1 𝜏 (𝑑)) , . . . , π‘₯𝑇 (𝑑 − 𝜌𝐾 𝜏 (𝑑)) ,
𝑇
𝑇
π‘₯ (𝑑 − 𝜏 (𝑑)) , π‘₯ (𝑑 − 𝜏) ,
Δ = πœ† 𝑀 (𝑃) + (πœ† 𝑀 (𝐿2 ) + πœ† 𝑀 (Λ𝑇 Λ)) + πœ† 𝑀 (𝑅1 ) 𝜏
𝑇
Μ‡
Obviously, if Ω < 0, it implies 𝑉(π‘₯(𝑑))
< 0 for any 𝜁(𝑑) =ΜΈ 0.
And
𝑛
𝑇
𝑉 (π‘₯ (0)) = π‘₯ (0) 𝑃π‘₯ (0) + 2 ∑ πœ† 𝑖 ∫
𝑖=1
π‘₯𝑖 (0)
0
+ πœ† 𝑀 (𝑅2 ) πœ† 𝑀 (𝐿2 ) 𝜏 + πœ† 𝑀 (𝑅3 ) 𝜏
𝐾
σ΅„© σ΅„©2
+ ∑ πœ† 𝑀 (𝑄𝑖 ) πœŒπ‘– πœσ΅„©σ΅„©σ΅„©πœ™σ΅„©σ΅„©σ΅„©
𝑔𝑖 (𝑠) 𝑑𝑠
𝑖=1
𝑇
0
+ 2𝜏3 πœ† 𝑀 (𝑍) [πœ† 𝑀 ((𝐷 − 𝐴𝐿 0 ) (𝐷 − 𝐴𝐿 0 ))
2π‘˜π‘  𝑇
−𝜏(0)
+∫
(24)
where
𝑔𝑇 (π‘₯ (𝑑)) , 𝑔𝑇 (π‘₯ (𝑑 − 𝜏 (𝑑)))] .
+∫
(22)
+𝐡𝑔 (π‘₯ (𝑑 − 𝜏 (𝑠))) + 𝐡π‘₯ (𝑑 − 𝜏 (𝑠))] .
+ (πœŒπ‘–+1 − πœŒπ‘– ) 𝜏 (𝑑) πœπ‘–π‘‡ (𝑑) 𝐻𝑖𝑇 𝑍−1 𝐻𝑖 πœπ‘– (𝑑)
−∫
𝑇
0
−𝜏(0)
0
𝑒
π‘₯ (𝑠) 𝑅1 π‘₯ (𝑠) 𝑑𝑠
𝑒2π‘˜π‘  𝑔𝑇 (π‘₯ (𝑠)) 𝑅2 𝑔 (π‘₯ (𝑠)) 𝑑𝑠
−𝜏
𝐾
+ ∑∫
π‘₯ (𝑠) 𝑅3 π‘₯ (𝑠) 𝑑𝑠
0
𝑖=1 −πœŒπ‘– 𝜏(0)
0
+πœ† 𝑀 (𝐿2 ) πœ† 𝑀 (𝐡𝑇 𝐡) + πœ† 𝑀 (𝐿 0 𝐡𝑇 𝐡𝐿 0 ) ] .
(25)
(21)
2π‘˜π‘  𝑇
+∫ 𝑒
+ πœ† 𝑀 (𝐿2 ) πœ† 𝑀 (𝐴𝑇 𝐴)
0
𝑒2π‘˜π‘  π‘₯𝑇 (𝑠) 𝑄𝑖 π‘₯ (𝑠) 𝑑𝑠
+ 𝜏 ∫ ∫ 𝑒2π‘˜π‘  π‘₯̇𝑇 (𝑠) 𝑍π‘₯Μ‡ (𝑠) 𝑑𝑠.
−𝜏 πœƒ
On the other hand, we have
σ΅„© σ΅„©
𝑉 (π‘₯ (𝑑)) ≥ 𝑒2π‘˜π‘‘ πœ† π‘š (𝑃) σ΅„©σ΅„©σ΅„©πœ™σ΅„©σ΅„©σ΅„© .
(26)
Δ σ΅„©σ΅„© σ΅„©σ΅„©
σ΅„©πœ™σ΅„© .
πœ† π‘š (𝑃) σ΅„© σ΅„©
(27)
Therefore,
β€–π‘₯ (𝑑)β€– ≤ 𝑒−π‘˜π‘‘ √
6
Abstract and Applied Analysis
0.8
Thus, according to Definition 1, we can conclude that the
equilibrium point π‘₯∗ of system (5) is globally exponentially
stable. This completes the proof.
Remark 6. In Theorem 4, by setting 𝑅1 = 𝑅2 = 𝑄𝑖 = 0 (𝑖 =
1, 2, . . . , 𝐾), similar to the proof of Theorem 4, we can derive
a criterion to guarantee the global exponential stability of
Μ‡ is unknown or 𝜏(𝑑)
RNNs with time-varying delay when 𝜏(𝑑)
is not differentiable.
0.4
0.2
State
Remark 5. Differential from the results in [22, 23, 29], we
divide the time delay interval [0, 𝜏(𝑑)] into 𝐾 + 1 dynamical
subintervals, and a novel Lyapunov-Krasovskii functional is
introduced. This brings more degrees of freedom to ensure
the global exponential stability. Therefore, Theorem 4 is less
conservative than some previous results.
0.6
0
−0.2
−0.4
−0.6
0
1
2
3
4
5
6
Time (s)
7
8
9
10
π‘₯1
π‘₯2
4. Illustrating Example
In this section, an illustrating example is given to verify the
effectiveness and advantage of the criteria proposed in this
paper.
Figure 1: State response curves with 𝜏 = 1 and πœ‡ = 0 for Example 7.
Example 7. Consider system (5) with the following parameters:
Table 1: Allowable exponential convergence rate π‘˜ for variable πœ‡ and
𝜏 = 1.
𝐷=[
𝐴=[
𝐡=[
𝐿=[
2 0
],
0 3.5
−1 0.5
],
0.5 −1
−0.5 0.5
],
0.5 0.5
(28)
1 0
].
0 0
At first, we suppose that the time delay interval [0, 𝜏(𝑑)]
is divided into 2 (𝐾 = 1) subintervals, and 𝜌 = 0.1. While
the upper bound 𝜏 = 1, the exponential convergence rates
for various πœ‡ obtained from Theorem 4 and those in [22, 23,
29] are listed in Table 1. In addition, while the exponential
convergence rate of π‘˜ = 0.8, the upper bounds of 𝜏 for various
πœ‡ from Theorem 4 and those in [22, 23, 29] are listed in
Table 2.
Thus, from Tables 1 and 2, we can say that, the result
in this paper is much effective and less conservative than
those in [22, 23, 29]. Figure 1 shows the state response of
Example 7 with constant delay 𝜏 = 1, when the initial value is
[0.8, −0.6]𝑇 .
5. Conclusion
In this paper, we consider the global exponential stability
for RNNs with time-varying delay. By dividing the time
delay interval [0, 𝜏(𝑑)] into 𝐾 + 1 dynamical subintervals, a
novel Lyapunov-Krasovskii functional is introduced. A less
conservative LMI-based delay-dependent stability criterion is
derived based on Lyapunov stability theory. Furthermore, an
πœ‡
[22]
[23]
[29]
Theorem 4 (𝜌 = 1)
0
0.25
1.15
1.15
1.15
0.5
Fail
0.7538
0.8643
0.9105
0.9
Fail
0.6106
0.8344
0.9105
Unsure
Fail
0.3391
0.8169
0.8608
Table 2: Allowable upper bound of 𝜏 for variable πœ‡ and π‘˜ = 0.8.
πœ‡
[22]
[23]
[29]
Theorem 4 (𝜌 = 1)
0.5
Fail
1.2606
1.2787
1.3022
0.8
Fail
0.9442
1.0819
1.1646
Unsure
Fail
0.8310
1.0366
1.0817
illustrating example is given to show the effectiveness of the
proposed result.
Acknowledgments
This work is supported by Guangxi Science Foundation Grant
(0832067), the Foundation Grant of Guangxi Key Laboratory
of Automobile Components and Vehicle Technology (13-A03-01), and the Opening Project of Guangxi Key Laboratory of Automobile Components and Vehicle Technology
(2012KFZD03).
References
[1] Y. H. Chen and S. C. Fang, “Solving convex programming problems with equality constraints by neural networks,” Computers
and Mathematics with Applications, vol. 36, no. 7, pp. 41–68,
1998.
Abstract and Applied Analysis
[2] Y. H. Chen and S. C. Fang, “Neurocomputing with time delay
analysis for solving convex quadratic programming problems,”
IEEE Transactions on Neural Networks, vol. 11, no. 1, pp. 230–
240, 2000.
[3] J. A. Farrell and A. N. Michel, “A synthesis procedure for Hopfield’s continuous-time associative memory,” IEEE Transactions
on Circuits and Systems, vol. 37, no. 7, pp. 877–884, 1990.
[4] A. N. Michel, J. A. Farrell, and H. F. Sun, “Analysis and
synthesis techniques for Hopfield type synchronous discrete
time neural networks with application to associative memory,”
IEEE Transactions on Circuits and Systems, vol. 37, no. 11, pp.
1356–1366, 1990.
[5] T. Nishikawa, Y. C. Lai, and F. C. Hoppensteadt, “Capacity
of oscillatory associative-memory networks with error-free
retrieval,” Physical Review Letters, vol. 92, no. 10, Article ID
108101, 4 pages, 2004.
[6] L. O. Chua and L. Yang, “Cellular neural networks: applications,” IEEE Transactions on Circuits and Systems, vol. 35, no.
10, pp. 1273–1290, 1988.
[7] R. Cancelliere, M. Gai, and A. Slavova, “Application of polynomial cellular neural networks in diagnosis of astrometric
chromaticity,” Applied Mathematical Modelling, vol. 34, no. 12,
pp. 4243–4252, 2010.
[8] S. S. Young, P. D. Scott, and N. M. Nasrabadi, “Object
recognition using multilayer Hopfield neural network,” IEEE
Transactions on Image Processing, vol. 6, no. 3, pp. 357–372, 1997.
[9] L. Chen, W. Xue, and N. Tokuda, “Classification of 2dimensional array patterns: assembling many small neural
networks is better than using a large one,” Neural Networks, vol.
23, no. 6, pp. 770–781, 2010.
[10] L. Olien and J. Bélair, “Bifurcations, stability, and monotonicity
properties of a delayed neural network model,” Physica D, vol.
102, no. 3-4, pp. 349–363, 1997.
[11] S. Arik, “An analysis of global asymptotic stability of delayed cellular neural networks,” IEEE Transactions on Neural Networks,
vol. 13, no. 5, pp. 1239–1242, 2002.
[12] J. Cao and D. Zhou, “Stability analysis of delayed cellular neural
networks,” Neural Networks, vol. 11, no. 9, pp. 1601–1605, 1998.
[13] J. Wei and S. Ruan, “Stability and bifurcation in a neural network
model with two delays,” Physica D, vol. 130, no. 3-4, pp. 255–272,
1999.
[14] X. Liao, G. Chen, and E. N. Sanchez, “Delay-dependent exponential stability analysis of delayed neural networks: an LMI
approach,” Neural Networks, vol. 15, no. 7, pp. 855–866, 2002.
[15] H. Huang, J. Cao, and J. Wang, “Global exponential stability and
periodic solutions of recurrent neural networks with delays,”
Physics Letters A, vol. 298, no. 5-6, pp. 393–404, 2002.
[16] B. Chen and J. Wang, “Global exponential periodicity and global
exponential stability of a class of recurrent neural networks with
various activation functions and time-varying delays,” Neural
Networks, vol. 20, no. 10, pp. 1067–1080, 2007.
[17] H. Jiang and Z. Teng, “Global eponential stability of cellular
neural networks with time-varying coefficients and delays,”
Neural Networks, vol. 17, no. 10, pp. 1415–1425, 2004.
[18] S. Senan and S. Arik, “New results for exponential stability of
delayed cellular neural networks,” IEEE Transactions on Circuits
and Systems II, vol. 52, no. 3, pp. 154–158, 2005.
[19] Q. Zhang, X. Wei, and J. Xu, “An analysis on the global
asymptotic stability for neural networks with variable delays,”
Physics Letters A, vol. 328, no. 2-3, pp. 163–169, 2004.
7
[20] H. Zhao and G. Wang, “Delay-independent exponential stability of recurrent neural networks,” Physics Letters A, vol. 333, no.
5-6, pp. 399–407, 2004.
[21] T. L. Liao, J. J. Yan, C. J. Cheng, and C. C. Hwang, “Globally
exponential stability condition of a class of neural networks with
time-varying delays,” Physics Letters A, vol. 339, no. 3-5, pp. 333–
342, 2005.
[22] Q. Zhang, X. Wei, and J. Xu, “Delay-dependent exponential
stability of cellular neural networks with time-varying delays,”
Chaos, Solitons & Fractals, vol. 23, no. 4, pp. 1363–1369, 2005.
[23] Y. He, M. Wu, and J. H. She, “Delay-dependent exponential
stability of delayed neural networks with time-varying delay,”
IEEE Transactions on Circuits and Systems II, vol. 53, no. 7, pp.
553–557, 2006.
[24] Y. He, G. P. Liu, D. Rees, and M. Wu, “Stability analysis for neural
networks with time-varying interval delay,” IEEE Transactions
on Neural Networks, vol. 18, no. 6, pp. 1850–1854, 2007.
[25] T. Li, L. Guo, C. Sun, and C. Lin, “Further results on delaydependent stability criteria of neural networks with timevarying delays,” IEEE Transactions on Neural Networks, vol. 19,
no. 4, pp. 726–730, 2008.
[26] C. D. Zheng, H. G. Zhang, and Z. S. Wang, “Improved robust
stability criteria for delayed cellular neural networks via the LMI
approach,” IEEE Transactions on Circuits and Systems II, vol. 57,
no. 1, pp. 41–45, 2010.
[27] S. Mou, H. Gao, J. Lam, and W. Qiang, “A new criterion of delaydependent asymptotic stability for Hopfield neural networks
with time delay,” IEEE Transactions on Neural Networks, vol. 19,
no. 3, pp. 532–535, 2008.
[28] H. Zhang, Z. Liu, G. B. Huang, and Z. Wang, “Novel weightingdelay-based stability criteria for recurrent neural networks with
time-varying delay,” IEEE Transactions on Neural Networks, vol.
21, no. 1, pp. 91–106, 2010.
[29] M. Wu, F. Liu, P. Shi, Y. He, and R. Yokoyama, “Exponential
stability analysis for neural networks with time-varying delay,”
IEEE Transactions on Systems, Man, and Cybernetics B, vol. 38,
no. 4, pp. 1152–1156, 2008.
[30] X. M. Zhang, M. Wu, J. H. She, and Y. He, “Delay-dependent
stabilization of linear systems with time-varying state and input
delays,” Automatica, vol. 41, no. 8, pp. 1405–1412, 2005.
[31] H. Zhang, Z. Wang, and D. Liu, “Robust exponential stability of
recurrent neural networks with multiple time-varying delays,”
IEEE Transactions on Circuits and Systems II, vol. 54, no. 8, pp.
730–734, 2007.
Advances in
Operations Research
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Advances in
Decision Sciences
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Mathematical Problems
in Engineering
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Journal of
Algebra
Hindawi Publishing Corporation
http://www.hindawi.com
Probability and Statistics
Volume 2014
The Scientific
World Journal
Hindawi Publishing Corporation
http://www.hindawi.com
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
International Journal of
Differential Equations
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Volume 2014
Submit your manuscripts at
http://www.hindawi.com
International Journal of
Advances in
Combinatorics
Hindawi Publishing Corporation
http://www.hindawi.com
Mathematical Physics
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Journal of
Complex Analysis
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
International
Journal of
Mathematics and
Mathematical
Sciences
Journal of
Hindawi Publishing Corporation
http://www.hindawi.com
Stochastic Analysis
Abstract and
Applied Analysis
Hindawi Publishing Corporation
http://www.hindawi.com
Hindawi Publishing Corporation
http://www.hindawi.com
International Journal of
Mathematics
Volume 2014
Volume 2014
Discrete Dynamics in
Nature and Society
Volume 2014
Volume 2014
Journal of
Journal of
Discrete Mathematics
Journal of
Volume 2014
Hindawi Publishing Corporation
http://www.hindawi.com
Applied Mathematics
Journal of
Function Spaces
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Optimization
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Download