Delay-dependent criterion for exponential stability analysis of neural networks with time-varying delays

This note investigates the problem of exponential stability of neural networks with time-varying delays. To derive a less conservative stability condition, a novel augmented Lyapunov-Krasovskii functional (LKF) which includes triple and quadruple-integral terms is employed. In order to reduce the complexity of the stability test, the convex combination method is utilized to derive an improved delay dependent stability criterion in the form of linear matrix inequalities (LMIs). The superiority of the proposed approach is demonstrated by two comparative examples

New delay-dependent stability criteria for recurrent neural networks with time-varying delays

Dimirovski, Georgi M. (Dogus Author)This work is concerned with the delay-dependentstability problem for recurrent neural networks with time-varying delays. A new improved delay-dependent stability criterion expressed in terms of linear matrix inequalities is derived by constructing a dedicated Lyapunov-Krasovskii functional via utilizing Wirtinger inequality and convex combination approach. Moreover, a further improved delay-dependent stability criterion is established by means of a new partitioning method for bounding conditions on the activation function and certain new activation function conditions presented. Finally, the application of these novel results to an illustrative example from the literature has been investigated and their effectiveness is shown via comparison with the existing recent ones

New summation inequalities and their applications to discrete-time delay systems

This paper provides new summation inequalities in both single and double forms to be used in stability analysis of discrete-time systems with time-varying delays. The potential capability of the newly derived inequalities is demonstrated by establishing less conservative stability conditions for a class of linear discrete-time systems with an interval time-varying delay in the framework of linear matrix inequalities. The effectiveness and least conservativeness of the derived stability conditions are shown by academic and practical examples.Comment: 15 pages, 01 figur

A novel descriptor redundancy method based on delay partition for exponential stability of time delay systems

This is an Author's Accepted Manuscript of an article published in Antonio González (2021) A novel descriptor redundancy method based on delay partition for exponential stability of time delay systems, International Journal of Systems Science, 52:8, 1707-1718, DOI: 10.1080/00207721.2020.1869344, available online at: http://www.tandfonline.com/10.1080/00207721.2020.1869344[EN] This paper investigates the exponential stability of uncertain time delay systems using a novel descriptor redundancy approach based on delay partitioning. First, the original system is casted into an equivalent descriptor singular state¿space representation by introducing redundant state variables so that the resulting delay is progressively reduced. From the equivalent model and applying Lyapunov Functional method, a sufficient condition based on Linear Matrix Inequalities (LMIs) for exponential stability with guaranteed decay rate performance is obtained. As a result, the inherent conservatism of Lyapunov¿Krasovskii functional techniques can arbitrarily be reduced by increasing the number of delay partition intervals including decay rate performance and model uncertainties in polytopic form. Various benchmark examples are provided to validate the effectiveness of the proposed method, showing better trade-off between conservatism and performance in comparison to previous approaches.This work was supported by project PGC2018-098719-B-I00 (MCIU/AEI/FEDER,UE).González Sorribes, A. (2021). A novel descriptor redundancy method based on delay partition for exponential stability of time delay systems. International Journal of Systems Science. 52(8):1707-1718. https://doi.org/10.1080/00207721.2020.18693441707171852

An improved stability criterion for linear time-varying delay systems

This paper considers the stability problem of linear systems with time-varying delays. A modified Lyapunov–Krasovskii functional (LKF) is constructed, which consists of delay-dependent matrices and double integral items under two time-varying subintervals. Based on the modified LKF, a less conservative stability criterion than some previous ones is derived. Furthermore, to obtain a tighter bound of the integral terms, the quadratic generalized free-weighting matrix inequality (QGFMI) is fully applied to different delay subintervals, which further reduces the conservatism of the stability criterion. Finally, three numerical examples are presented to show the effectiveness of the proposed approach

STABILITY, FINITE-TIME STABILITY AND PASSIVITY CRITERIA FOR DISCRETE-TIME DELAYED NEURAL NETWORKS

In this paper, we present the problem of stability, finite-time stability and passivity for discrete-time neural networks (DNNs) with variable delays. For the purposes of stability analysis, an augmented Lyapunov-Krasovskii functional (LKF) with single and double summation terms and several augmented vectors is proposed by decomposing the time-delay interval into two non-equidistant subintervals. Then, by using the Wirtinger-based inequality, reciprocally and extended reciprocally convex combination lemmas, tight estimations for sum terms in the forward difference of LKF are given. In order to relax the existing results, several zero equalities are introduced and stability criteria are proposed in terms of linear matrix inequalities (LMIs). The main objective for the finite-time stability and passivity analysis is how to effectively evaluate the finite-time passivity conditions for DNNs. To achieve this, some weighted summation inequalities are proposed for application to a finite-sum term appearing in the forward difference of LKF, which helps to ensure that the considered delayed DNN is passive. The derived passivity criteria are presented in terms of linear matrix inequalities. Some numerical examples are presented to illustrate the proposed methodology