Table of Contents Author Guidelines Submit a Manuscript
Table of Contents Alerts

To receive news and publication updates for Discrete Dynamics in Nature and Society, enter your email address in the box below.

Discrete Dynamics in Nature and Society
Volume 2010 (2010), Article ID 810408, 19 pages
http://dx.doi.org/10.1155/2010/810408
Research Article

Global Dissipativity on Uncertain Discrete-Time Neural Networks with Time-Varying Delays

Qiankun Song1,2 and Jinde Cao3

1Department of Mathematics, Chongqing Jiaotong University, Chongqing 400074, China
2Yangtze Center of Mathematics, Sichuan University, Chengdu 610064, China
3Department of Mathematics, Southeast University, Nanjing 210096, China

Received 24 December 2009; Accepted 14 February 2010

Academic Editor: Yong Zhou

Copyright © 2010 Qiankun Song and Jinde Cao. 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 problems on global dissipativity and global exponential dissipativity are investigated for uncertain discrete-time neural networks with time-varying delays and general activation functions. By constructing appropriate Lyapunov-Krasovskii functionals and employing linear matrix inequality technique, several new delay-dependent criteria for checking the global dissipativity and global exponential dissipativity of the addressed neural networks are established in linear matrix inequality (LMI), which can be checked numerically using the effective LMI toolbox in MATLAB. Illustrated examples are given to show the effectiveness of the proposed criteria. It is noteworthy that because neither model transformation nor free-weighting matrices are employed to deal with cross terms in the derivation of the dissipativity criteria, the obtained results are less conservative and more computationally efficient.

1. Introduction

In the past few decades, delayed neural networks have found successful applications in many areas such as signal processing, pattern recognition, associative memories, parallel computation, and optimization solvers [1]. In such applications, the qualitative analysis of the dynamical behaviors is a necessary step for the practical design of neural networks [2]. Many important results on the dynamical behaviors have been reported for delayed neural networks; see [1–16] and the references therein for some recent publications.

It should be pointed out that all of the abovementioned literatures on the dynamical behaviors of delayed neural networks are concerned with continuous-time case. However, when implementing the continuous-time delayed neural network for computer simulation, it becomes essential to formulate a discrete-time system that is an analogue of the continuous-time delayed neural network. To some extent, the discrete-time analogue inherits the dynamical characteristics of the continuous-time delayed neural network under mild or no restriction on the discretization step-size, and also remains some functional similarity [17]. Unfortunately, as pointed out in [18], the discretization cannot preserve the dynamics of the continuous-time counterpart even for a small sampling period, and therefore there is a crucial need to study the dynamics of discrete-time neural networks. Recently, the dynamics analysis problem for discrete-time delayed neural networks and discrete-time systems with time-varying state delay has been extensively studied; see [17–21] and references therein.

It is well known that the stability problem is central to the analysis of a dynamic system where various types of stability of an equilibrium point have captured the attention of researchers. Nevertheless, from a practical point of view, it is not always the case that every neural network has its orbits approach a single equilibrium point. It is possible that there is no equilibrium point in some situations. Therefore, the concept on dissipativity has been introduced [22]. As pointed out in [23], the dissipativity is also an important concept in dynamical neural networks. The concept of dissipativity in dynamical systems is a more general concept and it has found applications in the areas such as stability theory, chaos and synchronization theory, system norm estimation, and robust control [23]. Some sufficient conditions checking the dissipativity for delayed neural networks and nonlinear delay systems have been derived, for example, see [23–33] and references therein. In [23, 24], authors analyzed the dissipativity of neural network with constant delays, and derived some sufficient conditions for the global dissipativity of neural network with constant delays. In [25, 26], authors considered the global dissipativity and global robust dissipativity for neural network with both time-varying delays and unbounded distributed delays; several sufficient conditions for checking the global dissipativity and global robust dissipativity were obtained. In [27, 28], by using linear matrix inequality technique, authors investigated the global dissipativity of neural network with both discrete time-varying delays and distributed time-varying delays. In [29], authors developed dissipativity notions for nonnegative dynamical systems with respect to linear and nonlinear storage functions and linear supply rates, and obtained a key result on linearization of nonnegative dissipative dynamical systems. In [30], the uniform dissipativity of a class of nonautonomous neural networks with time-varying delays was investigated by employing 𝑀-matrix and the techniques of inequality. In [31–33], the dissipativity of a class of nonlinear delay systems was considered; some sufficient conditions for checking the dissipativity were given. However, all of the abovementioned literatures on the dissipativity for delayed neural networks and nonlinear delay systems are concerned with continuous-time case. To the best of our knowledge, few authors have considered the problem on the dissipativity of uncertain discrete-time neural networks with time-varying delays. Therefore, the study on the dissipativity of uncertain discrete-time neural networks is not only important but also necessary.

Motivated by the above discussions, the objective of this paper is to study the problem on global dissipativity and global exponential dissipativity for uncertain discrete-time neural networks. By employing appropriate Lyapunov-Krasovskii functionals and LMI technique, we obtain several new sufficient conditions for checking the global dissipativity and global exponential dissipativity of the addressed neural networks.

Notations 1. The notations are quite standard. Throughout this paper, 𝐼 represents the unitary matrix with appropriate dimensions; ℕ stands for the set of nonnegative integers; ℝ𝑛 and ℝ𝑛×𝑚 denote, respectively, the 𝑛-dimensional Euclidean space and the set of all 𝑛×𝑚 real matrices. The superscript “𝑇” denotes matrix transposition and the asterisk “*” denotes the elements below the main diagonal of a symmetric block matrix. |𝐴| denotes the absolute-value matrix given by |𝐴|=(|𝑎𝑖𝑗|)𝑛×𝑛; the notation 𝑋≥𝑌 (resp., 𝑋>𝑌) means that 𝑋 and 𝑌 are symmetric matrices, and that 𝑋−𝑌 is positive semidefinite (resp., positive definite). ‖⋅‖ is the Euclidean norm in ℝ𝑛. For a positive constant 𝑎, [𝑎] denotes the integer part of 𝑎. For integers 𝑎, 𝑏 with 𝑎<𝑏, ℕ[𝑎,𝑏] denotes the discrete interval given by ℕ[𝑎,𝑏]={𝑎,𝑎+1,…,𝑏−1,𝑏}. 𝐶(ℕ[−𝜏,0],ℝ𝑛) denotes the set of all functions 𝜙: ℕ[−𝜏,0]→ℝ𝑛. Matrices, if not explicitly specified, are assumed to have compatible dimensions.

2. Model Description and Preliminaries

In this paper, we consider the following discrete-time neural network model

𝑥(𝑘+1)=𝐶𝑥(𝑘)+𝐴𝑔(𝑥(𝑘))+𝐵𝑔(𝑥(𝑘−𝜏(𝑘)))+𝑢(2.1) for 𝑘∈ℕ, where 𝑥(𝑘)=(𝑥1(𝑘),𝑥2(𝑘),…,𝑥𝑛(𝑘))𝑇∈ℝ𝑛, 𝑥𝑖(𝑘) is the state of the 𝑖th neuron at time 𝑘; 𝑔(𝑥(𝑘))=(𝑔1(𝑥1(𝑘)),𝑔2(𝑥2(𝑘)),…,𝑔𝑛(𝑥𝑛(𝑘)))𝑇∈ℝ𝑛, 𝑔𝑗(𝑥𝑗(𝑘)) denotes the activation function of the 𝑗th neuron at time 𝑘; 𝑢=(𝑢1,𝑢2,…,𝑢𝑛)𝑇 is the input vector; the positive integer 𝜏(𝑘) corresponds to the transmission delay and satisfies 𝜏≤𝜏(𝑘)≤𝜏 (𝜏≥0 and 𝜏≥0 are known integers); 𝐶=diag{𝑐1,𝑐2,…,𝑐𝑛}, where 𝑐𝑖 (0≤𝑐𝑖<1) describes the rate with which the 𝑖th neuron will reset its potential to the resting state in isolation when disconnected from the networks and external inputs; 𝐴=(𝑎𝑖𝑗)𝑛×𝑛 is the connection weight matrix; 𝐵=(𝑏𝑖𝑗)𝑛×𝑛 is the delayed connection weight matrix.

The initial condition associated with model (2.1) is given by

𝑥−(𝑠)=𝜑(𝑠),𝑠∈ℕ𝜏,0.(2.2)

Throughout this paper, we make the following assumption [6].

(H) For any 𝑗∈{1,2,…,𝑛}, 𝑔𝑗(0)=0 and there exist constants 𝐺−𝑗 and 𝐺+𝑗 such that 𝐺−𝑗≤𝑔𝑗𝛼1−𝑔𝑗𝛼2𝛼1−𝛼2≤𝐺+𝑗,∀𝛼1,𝛼2∈ℝ,𝛼1≠𝛼2.(2.3)

Similar to [23], we also give the following definitions for discrete-time neural networks (2.1).

Definition 2.1. Discrete-time neural networks (2.1) are said to be globally dissipative if there exists a compact set 𝑆⊆ℝ𝑛, such that for all 𝑥0∈ℝ𝑛, ∃ positive integer 𝐾(𝑥0)>0, when 𝑘≥𝑘0+𝐾(𝑥0), 𝑥(𝑘,𝑘0,𝑥0)⊆𝑆, where 𝑥(𝑘,𝑘0,𝑥0) denotes the solution of (2.1) from initial state 𝑥0 and initial time 𝑘0. In this case, 𝑆 is called a globally attractive set. A set 𝑆 is called a positive invariant if ∀𝑥0∈𝑆 implies 𝑥(𝑘,𝑘0,𝑥0)⊆𝑆 for 𝑘≥𝑘0.

Definition 2.2. Let 𝑆 be a globally attractive set of discrete-time neural networks (2.1). Discrete-time neural networks (2.1) are said to be globally exponentially dissipative if there exists a compact set 𝑆∗⊃𝑆 in ℝ𝑛 such that ∀𝑥0∈ℝ𝑛⧵𝑆∗, there exist constants 𝑀(𝑥0)>0 and 0<𝛽<1 such that inf𝑥∈ℝ𝑛⧵𝑆∗‖‖𝑥𝑘,𝑘0,𝑥0‖‖−̃𝑥∶̃𝑥∈𝑆∗𝑥≤𝑀0𝛽𝑘−𝑘0.(2.4) Set 𝑆∗ is called globally exponentially attractive set, where 𝑥∈ℝ𝑛⧵𝑆∗ means 𝑥∈ℝ𝑛 but 𝑥∉𝑆∗.

To prove our results, the following lemmas are necessary.

Lemma 2.3 (see [34]). Given constant matrices 𝑃, 𝑄, and 𝑅, where 𝑃𝑇=𝑃, 𝑄𝑇=𝑄, then 𝑅𝑃𝑅𝑇−𝑄<0(2.5) is equivalent to the following conditions: 𝑄>0,𝑃+𝑅𝑄−1𝑅𝑇<0.(2.6)

Lemma 2.4 (see [35, 36]). Given matrices 𝑃, 𝑄, and 𝑅 with 𝑃𝑇=𝑃, then 𝑃+𝑄𝐹(𝑘)𝑅+𝑅𝑇𝐹𝑇(𝑘)𝑄𝑇<0(2.7) holds for all 𝐹(𝑘) satisfying 𝐹𝑇(𝑘)𝐹(𝑘)≤𝐼 if and only if there exists a scalar 𝜀>0 such that 𝑃+𝜀−1𝑄𝑄𝑇+𝜀𝑅𝑅𝑇<0.(2.8)

3. Main Results

In this section, we shall establish our main criteria based on the LMI approach. For presentation convenience, in the following, we denote

𝐺1𝐺=diag−1,𝐺−2,…,𝐺−𝑛,𝐺2𝐺=diag+1,𝐺+2,…,𝐺+𝑛,𝐺3𝐺=diag−1𝐺+1,𝐺−2𝐺+2,…,𝐺−𝑛𝐺+𝑛,𝐺4𝐺=diag−1+𝐺+12,𝐺−2+𝐺+22𝐺,…,−𝑛+𝐺+𝑛2,𝛿=𝜏+𝜏2.(3.1)

Theorem 3.1. Suppose that (H) holds. If there exist nine symmetric positive definite matrices 𝑃>0, 𝑊>0, 𝑅>0, 𝑄𝑖>0(𝑖=1,2,3,4,5,6), and four positive diagonal matrices 𝐷𝑖>0(𝑖=1,2), 𝐻𝑖>0(𝑖=1,2), such that the following LMI holds: ⎡⎢⎢⎢⎢⎢⎢⎢⎢⎣ΠΠ=11Π12Π13Π14Π1500∗Π22Π23Π24000∗∗Π33Π340Π360∗∗∗Π44000∗∗∗∗Π550Π57∗∗∗∗∗Π660∗∗∗∗∗∗Π77⎤⎥⎥⎥⎥⎥⎥⎥⎥⎦<0,(3.2) where Π11=𝐶𝑇𝑃𝐶−𝑃+𝑄1+(1+𝜏−𝜏)(𝑄2−2𝐺1𝐷1+2𝐺2𝐷2)−𝐺3𝐻1+(𝐶−𝐼)𝑇(𝑄4+𝑄6)(𝐶−𝐼)−(1/𝛿2)𝑄4+𝑄5+𝑊, Π12=𝐶𝑇𝑃𝐴+(1+𝜏−𝜏)(𝐷1−𝐷2)+𝐺4𝐻1+(𝐶−𝐼)𝑇(𝑄4+𝑄6)𝐴, Π13=𝐶𝑇𝑃𝐵+(𝐶−𝐼)𝑇(𝑄4+𝑄6)𝐵, Π14=𝐶𝑇𝑃+(𝐶−𝐼)𝑇(𝑄4+𝑄6), Π15=(1/𝛿2)𝑄4, Π22=(1+𝜏−𝜏)𝑄3−𝐻1+𝐴𝑇(𝑃+𝑄4+𝑄6)𝐴, Π23=𝐴𝑇(𝑃+𝑄4+𝑄6)𝐵, Π24=𝐴𝑇(𝑃+𝑄4+𝑄6), Π33=−𝑄3−𝐻2+𝐵𝑇(𝑃+𝑄4+𝑄6)𝐵, Π34=𝐵𝑇(𝑃+𝑄4+𝑄6), Π36=−𝐷1+𝐷2+𝐺4𝐻2, Π44=𝑃+𝑄4+𝑄6−𝑅, Π55=−𝑄1−(1/𝛿2)𝑄4−(1/(𝜏−𝛿)2)𝑄6, Π57=(1/(𝜏−𝛿)2)𝑄6, Π66=−𝑄2+2𝐺1𝐷1−2𝐺2𝐷2−𝐺3𝐻2, and Π77=−𝑄5−(1/(𝜏−𝛿)2)𝑄6, then discrete-time neural network (2.1) is globally dissipative, and 𝑢𝑆=𝑥∶‖𝑥‖≤𝑇𝑅𝑢𝜆min(𝑊)1/2(3.3) is a positive invariant and globally attractive set.

Proof. For positive diagonal matrices 𝐷1>0 and 𝐷2>0, we know from assumption (H) that 𝑔(𝑥(𝑘))−𝐺1𝑥(𝑘)𝑇𝐷1𝐺𝑥(𝑘)≥0,2𝑥(𝑘)−𝑔(𝑥(𝑘))𝑇𝐷2𝑥(𝑘)≥0.(3.4)
Defining 𝜂(𝑘)=𝑥(𝑘+1)−𝑥(𝑘), we consider the following Lyapunov-Krasovskii functional candidate for model (2.1) as 𝑉(𝑘,𝑥(𝑘))=8𝑖=1𝑉𝑖(𝑘,𝑥(𝑘)),(3.5) where 𝑉1(𝑘,𝑥(𝑘))=𝑥𝑇𝑉(𝑘)𝑃𝑥(𝑘),2(𝑘,𝑥(𝑘))=𝑘−1𝑖=𝑘−𝛿𝑥𝑇(𝑖)𝑄1𝑉𝑥(𝑖),3(𝑘,𝑥(𝑘))=𝑘−1𝑖=𝑘−𝜏(𝑘)𝑥𝑇(𝑖)𝑄2𝑥(𝑖)+𝑘−𝜏𝑙=𝑘−𝜏+1𝑘−1𝑖=𝑙𝑥𝑇(𝑖)𝑄2𝑉𝑥(𝑖),4(𝑘,𝑥(𝑘))=𝑘−1𝑖=𝑘−𝜏(𝑘)𝑔𝑇(𝑥(𝑖))𝑄3𝑔(𝑥(𝑖))+𝑘−𝜏𝑙=𝑘−𝜏+1𝑘−1𝑖=𝑙𝑔𝑇(𝑥(𝑖))𝑄3𝑔𝑉(𝑥(𝑖)),5(𝑘,𝑥(𝑘))=2𝑘−1𝑖=𝑘−𝜏(𝑘)𝑔(𝑥(𝑖))−𝐺1𝑥(𝑖)𝑇𝐷1𝑥(𝑖)+2𝑘−𝜏𝑙=𝑘−𝜏+1𝑘−1𝑖=𝑙𝑔(𝑥(𝑖))−𝐺1𝑥(𝑖)𝑇𝐷1𝑉𝑥(𝑖),6(𝑘,𝑥(𝑘))=2𝑘−1𝑖=𝑘−𝜏(𝑘)𝐺2𝑥(𝑖)−𝑔(𝑥(𝑖))𝑇𝐷2𝑥(𝑖)+2𝑘−𝜏𝑙=𝑘−𝜏+1𝑘−1𝑖=𝑙𝐺2𝑥(𝑖)−𝑔(𝑥(𝑖))𝑇𝐷2𝑥𝑉(𝑖),7(1𝑘,𝑥(𝑘))=𝛿−1𝑙=−𝛿𝑘−1𝑖=𝑘+𝑙𝜂𝑇(𝑖)𝑄4𝑉𝜂(𝑖),8⎧⎪⎪⎨⎪⎪⎩(𝑘,𝑥(𝑘))=𝑘−1𝑖=𝑘−𝜏𝑥𝑇(𝑖)𝑄51𝑥(𝑖)+𝜏−𝛿𝑘−𝜏−1𝑙=𝑘−𝛿𝑘−1𝑖=𝑙𝜂𝑇(𝑖)𝑄6𝜂(𝑖),𝜏≤𝜏(𝑘)≤𝛿,𝑘−1𝑖=𝑘−𝜏𝑥𝑇(𝑖)𝑄51𝑥(𝑖)+𝜏−𝛿𝑘−𝛿−1𝑙=𝑘−𝜏𝑘−1𝑖=𝑙𝜂𝑇(𝑖)𝑄6𝜂(𝑖),𝛿<𝜏(𝑘)≤𝜏.(3.6) Calculating the difference of 𝑉𝑖(𝑘) (𝑖=1,2,3) along the positive half trajectory of (2.1), we obtain
Δ𝑉1(𝑘,𝑥(𝑘))=𝑥𝑇𝐶(𝑘)𝑇𝑥𝑃𝐶−𝑃(𝑘)+2𝑥𝑇(𝑘)𝐶𝑇𝑃𝐴𝑔(𝑥(𝑘))+2𝑥𝑇(𝑘)𝐶𝑇𝑃𝐵𝑔(𝑥(𝑘−𝜏(𝑘)))+2𝑥𝑇(𝑘)𝐶𝑇𝑃𝑢+𝑔𝑇(𝑥(𝑘))𝐴𝑇𝑃𝐴𝑔(𝑥(𝑘))+2𝑔𝑇(𝑥(𝑘))𝐴𝑇𝑃𝐵𝑔(𝑥(𝑘−𝜏(𝑘)))+2𝑔𝑇(𝑥(𝑘))𝐴𝑇𝑃𝑢+𝑔𝑇(𝑥(𝑘−𝜏(𝑘)))𝐵𝑇𝑃𝐵𝑔(𝑥(𝑘−𝜏(𝑘)))+2𝑔𝑇(𝑥(𝑘−𝜏(𝑘)))𝐵𝑇𝑃𝑢+𝑢𝑇𝑃𝑢,(3.7)Δ𝑉2(𝑘,𝑥(𝑘))=𝑥𝑇(𝑘)𝑄1𝑥(𝑘)−𝑥𝑇(𝑘−𝛿)𝑄1𝑥(𝑘−𝛿),(3.8)Δ𝑉3(𝑘,𝑥(𝑘))=𝑘𝑖=𝑘+1−𝜏(𝑘+1)𝑥𝑇(𝑖)𝑄2𝑥(𝑖)−𝑘−1𝑖=𝑘−𝜏(𝑘)𝑥𝑇(𝑖)𝑄2+𝑥(𝑖)𝑘+1−𝜏𝑙=𝑘−𝑘𝜏+2𝑖=𝑙𝑥𝑇(𝑖)𝑄2𝑥(𝑖)−𝑘−𝜏𝑙=𝑘−𝜏+1𝑘−1𝑖=𝑙𝑥𝑇(𝑖)𝑄2=𝑥(𝑖)𝑘−𝜏𝑖=𝑘+1−𝜏(𝑘+1)𝑥𝑇(𝑖)𝑄2𝑥(𝑖)+𝑘−1𝑖=𝑘−𝜏+1𝑥𝑇(𝑖)𝑄2𝑥(𝑖)+𝑥𝑇(𝑘)𝑄2𝑥(𝑘)−𝑘−1𝑖=𝑘−𝜏(𝑘)+1𝑥𝑇(𝑖)𝑄2𝑥(𝑖)−𝑥𝑇(𝑘−𝜏(𝑘))𝑄2𝑥(𝑘−𝜏(𝑘))+𝑥𝜏−𝜏𝑇(𝑘)𝑄2𝑥(𝑘)−𝑘−𝜏𝑙=𝑘−𝜏+1𝑥𝑇(𝑙)𝑄2≤𝑥(𝑙)1+𝑥𝜏−𝜏𝑇(𝑘)𝑄2𝑥(𝑘)−𝑥𝑇(𝑘−𝜏(𝑘))𝑄2𝑥(𝑘−𝜏(𝑘)).(3.9)Δ𝑉4(𝑘,𝑥(𝑘))≤1+𝑔𝜏−𝜏𝑇(𝑥(𝑘))𝑄3𝑔(𝑥(𝑘))−𝑔𝑇(𝑥(𝑘−𝜏(𝑘)))𝑄3𝑔(𝑥(𝑘−𝜏(𝑘))),Δ𝑉5(𝑘,𝑥(𝑘))≤21+𝜏−𝜏𝑔(𝑥(𝑘))−𝐺1𝑥(𝑘)𝑇𝐷1𝑥(𝑘)−2𝑔(𝑥(𝑘−𝜏(𝑘)))−𝐺1𝑥(𝑘−𝜏(𝑘))𝑇𝐷1𝑥(𝑘−𝜏(𝑘)),Δ𝑉6(𝑘,𝑥(𝑘))≤21+𝐺𝜏−𝜏2𝑥(𝑘)−𝑔(𝑥(𝑘))𝑇𝐷2𝐺𝑥(𝑘)−22𝑥(𝑘−𝜏(𝑘))−𝑔(𝑥(𝑘−𝜏(𝑘)))𝑇𝐷2𝑥(𝑘−𝜏(𝑘)),Δ𝑉7(𝑘,𝑥(𝑘))=𝜂𝑇(𝑘)𝑄41𝜂(𝑘)−𝛿𝑘−1𝑖=𝑘−𝛿𝜂𝑇(𝑖)𝑄4𝜂(𝑖)≤𝜂𝑇(𝑘)𝑄41𝜂(𝑘)−𝛿2𝑘−1𝑖=𝑘−𝛿𝜂𝑇(𝑖)𝑄4𝑘−1𝑖=𝑘−𝛿𝜂(𝑖)=𝑥𝑇(𝑘)(𝐶−𝐼)𝑇𝑄4(𝐶−𝐼)𝑥(𝑘)+2𝑥𝑇(𝑘)(𝐶−𝐼)𝑇𝑄4𝐴𝑔(𝑥(𝑘))+2𝑥𝑇(𝑘)(𝐶−𝐼)𝑇𝑄4𝐵𝑔(𝑥(𝑘−𝜏(𝑘)))+2𝑥𝑇(𝑘)(𝐶−𝐼)𝑇𝑄4𝑢+𝑔𝑇(𝑥(𝑘))𝐴𝑇𝑄4𝐴𝑔(𝑥(𝑘))+2𝑔𝑇(𝑥(𝑘))𝐴𝑇𝑄4𝐵𝑔(𝑥(𝑘−𝜏(𝑘)))+2𝑔𝑇(𝑥(𝑘))𝐴𝑇𝑄4𝑢+𝑔𝑇(𝑥(𝑘−𝜏(𝑘)))𝐵𝑇𝑄4𝐵𝑔(𝑥(𝑘−𝜏(𝑘)))+2𝑔𝑇(𝑥(𝑘−𝜏(𝑘)))𝐵𝑇𝑄4𝑢+𝑢𝑇𝑄4+1𝛿2𝑥(𝑘)𝑥(𝑘−𝛿)𝑇−𝑄4𝑄4𝑄4−𝑄4𝑥.𝑥(𝑘)(𝑘−𝛿)(3.10) Similarly, one has 𝜏≤𝜏(𝑘)≤𝛿 When Δ𝑉8(𝑘,𝑥(𝑘))=𝑥𝑇(𝑘)𝑄5𝑥(𝑘)−𝑥𝑇(𝑘−𝜏)𝑄5+𝑥(𝑘−𝜏)𝛿−𝜏𝜂𝜏−𝛿𝑇(𝑘)𝑄61𝜂(𝑘)−𝜏−𝛿𝑘−𝜏−1𝑖=𝑘−𝛿𝜂𝑇(𝑖)𝑄6𝜂(𝑖)≤𝑥𝑇(𝑘)𝑄5𝑥(𝑘)−𝑥𝑇(𝑘−𝜏)𝑄5𝑥(𝑘−𝜏)+𝜂𝑇(𝑘)𝑄61𝜂(𝑘)−(𝜏−𝛿𝛿−𝜏)𝑘−𝜏−1𝑖=𝑘−𝛿𝜂𝑇(𝑖)𝑄6𝑘−𝜏−1𝑖=𝑘−𝛿𝜂(𝑖)≤−𝑥𝑇(𝑘−𝜏)𝑄5𝑥(𝑘−𝜏)+𝑥𝑇(𝑘)(𝐶−𝐼)𝑇𝑄6(𝐶−𝐼)+𝑄5𝑥(𝑘)+2𝑥𝑇(𝑘)(𝐶−𝐼)𝑇𝑄6𝐴𝑔(𝑥(𝑘))+2𝑥𝑇(𝑘)(𝐶−𝐼)𝑇𝑄6𝐵𝑔(𝑥(𝑘−𝜏(𝑘)))+2𝑥𝑇(𝑘)(𝐶−𝐼)𝑇𝑄6𝑢+𝑔𝑇(𝑥(𝑘))𝐴𝑇𝑄6𝐴𝑔(𝑥(𝑘))+2𝑔𝑇(𝑥(𝑘))𝐴𝑇𝑄6𝐵𝑔(𝑥(𝑘−𝜏(𝑘)))+2𝑔𝑇(𝑥(𝑘))𝐴𝑇𝑄6𝑢+𝑔𝑇(𝑥(𝑘−𝜏(𝑘)))𝐵𝑇𝑄6𝐵𝑔(𝑥(𝑘−𝜏(𝑘)))+2𝑔𝑇(𝑥(𝑘−𝜏(𝑘)))𝐵𝑇𝑄6𝑢+𝑢𝑇𝑄6𝑢+1𝜏−𝛿2𝑥(𝑘−𝜏)𝑥(𝑘−𝛿)𝑇−𝑄6𝑄6𝑄6−𝑄6.𝑥(𝑘−𝜏)𝑥(𝑘−𝛿)(3.11), 𝛿<𝜏(𝑘)≤𝜏 When Δ𝑉8(𝑘,𝑥(𝑘))=𝑥𝑇(𝑘)𝑄5𝑥(𝑘)−𝑥𝑇𝑘−𝜏𝑄5𝑥𝑘−𝜏+𝜂𝑇(𝑘)𝑄61𝜂(𝑘)−𝜏−𝛿𝑘−𝛿−1𝑖=𝑘−𝜏𝜂𝑇(𝑖)𝑄6𝜂(𝑖)≤𝑥𝑇(𝑘)𝑄5𝑥(𝑘)−𝑥𝑇𝑘−𝜏𝑄5𝑥𝑘−𝜏+𝜂𝑇(𝑘)𝑄61𝜂(𝑘)−𝜏−𝛿2𝑘−𝛿−1𝑖=𝑘−𝜏𝜂𝑇(𝑖)𝑄6𝑘−𝛿−1𝑖=𝑘−𝜏𝜂(𝑖)=−𝑥𝑇𝑘−𝜏𝑄5𝑥𝑘−𝜏+𝑥𝑇(𝑘)(𝐶−𝐼)𝑇𝑄6(𝐶−𝐼)+𝑄5𝑥(𝑘)+2𝑥𝑇(𝑘)(𝐶−𝐼)𝑇𝑄6𝐴𝑔(𝑥(𝑘))+2𝑥𝑇(𝑘)(𝐶−𝐼)𝑇𝑄6𝐵𝑔(𝑥(𝑘−𝜏(𝑘)))+2𝑥𝑇(𝑘)(𝐶−𝐼)𝑇𝑄6𝑢+𝑔𝑇(𝑥(𝑘))𝐴𝑇𝑄6𝐴𝑔(𝑥(𝑘))+2𝑔𝑇(𝑥(𝑘))𝐴𝑇𝑄6𝐵𝑔(𝑥(𝑘−𝜏(𝑘)))+2𝑔𝑇(𝑥(𝑘))𝐴𝑇𝑄6𝑢+𝑔𝑇(𝑥(𝑘−𝜏(𝑘)))𝐵𝑇𝑄6𝐵𝑔(𝑥(𝑘−𝜏(𝑘)))+2𝑔𝑇(𝑥(𝑘−𝜏(𝑘)))𝐵𝑇𝑄6𝑢+𝑢𝑇𝑄6𝑢+1𝜏−𝛿2𝑥𝑘−𝜏𝑥(𝑘−𝛿)𝑇−𝑄6𝑄6𝑄6−𝑄6𝑥𝑘−𝜏𝑥.(𝑘−𝛿)(3.12), 𝐻1>0
For positive diagonal matrices 𝐻2>0 and 0≤𝑥(𝑘)𝑔(𝑥(𝑘))𝑇−𝐺3𝐻1𝐺4𝐻1𝐺4𝐻1−𝐻1,𝑥(𝑘)𝑔(𝑥(𝑘))(3.13)0≤𝑥(𝑘−𝜏(𝑘))𝑔(𝑥(𝑘−𝜏(𝑘)))𝑇−𝐺3𝐻2𝐺4𝐻2𝐺4𝐻2−𝐻2.𝑥(𝑘−𝜏(𝑘))𝑔(𝑥(𝑘−𝜏(𝑘)))(3.14), we can get from assumption (H) that [6] 𝛼(𝑘)=(𝑥𝑇(𝑘),𝑔𝑇(𝑥(𝑘)),𝑔𝑇(𝑥(𝑘−𝜏(𝑘))),𝑢𝑇,𝑥𝑇(𝑘−𝛿),𝑥𝑇(𝑘−𝜏(𝑘)),𝜉𝑇(𝑘))𝑇
Denoting 𝑥𝜉(𝑘)=𝑥(𝑘−𝜏),𝜏≤𝜏(𝑘)≤𝛿,𝑘−𝜏,𝛿<𝜏(𝑘)≤𝜏,(3.15), where Δ𝑉(𝑘,𝑥(𝑘))≤𝑥𝑇𝐶(𝑘)𝑇𝑃𝐶−𝑃+𝑄1+1+𝑄𝜏−𝜏2−2𝐺1𝐷1+2𝐺2𝐷2−𝐺3𝐻1+(𝐶−𝐼)𝑇𝑄4+𝑄61(𝐶−𝐼)−𝛿2𝑄4+𝑄5𝑥(𝑘)+2𝑥𝑇(𝐶𝑘)𝑇𝑃𝐴+1+𝐷𝜏−𝜏1−𝐷2+𝐺4𝐻1+(𝐶−𝐼)𝑇𝑄4+𝑄6𝐴𝑔(𝑥(𝑘))+2𝑥𝑇𝐶(𝑘)𝑇𝑃𝐵+(𝐶−𝐼)𝑇𝑄4+𝑄6𝐵𝑔(𝑥(𝑘−𝜏(𝑘)))+2𝑥𝑇𝐶(𝑘)𝑇𝑃+(𝐶−𝐼)𝑇𝑄4+𝑄61𝑢+2𝛿2𝑥𝑇(𝑘)𝑄4𝑥(𝑘−𝛿)+𝑔𝑇𝐴(𝑥(𝑘))𝑇𝑃𝐴+1+𝑄𝜏−𝜏3−𝐻1+𝐴𝑇𝑄4+𝑄6𝐴𝑔(𝑥(𝑘))+2𝑔𝑇𝐴(𝑥(𝑘))𝑇𝑃𝐵+𝐴𝑇𝑄4+𝑄6𝐵𝑔(𝑥(𝑘−𝜏(𝑘)))+2𝑔𝑇𝐴(𝑥(𝑘))𝑇𝑃+𝐴𝑇𝑄4+𝑄6𝑢+𝑔𝑇𝐵(𝑥(𝑘−𝜏(𝑘)))𝑇𝑃𝐵−𝑄3−𝐻2+𝐵𝑇𝑄4+𝑄6𝐵𝑔(𝑥(𝑘−𝜏(𝑘)))+2𝑔𝑇𝐵(𝑥(𝑘−𝜏(𝑘)))𝑇𝑃+𝐵𝑇𝑄4+𝑄6𝑢+2𝑔𝑇(𝑥(𝑘−𝜏(𝑘)))−𝐷1+𝐷2+𝐺4𝐻2𝑥(𝑘−𝜏(𝑘))+𝑢𝑇𝑃+𝑄4+𝑄6𝑢+𝑥𝑇(𝑘−𝛿)−𝑄1−1𝛿2𝑄4−1𝜏−𝛿2𝑄61𝑥(𝑘−𝛿)+2𝜏−𝛿2𝑥𝑇(𝑘−𝛿)𝑄6𝜉(𝑘)+𝑥𝑇(𝑘−𝜏(𝑘))−𝑄2+2𝐺1𝐷1−2𝐺2𝐷2−𝐺3𝐻2𝑥(𝑘−𝜏(𝑘))+𝑥𝑇(𝑘−𝜏)−𝑄5−1𝜏−𝛿2𝑄6𝑥(𝑘−𝜏)=−𝑥𝑇(𝑘)𝑊𝑥(𝑘)+𝑢𝑇𝑅𝑢+𝛼𝑇(𝑘)Π𝛼(𝑘).(3.16) it follows from (3.7) to (3.14) that Δ𝑉(𝑘,𝑥(𝑘))≤−𝑥𝑇(𝑘)𝑊𝑥(𝑘)+𝑢𝑇𝑅𝑢≤−𝜆min(𝑊)‖𝑥‖2+𝑢𝑇𝑅𝑢<0,(3.17) From condition (3.2) and inequality (3.16), we get 𝑥∈ℝ𝑛⧵𝑆 when 𝑥∉𝑆, that is, 𝑆. Therefore, discrete-time neural network (2.1) is a globally dissipative system, and the set 𝑢𝑆=𝑥∶‖𝑥‖≤𝑇𝑅𝑢𝜆min(𝑊)1/2(3.18) is a positive invariant and globally attractive set as LMI (3.2) holds. The proof is completed.

Next, we are now in a position to discuss the global exponential dissipativity of discrete-time neural network (2.1) as follows.

Theorem 3.2. Under the conditions of Theorem 3.1, neural network (2.1) is globally exponentially dissipative, and 𝑥∈ℝ𝑛⧵𝑆 is a positive invariant and globally attractive set.

Proof. When 𝑥∉𝑆, that is, Δ𝑉(𝑘,𝑥(𝑘))≤−𝜆min‖(−Π)‖𝑥(𝑘)2.(3.19), we know from (3.16) that 𝑉(𝑘) From the definition of 𝑉(𝑘)≤𝜆max(𝑃)‖𝑥(𝑘)‖2+𝜌𝑘−1𝑖=𝑘−𝜏‖𝑥(𝑖)‖2,(3.20) in (3.5), it is easy to verify that 𝜌=𝜆max𝑄1+1+𝜆𝜏−𝜏max𝑄2+𝜆max𝑄3𝜆max(𝐿)+2𝜆max𝐿𝐷1+2𝜆max||𝐺1𝐷1||+2𝜆max𝐿𝐷2+2𝜆max||𝐺2𝐷2||+4𝜏𝛿𝜆max𝑄4+𝜆max𝑄5+4𝜆𝜏−𝜏max𝑄6.(3.21) where 𝜇>1 For any scalar 𝜇𝑗+1𝑉(𝑗+1)−𝜇𝑗𝑉(𝑗)=𝜇𝑗+1Δ𝑉(𝑗)+𝜇𝑗≤𝜇(𝜇−1)𝑉(𝑗)𝑗(𝜇−1)𝜆max(𝑃)−𝜇𝑗+1𝜆min(−Π)‖𝑥(𝑗)‖2+𝜌𝜇𝑗(𝜇−1)𝑗−1𝑖=𝑗−𝜏‖𝑥(𝑖)‖2.(3.22), it follows from (3.19) and (3.20) that 0 Summing up both sides of (3.22) from 𝑘−1 to 𝑗 with respect to 𝜇𝑘𝑉(𝑘)−𝑉(0)≤(𝜇−1)𝜆max(𝑃)−𝜇𝜆min(−Π)𝑘−1𝑗=0𝜇𝑗‖𝑥(𝑗)‖2+𝜌(𝜇−1)𝑘−1𝑗=0𝑗−1𝑖=𝑗−𝜏𝜇𝑗‖𝑥(𝑖)‖2.(3.23), we have 𝑘−1𝑗=0𝑗−1𝑖=𝑗−𝜏𝜇𝑗‖𝑥(𝑖)‖2≤⎛⎜⎜⎝−1𝑖=−𝜏𝑖+𝜏𝑗=0+𝑘−1−𝜏𝑖=0𝑖+𝜏𝑗=𝑖+1+𝑘−1𝑖=𝑘−𝜏𝑘−1𝑗=𝑖+1⎞⎟⎟⎠𝜇𝑗‖𝑥(𝑖)‖2≤𝜏𝜇𝜏sup𝑠∈𝑁[−𝜏,0]‖𝑥(𝑠)‖2+𝜏𝜇𝜏𝑘−1𝑖=0𝜇𝑖‖𝑥(𝑖)‖2.(3.24) It is easy to compute that 𝑉𝜆(0)≤max(𝑃)+𝜌𝜏sup𝑠∈𝑁[−𝜏,0]‖𝑥(𝑠)‖2.(3.25) From (3.20), we obtain 𝜇𝑘𝑉(𝑘)≤𝐿1(𝜇)sup𝑠∈𝑁[−𝜏,0]‖𝑥(𝑠)‖2+𝐿2(𝜇)𝑘𝑗=0𝜇𝑖‖𝑥(𝑖)‖2,(3.26) It follows from (3.23)–(3.25) that 𝐿1(𝜇)=𝜆max(𝑃)+𝜌𝜏+𝜌(𝜇−1)𝜏𝜇𝜏,𝐿2(𝜇)=(𝜇−1)𝜆max(𝑃)−𝜇𝜆min(−Π)+𝜌(𝜇−1)𝜏𝜇𝜏.(3.27) where 𝐿2(1)<0 Since 𝐿2(𝜇), by the continuity of functions 𝛾>1, we can choose a scalar 𝐿2(𝛾)≤0 such that 𝐿1(𝛾)>0. Obviously, 𝛾𝑘𝑉(𝑘)≤𝐿1(𝛾)sup𝑠∈𝑁[−𝜏,0]‖𝑥(𝑠)‖2.(3.28). From (3.26), we get 𝑉(𝑘)
From the definition of 𝑉(𝑘)≥𝜆min(𝑃)‖𝑥(𝑘)‖2.(3.29) in (3.5), we have √𝑀=𝐿1(𝛾)/𝜆min(𝑃) Let √𝛽=1/𝛾, 𝑀>0, then 0<𝛽<1, ‖𝑥(𝑘)‖≤𝑀𝛽𝑘sup𝑠∈𝑁[−𝜏,0]‖‖𝑥(𝑠)(3.30). It follows from (3.28) and (3.29) that 𝑘∈ℕ for all 𝑆, which means that discrete-time neural network (2.1) is globally exponentially dissipative, and the set 𝐺−𝑗 is a positive invariant and globally attractive set as LMI (3.2) holds. The proof is completed.

Remark 3.3. In the study on dissipativity of neural networks, the assumption (H) of this paper is as same as that in [28], the constants 𝐺+𝑗 and 𝑗=1,2,…,𝑛 ([𝜏,𝜏]) in assumption (H) of this paper are allowed to be positive, negative, or zero. Hence, assumption (H), first proposed by Liu et al. in [6], is weaker than the assumption in [23–27, 30].

Remark 3.4. The idea of constructing Lyapunov-Krasovskii functional (3.5) is that we divide the delay interval [𝜏,𝛿] into two subintervals [𝛿,𝜏] and 𝜏(𝑘), thus the proposed Lyapunov-Krasovskii functional is different when the time-delay 𝜏(𝑘) belongs to different subinterval. The main advantage of such Lyapunov-Krasovskii functional is that it makes full use of the information on the considered time-delay 𝑥(𝑘+1)=(𝐶+Δ𝐶(𝑘))𝑥(𝑘)+(𝐴+Δ𝐴(𝑘))𝑔(𝑥(𝑘))+(𝐵+Δ𝐵(𝑘))𝑔(𝑥(𝑘−𝜏(𝑘)))+𝑢,(3.31).

Now, let us consider the case when the parameter uncertainties appear in the discrete-time neural networks with time-varying delays. In this case, model (2.1) can be further generalized to the following one:

𝐶 where 𝐴, 𝐵, Δ𝐶(𝑘) are known real constant matrices, and the time-varying matrices Δ𝐴(𝑘), Δ𝐵(𝑘) and 𝑁Δ𝐶(𝑘)Δ𝐴(𝑘)Δ𝐵(𝑘)=𝑀𝐹(𝑘)1𝑁2𝑁3,(3.32) represent the time-varying parameter uncertainties that are assumed to satisfy the following admissible condition:

𝑀 where 𝑁𝑖(𝑖=1,2,3) and 𝐹(𝑘) are known real constant matrices, and 𝐹𝑇(𝑘)𝐹(𝑘)≤𝐼.(3.33) is the unknown time-varying matrix-valued function subject to the following condition:

𝑃>0

For model (3.31), we have the following result readily.

Theorem 3.5. Suppose that (H) holds. If there exist nine symmetric positive definite matrices 𝑊>0, 𝑅>0, 𝑄𝑖>0(𝑖=1,2,3,4,5,6), 𝐷𝑖>0(𝑖=1,2), and four positive diagonal matrices 𝐻𝑖>0(𝑖=1,2), ⎡⎢⎢⎢⎢⎢⎢⎣ΓΓ=1Γ2Γ3Γ40𝜀Γ5∗−𝑃00𝑃𝑀0∗∗−𝑄40𝑄4𝑀0∗∗∗−𝑄6𝑄6⎤⎥⎥⎥⎥⎥⎥⎦𝑀0∗∗∗∗−𝜀𝐼0∗∗∗∗∗−𝜀𝐼<0,(3.34), such that the following LMI holds: Γ1=⎡⎢⎢⎢⎢⎢⎢⎢⎢⎣Ω11Ω1200Ω1500∗Ω2200000∗∗Ω3300Ω360∗∗∗Ω44000∗∗∗∗Ω550Ω57∗∗∗∗∗Ω660∗∗∗∗∗∗Ω77⎤⎥⎥⎥⎥⎥⎥⎥⎥⎦,Γ2=𝑃𝐶𝑃𝐴𝑃𝐵𝑃000𝑇,Γ3=𝑄4(𝐶−𝐼)𝑄4𝐴𝑄4𝐵𝑄4000𝑇,Γ4=𝑄6(𝐶−𝐼)𝑄6𝐴𝑄6𝐵𝑄6,Γ0005=𝑁1𝑁2𝑁3,0000(3.35) where Ω11=−𝑃+𝑄1+(1+𝜏−𝜏)(𝑄2−2𝐺1𝐷1+2𝐺2𝐷2)−𝐺3𝐻1−(1/𝛿2)𝑄4+𝑄5+𝑊 and Ω12=(1+𝜏−𝜏)(𝐷1−𝐷2)+𝐺4𝐻1, Ω15=(1/𝛿2)𝑄4, Ω22=(1+𝜏−𝜏)𝑄3−𝐻1, Ω33=−𝑄3−𝐻2, Ω36=−𝐷1+𝐷2+𝐺4𝐻2, Ω44=−𝑅, Ω55=−𝑄1−(1/𝛿2)𝑄4−(1/(𝜏−𝛿)2)𝑄6, Ω57=(1/(𝜏−𝛿)2)𝑄6, Ω66=−𝑄2+2𝐺1𝐷1−2𝐺2𝐷2−𝐺3𝐻2, Ω77=−𝑄5−(1/(𝜏−𝛿)2)𝑄6,, and 𝑢𝑆=𝑥∶‖𝑥‖≤𝑇𝑅𝑢𝜆min(𝑊)1/2(3.36) then uncertain discrete-time neural network (3.31) is globally dissipative and globally exponentially dissipative, and ⎡⎢⎢⎢⎣Γ1Γ2Γ3Γ4∗−𝑃00∗∗−𝑄40∗∗∗−𝑄6⎤⎥⎥⎥⎦+𝜀−1⎡⎢⎢⎢⎣0𝑄𝑃𝑀4𝑀𝑄6𝑀⎤⎥⎥⎥⎦⎡⎢⎢⎢⎣0𝑄𝑃𝑀4𝑀𝑄6𝑀⎤⎥⎥⎥⎦𝑇⎡⎢⎢⎢⎣Γ+𝜀5000⎤⎥⎥⎥⎦⎡⎢⎢⎢⎣Γ5000⎤⎥⎥⎥⎦𝑇<0.(3.37) is a positive invariant and globally attractive set.

Proof. By Lemma 2.3, we know that LMI (3.34) is equivalent to the following inequality: ⎡⎢⎢⎢⎣Γ1Γ2Γ3Γ4∗−𝑃00∗∗−𝑄40∗∗∗−𝑄6⎤⎥⎥⎥⎦+⎡⎢⎢⎢⎣0𝑄𝑃𝑀4𝑀𝑄6𝑀⎤⎥⎥⎥⎦⎡⎢⎢⎢⎣Γ𝐹(𝑘)5000⎤⎥⎥⎥⎦𝑇+⎡⎢⎢⎢⎣Γ5000⎤⎥⎥⎥⎦𝐹𝑇⎡⎢⎢⎢⎣0𝑄(𝑘)𝑃𝑀4𝑀𝑄6𝑀⎤⎥⎥⎥⎦𝑇<0,(3.38) From Lemma 2.4, we know that (3.37) is equivalent to the following inequality: ⎡⎢⎢⎢⎢⎣Γ1Γ2+Γ5𝐹𝑇(𝑘)𝑀𝑇𝑃Γ3+Γ5𝐹𝑇(𝑘)𝑀𝑇𝑄4Γ4+Γ5𝐹𝑇(𝑘)𝑀𝑇𝑄6∗−𝑃00∗∗−𝑄40∗∗∗−𝑄6⎤⎥⎥⎥⎥⎦<0.(3.39) that is Φ=Γ2+Γ5𝐹𝑇(𝑘)𝑀𝑇𝑃 Let Ψ=Γ3+Γ5𝐹𝑇(𝑘)𝑀𝑇𝑄4, Υ=Γ4+Γ5𝐹𝑇(𝑘)𝑀𝑇𝑄6, Γ1+Φ𝑃−1Φ𝑇+Ψ𝑄4−1Ψ𝑇+Υ𝑄6−1Υ𝑇<0.(3.40). As an application of Lemma 2.3, we know that (3.39) is equivalent to the following inequality: [Δ𝐶(𝑘)Δ𝐴(𝑘)Δ𝐵(𝑘)]=𝑀𝐹(𝑘)[𝑁1𝑁2𝑁3] By simple computation and noting that Φ=𝑃(𝐶+Δ𝐶)𝑃(𝐴+Δ𝐴)𝑃(𝐵+Δ𝐵)𝑃000𝑇,𝑄Ψ=4(𝐶+Δ𝐶−𝐼)𝑄4(𝐴+Δ𝐴)𝑄4(𝐵+Δ𝐵)𝑄4000𝑇,𝑄Υ=6(𝐶+Δ𝐶−𝐼)𝑄6(𝐴+Δ𝐴)𝑄6(𝐵+Δ𝐵)𝑄6000𝑇.(3.41), we have 𝐶+Δ𝐶 Therefore, inequality (3.40) is just the same as inequality (3.2) when we use 𝐴+Δ𝐴, 𝐵+Δ𝐵, 𝐶 to replace 𝐴, 𝐵, 𝑢𝑆=𝑥∶‖𝑥‖≤𝑇𝑅𝑢𝜆min(𝑊)1/2(3.42) of inequality (3.2), respectively. From Theorems 3.1 and 3.2, we know that uncertain discrete-time neural network (3.31) is globally dissipative and globally exponentially dissipative, and ,𝑔𝐶=0.04000.01,𝐴=0.010.08−0.050.02,𝐵=−0.050.010.020.07,𝑢=−0.210.141(𝑥)=tanh(0.7𝑥)−0.1sin𝑥,𝑔2(𝑥)=tanh(0.4𝑥)+0.2cos𝑥,𝜏(𝑘)=7−2sin𝑘𝜋2.(4.1) is a positive invariant and globally attractive set. The proof is then completed.

4. Examples

Example 4.1. Consider a discrete-time neural network (2.1) with 𝐺−1=−0.1
It is easy to check that assumption (H) is satisfied, and 𝐺+1=0.8, 𝐺−2=−0.2, 𝐺+2=0.6, 𝜏=5, 𝜏=9, 𝐺1=−0.100−0.2,𝐺2=0.8000.6,𝐺3=−0.0800−0.12,𝐺4=0.35000.2,𝛿=7.(4.2). Thus, 𝑄1=7.1693−0.0107−0.01077.3526,𝑄2=1.5095−0.0059−0.00591.6330,𝑄3=,𝑄2.24550.03360.03362.71584=2.3895−0.0065−0.00651.8946,𝑄5=7.1927−0.0108−0.01087.3714,𝑄6=,,𝐷2.4575−0.0064−0.00641.8764𝑃=57.3173−0.0727−0.072757.7631,𝑊=5.0249−0.0110−0.01105.1411,𝑅=72.23680.04450.044571.49161=1.2817001.7411,𝐷2=,𝐻2.1180002.31571=19.79460023.7062,𝐻2=.9.11100010.5938(4.3) By the Matlab LMI Control Toolbox, we can find a solution to the LMI in (3.2) as follows: 𝑆={𝑥∶‖𝑥‖≤0.9553} Therefore, by Theorem 3.1, we know that model (2.1) with above given parameters is globally dissipative and globally exponentially dissipative. It is easy to compute that the positive invariant and global attractive set are ,𝑔𝐶=0.12000.68,𝐴=16.7425.38.4,𝐵=−9.9−29.719.2−19.7,𝑢=10.9−3.41(𝑥)=tanh(0.7𝑥)−0.1sin𝑥,𝑔2(𝑥)=tanh(0.4𝑥)+0.2cos𝑥,𝜏(𝑘)=7−2sin𝑘𝜋2.(4.4).

The following example is given to illustrate that when the sufficient conditions ensuring the global dissipativity are not satisfied, the complex dynamics will appear.

Example 4.2. Consider a discrete-time neural network (2.1) with 𝐺𝑖(𝑖=1,2,3,4) It is easy to check that the linear matrix inequality (3.2) with 𝛿 and 𝑥1(𝑠)=0.5 of Example 4.1 has not a feasible solution. Figure 1 depicts the states of the considered neural network (2.1) with initial conditions 𝑥2(𝑠)=0.45, 𝑠∈ℕ[−9,0], 𝑥1(𝑘). One can see from Figure 1 that the chaos behaviors have appeared for neural network (2.1) with above given parameters.

810408.fig.001
Figure 1: State responses of 𝑥2(𝑘) and 𝜃.

5. Conclusions

In this paper, the global dissipativity and global exponential dissipativity have been investigated for uncertain discrete-time neural networks with time-varying delays and general activation functions. By constructing appropriate Lyapunov-Krasovskii functionals and employing linear matrix inequality technique, several new delay-dependent criteria for checking the global dissipativity and global exponential dissipativity of the addressed neural networks have been derived in terms of LMI, which can be checked numerically using the effective LMI toolbox in MATLAB. Illustrated examples are also given to show the effectiveness of the proposed criteria. It is noteworthy that because neither model transformation nor free weighting matrices are employed to deal with cross terms in the derivation of the dissipativity criteria, the obtained results are less conservative and more computationally efficient.

Acknowledgments

The authors would like to thank the reviewers and the editor for their valuable suggestions and comments which have led to a much improved paper. This work was supported by the National Natural Science Foundation of China under Grants 60974132, 60874088, and 10772152.

References

  1. K. Gopalsamy and X.-Z. He, “Delay-independent stability in bidirectional associative memory networks,” IEEE Transactions on Neural Networks, vol. 5, no. 6, pp. 998–1002, 1994. View at Publisher · View at Google Scholar · View at Scopus
  2. M. Forti, “On global asymptotic stability of a class of nonlinear systems arising in neural network theory,” Journal of Differential Equations, vol. 113, no. 1, pp. 246–264, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. S. Arik, “An analysis of exponential stability of delayed neural networks with time varying delays,” Neural Networks, vol. 17, no. 7, pp. 1027–1031, 2004. View at Publisher · View at Google Scholar · View at Scopus
  4. D. Xu and Z. Yang, “Impulsive delay differential inequality and stability of neural networks,” Journal of Mathematical Analysis and Applications, vol. 305, no. 1, pp. 107–120, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. T. Chen, W. Lu, and G. Chen, “Dynamical behaviors of a large class of general delayed neural networks,” Neural Computation, vol. 17, no. 4, pp. 949–968, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. Y. Liu, Z. Wang, and X. Liu, “Global exponential stability of generalized recurrent neural networks with discrete and distributed delays,” Neural Networks, vol. 19, no. 5, pp. 667–675, 2006. View at Publisher · View at Google Scholar · View at Scopus
  7. X. Liao, Q. Luo, Z. Zeng, and Y. Guo, “Global exponential stability in Lagrange sense for recurrent neural networks with time delays,” Nonlinear Analysis: Real World Applications, vol. 9, no. 4, pp. 1535–1557, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. H. Zhang, Z. Wang, and D. Liu, “Global asymptotic stability of recurrent neural networks with multiple time-varying delays,” IEEE Transactions on Neural Networks, vol. 19, no. 5, pp. 855–873, 2008. View at Publisher · View at Google Scholar · View at Scopus
  9. J. H. Park and O. M. Kwon, “Further results on state estimation for neural networks of neutral-type with time-varying delay,” Applied Mathematics and Computation, vol. 208, no. 1, pp. 69–75, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. S. Xu, W. X. Zheng, and Y. Zou, “Passivity analysis of neural networks with time-varying delays,” IEEE Transactions on Circuits and Systems II, vol. 56, no. 4, pp. 325–329, 2009. View at Publisher · View at Google Scholar · View at Scopus
  11. J.-C. Ban, C.-H. Chang, S.-S. Lin, and Y.-H. Lin, “Spatial complexity in multi-layer cellular neural networks,” Journal of Differential Equations, vol. 246, no. 2, pp. 552–580, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. Z. Wang, Y. Liu, and X. Liu, “State estimation for jumping recurrent neural networks with discrete and distributed delays,” Neural Networks, vol. 22, no. 1, pp. 41–48, 2009. View at Publisher · View at Google Scholar · View at Scopus
  13. J. H. Park, C. H. Park, O. M. Kwon, and S. M. Lee, “A new stability criterion for bidirectional associative memory neural networks of neutral-type,” Applied Mathematics and Computation, vol. 199, no. 2, pp. 716–722, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. H. J. Cho and J. H. Park, “Novel delay-dependent robust stability criterion of delayed cellular neural networks,” Chaos, Solitons and Fractals, vol. 32, no. 3, pp. 1194–1200, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. J. H. Park, “Robust stability of bidirectional associative memory neural networks with time delays,” Physics Letters A, vol. 349, no. 6, pp. 494–499, 2006. View at Publisher · View at Google Scholar · View at Scopus
  16. J. H. Park, S. M. Lee, and H. Y. Jung, “LMI optimization approach to synchronization of stochastic delayed discrete-time complex networks,” Journal of Optimization Theory and Applications, vol. 143, no. 2, pp. 357–367, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  17. S. Mohamad and K. Gopalsamy, “Exponential stability of continuous-time and discrete-time cellular neural networks with delays,” Applied Mathematics and Computation, vol. 135, no. 1, pp. 17–38, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. S. Hu and J. Wang, “Global robust stability of a class of discrete-time interval neural networks,” IEEE Transactions on Circuits and Systems. I, vol. 53, no. 1, pp. 129–138, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  19. H. Gao and T. Chen, “New results on stability of discrete-time systems with time-varying state delay,” IEEE Transactions on Automatic Control, vol. 52, no. 2, pp. 328–334, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  20. Z. Wu, H. Su, J. Chu, and W. Zhou, “Improved result on stability analysis of discrete stochastic neural networks with time delay,” Physics Letters A, vol. 373, no. 17, pp. 1546–1552, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  21. J. Cao and F. Ren, “Exponential stability of discrete-time genetic regulatory networks with delays,” IEEE Transactions on Neural Networks, vol. 19, no. 3, pp. 520–523, 2008. View at Publisher · View at Google Scholar · View at Scopus
  22. J. K. Hale, Asymptotic Behavior of Dissipative Systems, vol. 25 of Mathematical Surveys and Monographs, American Mathematical Society, Providence, RI, USA, 1988. View at MathSciNet
  23. X. Liao and J. Wang, “Global dissipativity of continuous-time recurrent neural networks with time delay,” Physical Review E, vol. 68, no. 1, Article ID 016118, p. 7, 2003. View at Publisher · View at Google Scholar · View at MathSciNet
  24. S. Arik, “On the global dissipativity of dynamical neural networks with time delays,” Physics Letters A, vol. 326, no. 1-2, pp. 126–132, 2004. View at Publisher · View at Google Scholar · View at Scopus
  25. Q. Song and Z. Zhao, “Global dissipativity of neural networks with both variable and unbounded delays,” Chaos, Solitons and Fractals, vol. 25, no. 2, pp. 393–401, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  26. X. Y. Lou and B. T. Cui, “Global robust dissipativity for integro-differential systems modeling neural networks with delays,” Chaos, Solitons and Fractals, vol. 36, no. 2, pp. 469–478, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  27. J. Cao, K. Yuan, D. W. C. Ho, and J. Lam, “Global point dissipativity of neural networks with mixed time-varying delays,” Chaos, vol. 16, no. 1, Article ID 013105, 9 pages, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  28. Q. Song and J. Cao, “Global dissipativity analysis on uncertain neural networks with mixed time-varying delays,” Chaos, vol. 18, no. 4, Article ID 043126, 10 pages, 2008. View at Publisher · View at Google Scholar · View at Scopus
  29. W. M. Haddad and V. S. Chellaboina, “Stability and dissipativity theory for nonnegative dynamical systems: a unified analysis framework for biological and physiological systems,” Nonlinear Analysis: Real World Applications, vol. 6, no. 1, pp. 35–65, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  30. Y. Huang, D. Xu, and Z. Yang, “Dissipativity and periodic attractor for non-autonomous neural networks with time-varying delays,” Neurocomputing, vol. 70, no. 16–18, pp. 2953–2958, 2007. View at Publisher · View at Google Scholar · View at Scopus
  31. H. Tian, N. Guo, and A. Shen, “Dissipativity of delay functional differential equations with bounded lag,” Journal of Mathematical Analysis and Applications, vol. 355, no. 2, pp. 778–782, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  32. M. S. Mahmoud, Y. Shi, and F. M. AL-Sunni, “Dissipativity analysis and synthesis of a class of nonlinear systems with time-varying delays,” Journal of the Franklin Institute, vol. 346, no. 6, pp. 570–592, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  33. S. Gan, “Dissipativity of θ-methods for nonlinear delay differential equations of neutral type,” Applied Numerical Mathematics, vol. 59, no. 6, pp. 1354–1365, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  34. S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory, vol. 15 of SIAM Studies in Applied Mathematics, SIAM, Philadelphia, Pa, USA, 1994. View at MathSciNet
  35. P. P. Khargonekar, I. R. Petersen, and K. Zhou, “Robust stabilization of uncertain linear systems: quadratic stabilizability and H∞ control theory,” IEEE Transactions on Automatic Control, vol. 35, no. 3, pp. 356–361, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  36. L. Xie, M. Fu, and C. E. de Souza, “H∞-control and quadratic stabilization of systems with parameter uncertainty via output feedback,” IEEE Transactions on Automatic Control, vol. 37, no. 8, pp. 1253–1256, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet