Please use this identifier to cite or link to this item:
|Title:||Global exponential stability of discrete-time neural networks for constrained quadratic optimization|
|Authors:||Tan, K.C. |
|Keywords:||Discrete-time neural networks|
Global exponential stability
|Citation:||Tan, K.C., Tang, H.J., Yi, Z. (2004-01). Global exponential stability of discrete-time neural networks for constrained quadratic optimization. Neurocomputing 56 (1-4) : 399-406. ScholarBank@NUS Repository. https://doi.org/10.1016/S0925-2312(03)00442-9|
|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. © 2003 Elsevier B.V. All rights reserved.|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 17, 2018
WEB OF SCIENCETM
checked on Jun 27, 2018
checked on Jul 6, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.