Abstract

The reduced-order filtering problems are investigated in this paper for static neural networks with Markovian jumping parameters and mode-dependent time-varying delays. By fully making use of integral inequalities, the designs of reduced-order and filters are discussed. The proper gain matrices of filters and the optimal performance indices are efficiently obtained by resolving corresponding convex optimization problems with the constraints of linear matrix inequalities. It is verified that the computational complexity for the reduced-order filter design is significantly reduced when compared with the full-order one. Furthermore, the nonfragile reduced-order filtering problems are also resolved in this paper. Two examples with simulation results are presented to demonstrate the feasibility and application of the established results.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call