Abstract
A class of discrete-time recurrent neural networks for solving quadratic optimization problems over bound constraints is studied. The regularity and completeness of the network are discussed. The network is proven to be globally exponentially stable (GES) under some mild conditions. The analysis of GES extends the existing stability results for discrete-time recurrent networks. A simulation example is included to validate the theoretical results obtained in this letter.
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.
