Global exponential stability of discrete-time recurrent neural network for solving quadratic programming problems subject to linear constraints

In this paper, a discrete-time recurrent neural network with global exponential stability is proposed for solving linear constrained quadratic programming problems. Compared with the existing neural networks for quadratic programming, the proposed neural network in this paper has lower model complexity with only one-layer structure. Moreover, the global exponential stability of the neural network can be guaranteed under some mild conditions. Simulation results with some applications show the performance and characteristic of the proposed neural network.     

Global exponential periodicity of a class of recurrent neural networks with oscillating parameters and time-varying delays

In this paper, we present the analytical results on the global exponential periodicity of a class of recurrent neural networks with oscillating parameters and time-varying delays. Sufficient conditions are derived for ascertaining the existence, uniqueness and global exponential periodicity of the oscillatory solution of such recurrent neural networks by using the comparison principle and mixed monotone operator method. The periodicity results extend or improve existing stability results for the class of recurrent neural networks with and without time delays.     

A recurrent neural network for solving nonlinear convex programs subject to linear constraints

In this paper, we propose a recurrent neural network for solving nonlinear convex programming problems with linear constraints. The proposed neural network has a simpler structure and a lower complexity for implementation than the existing neural networks for solving such problems. It is shown here that the proposed neural network is stable in the sense of Lyapunov and globally convergent to an optimal solution within a finite time under the condition that the objective function is strictly convex. Compared with the existing convergence results, the present results do not require Lipschitz continuity condition on the objective function. Finally, examples are provided to show the applicability of the proposed neural network.     

Exponential Synchronization of Memristive Chaotic Recurrent Neural Networks Via Alternate Output Feedback Control

This paper considers the global exponential synchronization problem of two memristive chaotic recurrent neural networks with time‐varying delays using periodically alternate output feedback control. First, the periodically alternate output feedback control rule is designed for the global exponential synchronization of two memristive chaotic recurrent neural networks. Then, according to the Lyapunov stability theory, we construct an appropriate Lyapunov‐Krasovskii functional to derive several new sufficient conditions guaranteeing exponential synchronization of two memristive chaotic recurrent neural networks under periodically alternate output feedback control. Compared with existing results on synchronization conditions on the basis of linear matrix inequalities of memristive chaotic recurrent neural networks, the derived results complement, extend earlier related results, and are also easy to validate in this paper. An illustrative example is provided to illustrate the effectiveness of the synchronization criteria.     

投影型神经网络算法的全局收敛性分析

投影型神经网络具有自然保证解的可行性、可调参数少、搜索方向维数低和模型结构简单等优点,已引起众多学者关注．神经网络可用于求解优化问题的前提是它应具有全局收敛性．目前,该模型的这一性质仅对有界约束下严格凸二次规划问题得到了证明．该文利用常微分方程理论和LaSalle不变原理,通过构造Lyapunov函数,证明了该网络对一般凸规划问题的全局收敛性,并将约束区域推广到任一闭凸集．该文的结论奠定了该类网络的应用基础,扩大了它的应用范围．同时作者也讨论了该模型在较弱限制条件下的指数收敛性．最后给出一组实例,说明该网络计算上是可行和有效的．     

Global asymptotic stability and global exponential stability ofcontinuous-time recurrent neural networks

This paper presents new results on global asymptotic stability (GAS) and global exponential stability (GES) of a general class of continuous-time recurrent neural networks with Lipschitz continuous and monotone nondecreasing activation functions. We first give three sufficient conditions for the GAS of neural networks. These testable sufficient conditions differ from and improve upon existing ones. We then extend an existing GAS result to GES one and also extend the existing GES results to more general cases with less restrictive connection weight matrices and/or partially Lipschitz activation functions     

Improved conditions for global exponential stability of recurrent neural networks with time-varying delays

This paper presents new theoretical results on global exponential stability of recurrent neural networks with bounded activation functions and time-varying delays. The stability conditions depend on external inputs, connection weights, and time delays of recurrent neural networks. Using these results, the global exponential stability of recurrent neural networks can be derived, and the estimated location of the equilibrium point can be obtained. As typical representatives, the Hopfield neural network (HNN) and the cellular neural network (CNN) are examined in detail.     

Robust stability of delayed reaction-diffusion recurrent neural networks with Dirichlet boundary conditions on time scales

In this paper, the global robust exponential stability of equilibrium solution to delayed reaction-diffusion recurrent neural networks with Dirichlet boundary conditions on time scales is studied. Using topological degree theory, M-matrix method, Lyapunov functional and inequality skills, we establish some sufficient conditions for the existence, uniqueness and global robust exponential stability of equilibrium solution to delayed reaction-diffusion recurrent neural networks with Dirichlet boundary conditions on time scales. One example is given to illustrate the effectiveness of our results.     

A New Recurrent Neural Network for Solving Convex Quadratic Programming Problems With an Application to the $k$-Winners-Take-All Problem

In this paper, a new recurrent neural network is proposed for solving convex quadratic programming (QP) problems. Compared with existing neural networks, the proposed one features global convergence property under weak conditions, low structural complexity, and no calculation of matrix inverse. It serves as a competitive alternative in the neural network family for solving linear or quadratic programming problems. In addition, it is found that by some variable substitution, the proposed network turns out to be an existing model for solving minimax problems. In this sense, it can be also viewed as a special case of the minimax neural network. Based on this scheme, a k-winners-take-all (k-WTA) network with O(n) complexity is designed, which is characterized by simple structure, global convergence, and capability to deal with some ill cases. Numerical simulations are provided to validate the theoretical results obtained. More importantly, the network design method proposed in this paper has great potential to inspire other competitive inventions along the same line.     

Global exponential stability of a class of memristive neural networks with time-varying delays

This paper studies the uniqueness and global exponential stability of the equilibrium point for memristor-based recurrent neural networks with time-varying delays. By employing Lyapunov functional and theory of differential equations with discontinuous right-hand side, we establish several sufficient conditions for exponential stability of the equilibrium point. In comparison with the existing results, the proposed stability conditions are milder and more general, and can be applied to the memristor-based neural networks model whose connection weight changes continuously. Numerical examples are also presented to show the effectiveness of the theoretical results.     

Dynamic behaviors of memristor-based delayed recurrent networks

This paper investigates the problem of the existence and global exponential stability of the periodic solution of memristor-based delayed network. Based on the knowledge of memristor and recurrent neural network, the model of the memristor-based recurrent networks is established. Several sufficient conditions are obtained, which ensure the existence of periodic solutions and global exponential stability of the memristor-based delayed recurrent networks. These results ensure global exponential stability of memristor-based network in the sense of Filippov solutions. And, it is convenient to estimate the exponential convergence rates of this network by the results. An illustrative example is given to show the effectiveness of the theoretical results.     

Almost Sure Exponential Stability of Recurrent Neural Networks With Markovian Switching

This paper presents new stability results for recurrent neural networks with Markovian switching. First, algebraic criteria for the almost sure exponential stability of recurrent neural networks with Markovian switching and without time delays are derived. The results show that the almost sure exponential stability of such a neural network does not require the stability of the neural network at every individual parametric configuration. Next, both delay-dependent and delay-independent criteria for the almost sure exponential stability of recurrent neural networks with time-varying delays and Markovian-switching parameters are derived by means of a generalized stochastic Halanay inequality. The results herein include existing ones for recurrent neural networks without Markovian switching as special cases. Finally, simulation results in three numerical examples are discussed to illustrate the theoretical results.     

Global exponential stability of recurrent neural networks forsynthesizing linear feedback control systems via pole assignment

Global exponential stability is the most desirable stability property of recurrent neural networks. The paper presents new results for recurrent neural networks applied to online computation of feedback gains of linear time-invariant multivariable systems via pole assignment. The theoretical analysis focuses on the global exponential stability, convergence rates, and selection of design parameters. The theoretical results are further substantiated by simulation results conducted for synthesizing linear feedback control systems with different specifications and design requirements     

A new gradient-based neural network for solving linear andquadratic programming problems

A new gradient-based neural network is constructed on the basis of the duality theory, optimization theory, convex analysis theory, Lyapunov stability theory, and LaSalle invariance principle to solve linear and quadratic programming problems. In particular, a new function F(x, y) is introduced into the energy function E(x, y) such that the function E(x, y) is convex and differentiable, and the resulting network is more efficient. This network involves all the relevant necessary and sufficient optimality conditions for convex quadratic programming problems. For linear programming and quadratic programming (QP) problems with unique and infinite number of solutions, we have proven strictly that for any initial point, every trajectory of the neural network converges to an optimal solution of the QP and its dual problem. The proposed network is different from the existing networks which use the penalty method or Lagrange method, and the inequality constraints are properly handled. The simulation results show that the proposed neural network is feasible and efficient.     

Exponential stability analysis for neutral BAM neural networks with time-varying delays and stochastic disturbances

This paper is concerned with the global exponential stability analysis problem for a class of neutral bidirectional associative memory (BAM) neural networks with time-varying delays and stochastic dist...     

Exponential stability of impulsive high-order Hopfield-type neural networks with time-varying delays

This paper considers the problems of global exponential stability and exponential convergence rate for impulsive high-order Hopfield-type neural networks with time-varying delays. By using the method of Lyapunov functions, some sufficient conditions for ensuring global exponential stability of these networks are derived, and the estimated exponential convergence rate is also obtained. As an illustration, an numerical example is worked out using the results obtained.     

Impulses-induced exponential stability in recurrent delayed neural networks

The present paper formulates and studies a model of recurrent neural networks with time-varying delays in the presence of impulsive connectivity among the neurons. This model can well describe practical architectures of more realistic neural networks. Some novel yet generic criteria for global exponential stability of such neural networks are derived by establishing an extended Halanay differential inequality on impulsive delayed dynamical systems. The distinctive feature of this work is to address exponential stability issues without a priori stability assumption for the corresponding delayed neural networks without impulses. It is shown that the impulses in neuronal connectivity play an important role in inducing global exponential stability of recurrent delayed neural networks even if it may be unstable or chaotic itself. Furthermore, example and simulation are given to illustrate the practical nature of the novel results.     

The globally asymptotic stability analysis for a class of recurrent neural networks with delays

This paper considers the problem of global stability of neural networks with delays. By combining Lie algebra and the Lyapunov function with the integral inequality technique, we analyze the globally asymptotic stability of a class of recurrent neural networks with delays and give an estimate of the exponential stability. A few new sufficient conditions and criteria are proposed to ensure globally asymptotic stability of the equilibrium point of the neural networks. A few simulation examples are presented to demonstrate the effectiveness of the results and to improve feasibility.     

Novel robust stability criteria of discrete-time stochastic recurrent neural networks with time delay

The problem of robust global exponential stability is investigated for a class of stochastic uncertain discrete-time recurrent neural networks with time delay. In this paper, the midpoint of the time delay's variation interval is introduced, and the variation interval is divided into two subintervals. Then, by constructing a new Lyapunov–Krasovskii functional and checking its variation in the two subintervals, respectively, some novel delay-dependent stability criteria for the addressed neural networks are derived. Numerical examples are provided to show that the achieved conditions are less conservative than some existing ones in the literature.     

A delayed neural network for solving linear projection equations and its analysis

In this paper, we present a delayed neural network approach to solve linear projection equations. The Lyapunov-Krasovskii theory for functional differential equations and the linear matrix inequality (LMI) approach are employed to analyze the global asymptotic stability and global exponential stability of the delayed neural network. Compared with the existing linear projection neural network, theoretical results and illustrative examples show that the delayed neural network can effectively solve a class of linear projection equations and some quadratic programming problems.