Search

This paper considers a class of nonsymmetric cooperative neural networks (NNs) where the neurons are fully interconnected and the neuron activations are modeled by piecewise linear (PL) functions. The solution semiflow generated by cooperative PLNNs is monotone but, due to the horizontal segments in the neuron activations, is not eventually strongly monotone (ESM). The main result in this paper is that it is possible to prove a peculiar form of the Limit Set Dichotomy for this class of cooperative PLNNs. Such a form is slightly weaker than the standard form valid for ESM semiflows, but this notwithstanding it permits to establish a result on convergence analogous to that valid for ESM semiflows. Namely, for almost every choice of the initial conditions, each solution of a fully interconnected cooperative PLNN converges toward an equilibrium point, depending on the initial conditions, as t \to +\infty. From a methodological viewpoint, this paper extends some basic techniques and tools valid for ESM semiflows, in order that they can be applied to the monotone semiflows generated by the considered class of cooperative PLNNs. [ABSTRACT FROM PUBLISHER]

This paper develops a neural network for solving the general nonsmooth convex optimization problems. The proposed neural network is modeled by a differential inclusion. Compared with the existing neural networks for solving nonsmooth convex optimization problems, this neural network has a wider domain for implementation. Under a suitable assumption on the constraint set, it is proved that for a given nonsmooth convex optimization problem and sufficiently large penalty parameters, any trajectory of the neural network can reach the feasible region in finite time and stays there thereafter. Moreover, we can prove that the trajectory of the neural network constructed by a differential inclusion and with arbitrarily given initial value, converges to the set consisting of the equilibrium points of the neural network, whose elements are all the optimal solutions of the primal constrained optimization problem. In particular, we give the condition that the equilibrium point set of the neural network coincides with the optimal solution set of the primal constrained optimization problem and the condition ensuring convergence to the optimal solution set in finite time. Furthermore, illustrative examples show the correctness of the results in this paper, and the good performance of the proposed neural network. [ABSTRACT FROM AUTHOR]

In this paper, a new Lyapunov functional-based method is proposed for the stability analysis of delayed cellular neural networks (DCNN). Global exponential stability conditions are obtained for the general DCNN, the Hopfield neural networks (]INNs), and delayed HNNs with monotonic nondecreasing and nonconstant activation functions. [ABSTRACT FROM AUTHOR]

A neural network is said to be convergent (or completely stable) when each trajectory tends to an equilibrium point (a stationary state). A stronger property is that of absolute stability, which means that convergence holds for any choice of the neural network parameters, and any choice of the nonlinear functions, within specified and well characterized sets. In particular, the property of absolute stability requires that the neural network be convergent also when, for some parameter values, it possesses nonisolated equilibrium points (e.g., a manifold of equilibria). Such a property, which is really well suited for solving several classes of signal processing tasks in real time, cannot be in general established via the classical LaSalle approach, due to its inherent limitations to study convergence in situations where the neural network has nonisolated equilibrium points. In this paper, a new method to address absolute stability is developed, based on proving that the total length of the neural network trajectories is finite. A fundamental result on absolute stability is given, under the hypothesis that the neural network possesses a Lyapunov function, and the nonlinearities involved (neuron activations, inhibitions, etc.) are modeled by analytic functions. At the core of the proof of finiteness of trajectory length is the use of some basic inequalities for analytic functions due to Łojasiewicz. The result is applicable to a large class of neural networks, which includes the networks pro- posed by Vidyasagar, the Hopfield neural networks, and the standard cellular neural networks introduced by Chua and Yang. [ABSTRACT FROM AUTHOR]

Lyapunov functionals and Lyapunov functions coupled with the Razumildiin technique are still the most popular tools in studying the stability of large-scale retarded nonlinear systems. However, it is generally difficult to construct Lyapunov functionals or functions that satisfy the strong conditions required in the classical stability theory. In this paper, we show that for some delay differential systems such as additive neural networks with delays, we can weaken the condition that the Lyapunov functional or function is positive definite, by using the equivalence between the state stability and the output stability. We apply our general theory to obtain some new stability conditions for cellular neural network models. It is represented that it is easy to construct Lyapunov functionals or functions satisfied conditions of our theorems. [ABSTRACT FROM AUTHOR]

A fast simulation method for time-derivative cellular neural networks (TDCNN) is proposed. Using forward Euler approximation (FEA) for the derivative of the cell state and the backward Euler approximation (BEA) for the derivatives of the neighboring cell states enables the recursive computation of the cell state and provides a speed advantage of orders of magnitude. The state equations are then packed into a vector-matrix form which enables the previously empirically given time constraint to be expressed as a matrix condition. It is shown that using both FEA and BEA leads to a second-order difference equation whose corresponding second-order differential equation is derived and shown to yield the same simulation results. [ABSTRACT FROM PUBLISHER]

Global robust convergence properties of continuous-time neural networks with discrete delays are studied. By employing suitable Lyapunov functionals, we derive a set of delay-independent sufficient conditions for the existence, uniqueness, and global robust asymptotic stability of the equilibrium point. The conditions can be easily verified as they can be expressed in terms of the network parameters only. Some numerical examples are given to compare our results with previous robust stability results derived in the literature. One of our main results is shown to improve and generalize a previously published result. Other results proved to establish a new set of robust stability criteria for delayed neural networks. [ABSTRACT FROM AUTHOR]

Cellular neural networks (CNNs) are dynamical systems, described by a large set of coupled nonlinear differential equations. The equilibrium-point analysis is an important step for understanding the global dynamics and for providing design rules. We yield a set of sufficient conditions (and a simple algorithm for checking them) ensuring the existence of at least one stable equilibrium point. Such conditions give rise to simple constraints, that extend the class of CNNs, for which the existence of a stable equilibrium point is rigorously proved. In addition, they are suitable for design and easy to check, because they are directly expressed in term of the template elements. [ABSTRACT FROM AUTHOR]