Related Experiment Videos
Convergence analysis of a discrete-time recurrent neural network to perform quadratic real optimization with bound
1Departamento de Automática y Computacíon, Universidad Pública de Navarra, Campus de Arrosadía s/n, Pamplona, 31006 Navarra, Spain.
Abstract:
This paper presents a model of a discrete-time recurrent neural network designed to perform quadratic real optimization with bound constraints. The network iteratively improves the estimate of the solution, always maintaining it inside of the feasible region. Several neuron updating rules which assure global convergence of the net to the desired minimum have been obtained. Some of them also assure exponential convergence and maximize a lower bound for the convergence degree. Simulation results are presented to show the net performance.
Related Concept Videos
Quadratic Models
Lagrange Multipliers: Two Constraints
Region of Convergence of Laplace Tarnsform
Consider a decaying exponential signal that begins at a specific time. When deriving its Laplace transform, the time-domain variable is replaced with a complex variable. This substitution...
Application of Nonlinear Inequalities
Region of Convergence
Quadratic Equations