In this paper, we present new conditions ensuring existence, uniqueness, and Global Asymptotic Stability (GAS) of the equilibrium point for a large class of neural networks. The results are applicable to both symmetric and nonsymmetric interconnection matrices and allow for the consideration of all continuous nondecreasing neuron activation functions. Such functions may be unbounded (but not necessarily surjective), may have infinite intervals with zero slope as in a piece-wise-linear model, or both. The conditions on GAS rely on the concept of Lyapunov Diagonally Stable (or Lyapunov Diagonally Semi-Stable) matrices and are proved by employing a class of Lyapunov functions of the generalized Lur'e-Postnikov type. Several classes of interconnection matrices of applicative interest are shown to satisfy our conditions for GAS. In particular, the results are applied to analyze GAS for the class of neural circuits introduced for solving linear and quadratic programming problems. In this application, the principal result here obtained is that these networks are GAS also when the constraint amplifiers are dynamical, as it happens in any practical implementation

No abstract

This paper introduces a general class of neural networks with arbitrary constant delays in the neuron interconnections, and neuron activations belonging to the set of discontinuous monotone increasing and (possibly) unbounded functions. The discontinuities in the activations are an ideal model of the situation where the gain of the neuron amplifiers is very high and tends to infinity, while the delay accounts for the finite switching speed of the neuron amplifiers, or the finite signal propagation speed. It is known that the delay in combination with high-gain nonlinearities is a particularly harmful source of potential instability. The goal of this paper is to single out a subclass of the considered discontinuous neural networks for which stability is instead insensitive to the presence of a delay. More precisely, conditions are given under which there is a unique equilibrium point of the neural network, which is globally exponentially stable for the states, with a known convergence rate. The conditions are easily testable and independent of the delay. Moreover, global convergence in finite time of the state and output is investigated. In doing so, new interesting dynamical phenomena are highlighted with respect to the case without delay, which make the study of convergence in finite time significantly more difficult. The obtained results extend previous work on global stability of delayed neural networks with Lipschitz continuous neuron activations, and neural networks with discontinuous neuron activations but without delays.

In 1988 Kennedy and Chua introduced the dynamical canonical nonlinear programming circuit (NPC) to solve in real time nonlinear programming problems where the objective function and the constraints are smooth (twice continuously differentiable) functions. In this paper, a generalized circuit is introduced (G-NPC), which is aimed at solving in real time a much wider class of nonsmooth nonlinear programming problems where the objective function and the constraints are assumed to satisfy only the weak condition of being regular functions. G-NPC, which derives from a natural extension of NPC, has a neural-like architecture and also features the presence of constraint neurons modeled by ideal diodes with infinite slope in the conducting region. By using the Clarke's generalized gradient of the involved functions, G-NPC is shown to obey a gradient system of differential inclusions, and its dynamical behavior and optimization capabilities, both for convex and nonconvex problems, are rigorously analyzed in the framework of nonsmooth analysis and the theory of differential inclusions. In the special important case of linear and quadratic programming problems, salient dynamical features of G-NPC, namely the presence of sliding modes, trajectory convergence in finite time, and the ability to compute the exact optimal solution of the problem being modeled, are uncovered and explained in the developed analytical framework.

No abstract

The main result in this paper is that for a neural circuit of the Hopfield type with a symmetric connection matrix T, the negative semidefiniteness of T is a necessary and sufficient condition for Absolute Stability. The most significant theoretical implication is that the class of neural circuits with a negative semidefinite T is the largest class of circuits that can be employed for embedding and solving optimization problems without the risk of spurious responses

This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination.

The present manuscript relies on the companion paper entitled ''Memristor Circuits: Flux-Charge Analysis Method,'' which has introduced a comprehensive analysis method to study the nonlinear dynamics of memristor circuits in the flux-charge (φ,q)-domain. The Flux-Charge Analysis Method is based on Kirchhoff Flux and Charge Laws and constitutive relations of circuit elements in terms of incremental fluxes and incremental charges. The straightforward application of the method has previously provided a full portrait of the nonlinear dynamics and bifurcations of the simplest memristor circuit composed by a capacitor and a flux-controlled memristor. This paper aims to show that the method is effective to analyze nonlinear dynamics and bifurcations in memristor circuits with more complex dynamics including Hopf bifurcations (originating persistent oscillations) and period-doubling cascades (leading to chaotic behavior). One key feature of the method is that it makes clear how initial conditions give rise to bifurcations for an otherwise fixed set of circuit parameters. To the best of the authors' knowledge, these represent the first results that relate such bifurcations, which are referred to in the paper as Bifurcations without Parameters, with physical circuit variables as the initial conditions of dynamic circuit elements