Abstract
The problem of dissipativity analysis for a class of discrete-time stochastic neural networks with discrete and finite-distributed delays is considered in this paper. System parameters are described by a discrete-time Markov chain. A discretized Jensen inequality and lower bounds lemma are employed to reduce the number of decision variables and to deal with the involved finite sum quadratic terms in an efficient way. A sufficient condition is derived to ensure that the neural networks under consideration is globally delay-dependent asymptotically stable in the mean square and strictly (Z,S,G)-α-dissipative. Next, the case in which the transition probabilities of the Markovian channels are partially known is discussed. Numerical examples are given to emphasize the merits of reduced conservatism of the developed results.
| Original language | English |
|---|---|
| Pages (from-to) | 292-310 |
| Number of pages | 19 |
| Journal | Applied Mathematics and Computation |
| Volume | 228 |
| DOIs | |
| State | Published - 1 Feb 2014 |
Bibliographical note
Funding Information:The authors would like to thank the reviewers for their helpful comments on our submission. This work is supported by the deanship of scientific research (DSR) at KFUPM through research group project No. RG-1316-1.
Keywords
- Delay-dependent stability
- Dissipativity
- Markov chain
- Neural networks
- Partially known transition matrix
- Time-delays
ASJC Scopus subject areas
- Computational Mathematics
- Applied Mathematics