Abstract
AbstractThe paper addresses complete stability (CS) of the important class of neural networks to solve linear and quadratic programming problems introduced by Kennedy and Chua (IEEE Trans. Circuits Syst., 1988; 35: 554). By CS it is meant that each trajectory converges to a stationary state, i.e. an equilibrium point of the neural network. It is shown that the neural networks in (IEEE Trans. Circuits Syst., 1988; 35: 554) enjoy the property of CS even in the most general case where there are infinite non‐isolated equilibrium points. This result, which is proved by exploiting a new method to analyse CS (Int. J. Bifurcation Chaos 2001; 11: 655), extends the stability analysis by Kennedy and Chua (IEEE Trans. Circuits Syst., 1988; 35: 554) to situations of interest where the optimization problems have infinite solutions. Copyright © 2002 John Wiley & Sons, Ltd.
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 callMore From: International Journal of Circuit Theory and Applications
Disclaimer: 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.
