Mathematical Problems in Engineering

Volume 2015 (2015), Article ID 705367, 10 pages

http://dx.doi.org/10.1155/2015/705367

## Improved Delay-Dependent Stability Analysis for Neural Networks with Interval Time-Varying Delays

School of Mathematics and Computer Science, Zunyi Normal College, Zunyi 563002, China

Received 20 October 2014; Accepted 27 November 2014

Academic Editor: P. Balasubramaniam

Copyright © 2015 Jun-kang Tian and Yan-min Liu. 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.

#### Abstract

The problem of delay-dependent asymptotic stability analysis for neural networks with interval time-varying delays is considered based on the delay-partitioning method. Some less conservative stability criteria are established in terms of linear matrix inequalities (LMIs) by constructing a new Lyapunov-Krasovskii functional (LKF) in each subinterval and combining with reciprocally convex approach. Moreover, our criteria depend on both the upper and lower bounds on time-varying delay and its derivative, which is different from some existing ones. Finally, a numerical example is given to show the improved stability region of the proposed results.

#### 1. Introduction

In the past decades, neural networks have been paid much attention due to their strong capability of information processing such as pattern recognition, image processing, fault diagnosis, and associative memories. Meanwhile, due to the finite switching speed of amplifiers, time-delay is inevitably encountered in real-world neural networks. Time-delays often cause instability and oscillation in neural networks. Therefore, many effects have been paid to delay-dependent stability analysis of neural networks with time-delays.

For the delay-dependent stability criteria of neural networks with time delays, the main purpose is to obtain a maximum value of the admissible delay such that the concerned systems are asymptotically stable. To enhance the feasible region of stability criteria, by using the free weighting matrix method, a new delay-dependent stability criterion for delayed neural networks was obtained in [1]. But some useful terms were ignored in [1] when estimating the upper bound on the derivative of the Lyapunov functionals. Then, the result was further improved in [2] by considering the relationships among some useful terms adequately. In order to reduce the conservatism, researchers have introduced the augmented Lyapunov functional method [3] and the reciprocally convex approach [4]. Recently, the delay-partitioning approach which divides delay interval into some subintervals was employed to investigate the delay-dependent stability problem of delayed neural networks [5–12]. In [5, 6], the delay-partitioning number was chosen as 2. In [5], some improved stability criteria were obtained by utilizing different free-weighting matrices in each delay subinterval for neural networks with time-varying delays. In [7–12], the delay-partitioning number was chosen as , where . In [8], a weighting delay based method was introduced to derive the stability criteria for recurrent neural networks with time-varying delay. Different from some existing results, by employing weighting delays, the delay interval was divided into some variable subintervals. In [10], complete delay-decomposing approach was introduced to derive asymptotic stability criterion for neural networks with time-varying delays by using reciprocally convex technique. Among those above methods, the delay-partitioning method is proven to be more effective than the free-weighting matrix approach and augmented Lyapunov functional method.

In the above mentioned results [1–12], the lower bound of time-varying delay for delayed neural networks is restricted to be 0. However, in the real world, the time-varying delay may be an interval delay; that is, the lower bound of the delay is not restricted to be 0. Therefore, many effects have been paid to delay-dependent stability analysis of neural networks with interval time-varying delay [13–17]. In [13], A piecewise delay method is introduced to derive several novel delay-dependent stability criteria for neural networks with interval time-varying delay. By using the delay decomposition method and a new convex combination technique, some new delay-dependent stability criteria were obtained in [14]. Recently, by constructing a new Lyapunov functional and dividing the lower bound of the time-varying delay, the asymptotic stability for cellular neural networks with interval time-varying delays is investigated in [15]. By dividing the lower and upper bounds of the time-varying delay and constructing an improved Lyapunov-Krasovskii functional, [16] obtained some delay-dependent stability criteria in terms of LMIs to reduce the conservatism. The proposed stability conditions are less conservative due to the novel delay-partitioning method and convex combination technique considered. By considering the sufficient information of neuron activation functions, [17] obtained some improved delay-dependent stability criteria for neural networks with interval time-varying delay. However, there are rooms for further improvement. Firstly, in [15], only the delay interval has been divided into segments. In this case, there is no connection between time-varying delay and each subinterval, which may lead to much conservatism. In [16], the delay intervals and have been divided into some segments and the information is considered, but the relation between the time-varying delay and each subinterval is not adequately considered, which may lead to considerable conservatism. Secondly, many stability conditions ignore the information of the lower bound of delay derivative. In fact, the lower bound of delay derivative plays an important role in improving stability region of the proposed results. Thirdly, the information of neuron activation functions is not adequately considered, which may lead to much conservatism.

In this paper, to show the merits of our new delay-partitioning method, we only need to divide the delay intervals and into segments; that is, , , respectively. Some existing results [14–16] only consider the information and do not consider the information or , which may lead to considerable conservatism. Thus, when dealing with the time derivative of , not only the information but also the information and is considered in our paper. So the information between time-varying delay and each subinterval is considered adequately, which may play an important role in reducing conservatism of derived results. By taking more information of the lower bound of delay derivative, an augmented LKF is introduced to derive two stability criteria for neural networks with interval time-varying delay. Then, by employing reciprocally convex approach, some less conservative delay-dependent stability criteria are presented in terms of LMI. Finally, a numerical example is given to show the effectiveness of the proposed method.

#### 2. Problem Formulation

Consider the following neural networks with interval time-varying delay:where is the neuron state vector, denotes the neuron activation function, and is a constant input vector. is the connection weight matrix and is the delayed connection weight matrix. is a diagonal matrix with , . is time-varying continuous function that satisfies , , where , and , are constants. In addition, it is assumed that each neuron activation function , , satisfies the following condition:where , , are constants.

Assuming that is the equilibrium point of (1). By the transformation , (1) can be converted to the following form:where , , and , . According to inequality (2), we obtain

Lemma 1 (see [18]). *For any constant matrix , , scalars ; then*

Lemma 2 (see [19]). *Let have positive values in an open subset of . Then, the reciprocally convex combination of over satisfiessubject to*

#### 3. Main Results

Theorem 3. *For given positive scalars , , and any scalars , diagonal matrices , , and system (3) is globally asymptotically stable for , if there exist symmetric positive matrices , , , , , positive diagonal matrices , , , , , and any matrices , with appropriate dimensions, satisfying the following LMIs:where*

*Proof. *We construct a new LKF as where *Remark **4*. When constructing the , we not only divide the delay interval but also divide the delay interval into segments; that is, , , respectively, which may play an important role in reducing conservatism of derived results.*Remark **5*. Since considers the information of the lower bound of delay derivative, the LKF in this paper is more general than that in [14–16]. So the obtained stability criteria may be less conservative than the existing ones.

The time derivative of along the trajectories of system (3) yields whereBy (16), we obtainwhere is defined in (8). Consider the following:Furthermore, there exist positive diagonal matrices , , , such that the following inequalities hold based on (4):For , by use of Lemma 1, we obtainLetthenIf , then, by using Lemma 2, we obtainwhich impliesThen, from (19)–(24), we obtainThereforewhere , , are defined in (8).

From (16)–(28), we obtainIf , then there exists a scalar , such thatThus, according to [20], system (3) is globally asymptotically stable for . By Schur complement, is equivalent to (8).

For , similar to , we obtainIf , then we obtainwhereTherefore, by (27), (31), and (32), we obtainwhere are defined in (9).

From (16)–(19) and (34) we obtainIf , then there exists a scalar , such thatThus, according to [20], system (3) is globally asymptotically stable for . By Schur complement, is equivalent to (9). This completes the proof.

*Remark 6. *From (25) and (32), the information and is considered adequately in our paper, which may lead to less conservative results.

*Remark 7. *The reciprocally convex optimization technique was utilized in each subinterval and , which has potential to yield less conservative conditions.

*Remark 8. *Based on the results of Theorem 3, an improved stability criterion for system (3) is introduced by utilizing the idea of [17] which divided the bounding of activation function into two subintervals, such as and . Finally, a numerical example is given to show that Theorem 9 significantly improves the feasible region of stability criterion comparing with some previous literatures.

Theorem 9. *For given positive scalars , , , and any scalars , , diagonal matrices , , and system (3) is globally asymptotically stable for , , if there exist symmetric positive matrices , , , , , positive diagonal matrices , , and any matrices , with appropriate dimensions, satisfying the following LMIs:wherewhereThe are defined in Theorem 3.*

*Proof. *Let us choose the same Lyapunov functional proposed in Theorem 3.*Case **1.* ConsiderSimilar to (19), there exist positive diagonal matrices , , , such that the following inequalities hold based on (45):Therefore, by the use of proof of Theorem 3, when , , from (16)–(18), (34), and (46), we obtainIf , then there exists a scalar , such thatThus, according to [20], system (3) is globally asymptotically stable for , . By Schur complement, is equivalent to (37).*Case 2.* ConsiderSimilar to (19), there exist positive diagonal matrices , , , such that the following inequalities hold based on (49):Therefore, by the use of proof of Theorem 3, when , , from (16)–(18), (34), and (50), we obtainIf , then there exists a scalar , such that Thus, according to [20], system (3) is globally asymptotically stable for , . By Schur complement, is equivalent to (38).

#### 4. Numerical Examples

In this section, an example is given to demonstrate the effectiveness of the derived method.

*Example 1. *Consider the stability of neural networks (3) with the following parameters:For given , , the upper bounds of for different are derived by Theorems 3 and 9 and those results in [15–17] are listed in Table 1. According to Table 1, our obtained results are much less conservative than those in the literature.