Abstract
In this article, several improved stability criteria for time-varying delayed neural networks (DNNs) are proposed. A degree-dependent polynomial-based reciprocally convex matrix inequality (RCMI) is proposed for obtaining less conservative stability criteria. Unlike previous RCMIs, the matrix inequality in this article produces a polynomial of any degree in the time-varying delay, which helps to reduce conservatism. In addition, to reduce the computational complexity caused by dealing with the negative definite of the high-degree terms, an improved lemma is presented. Applying the above matrix inequalities and improved negative definiteness condition helps to generate a more relaxed stability criterion for analyzing time-varying DNNs. Two examples are provided to illustrate this statement.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
