二次规划问题的变时滞神经网络模型的全局指数稳定

研究等式约束下二次规划问题最优解神经网络模型的稳定性,提出一种变时滞Lagrange神经网络求解方法.利用线性矩阵不等式(LMI)技术,得到两个变时滞神经网络模型全局指数稳定的条件.分析表明,此稳定判据能够适应慢变时滞和快变时滞两种情况,具有适用范围宽、保守性小且易于验证等特点.数值仿真结果验证了所提方法的有效性.     

改进Lagrange乘子法及收敛性分析

将与不等式约束相关的乘子重新定义为原乘子的正定函数,则Karush-Kuhn-Tucker必要条件中关于不等式约束乘子的非负约束可以去掉,并能构造出直接处理不等式约束的Lagrange乘子法.分析了算法的收敛性,利用LaSalle不变集原理揭示其稳定机制,并讨论如何减弱收敛条件和扩大收敛域.     

黎曼流形上非线性凸规划最优性条件的研究

利用黎曼流形上Lipschitz函数的Penot广义方向导数和Clarke广义梯度,得到了黎曼流形上凸函数的判别,并得到了黎曼流形上凸规划极小点的充分条件,给出了黎曼流形上的等式约束优化问题、不等式约束优化问题及带有等式和不等式约束的优化问题的Lagrange定理、Lagrange充分条件、Kuhn-Tucker定理及极小点充分条件。     

Lagrange优化神经网络的原理及实现

人工神经网络是指模拟人脑神经系统的结构和功能,运用大量的处理部件,由人工方式建立起来的网络系统.近几年来,人工神经网络的研究工作十分活跃,取得了很大的进展,研究开发出了几十种神经网络的模型,出现了多种新型神经网络.阐述了Lagrange优化神经网络的原理和简单的电路实现,它克服了传统的基于罚函数的神经网络的缺陷,直接对不等式约束进行处理,降低了网络规模和复杂度,是一种新型的优化神经网络,并通过计算机仿真对其可行性进行了验证.     

含不等式约束的欠驱动系统约束跟随控制

在运动控制领域, 欠驱动机械系统通常需要满足一系列的等式约束(完整或非完整的)以便获得较好的运动 表现, 同时出于安全考虑还需要满足一定的不等式约束条件. 本文提出了一种约束跟随控制方法, 用以解决同时含 等式和不等式约束的欠驱动系统控制问题. 该控制设计主要分为两步: 第1步: 只考虑系统需要满足的等式约束, 运 用约束跟随控制方法推导出基于系统模型的状态反馈控制律; 第2步: 考虑系统需要满足的不等式约束, 先通过状 态变量映射将不等式约束整合到原等式约束中以得到新的等式约束, 再基于新的等式约束和第1步所述的约束跟随 控制方法, 推导出系统所需的状态反馈控制律. 将该约束跟随控制方法应用于三自由度非线性强耦合的欠驱动平面 垂直起降(PVTOL)飞行器. 仿真结果表明, 该控制方法能有效处理PVTOL飞行器运动过程中需满足的等式约束(轨 迹跟踪和姿态保持)和不等式约束(边界服从).     

一种新的遗传算法求解有等式约束的优化问题

针对有等式约束的优化问题,提出了一种新的遗传算法.该算法是在种群初始化、交叉、变异操作过程中使用求解参数方程的方法处理等式约束,违反不等式约束的个体用死亡罚函数进行惩罚设计出的实数编码遗传算法.数值实验结果表明,新算法性能优于现有其它算法;它不仅可以处理线性等式约束,而且还可以处理非线性等式约束,同时提高了收敛速度和解的精度,是一种通用强、高效稳健的智能算法.     

基于辅助函数积分不等式的不确定转移率的Markov跳变神经网络的稳定性分析

研究具有区间时变分布时滞和不确定转移率的Markov跳变区间时变时滞神经网络的稳定性问题.通过充分考虑转移概率的性质和不确定区域的特性,用一个有效的技术代替传统的Young''s不等式来约束转移率中的不确定项.同时,利用增广的李雅普诺夫泛函和具有较小保守性的辅助函数积分不等式,给出新的时滞依赖的稳定条件.仿真结果验证了所提出方法的有效性.     

一种新的非线性规划神经网络模型

提出一种新型的求解非线性规划问题的神经网络模型.该模型由变量神经元、Lagrange 乘子神经元和Kuhn-Tucker乘子神经元相互连接构成.通过将Kuhn-Tucker乘子神经元限 制在单边饱和工作方式,使得在处理非线性规划问题中不等式约束时不需要引入松弛变量,避 免了由于引入松弛变量而造成神经元数目的增加,有利于神经网络的硬件实现和提高神经网 络的收敛速度.可以证明,在适当的条件下,文中提出的神经网络模型的状态轨迹收敛到与非 线性规划问题的最优解相对应的平衡点.     

大工业过程稳态优化的模糊双迭代法

在研究大工业过程稳态优化控制算法时, 针对模型–实际存在差异, 将子过程模型作为等式约束, 通过引入模糊系数使其转化为模糊等式约束, 同时对子过程的不等式约束进行模糊化处理, 提出具有模糊不等式约束的模糊双迭代法, 通过实际例子研究了模糊双迭代法. 仿真结果表明, 模糊双迭代法目标函数非常接近实际目标函数值、算法迭代次数较精确双迭代法有明显改善. 这对实际生产非常重要.     

具有不等式路径约束的微分代数方程系统的动态优化

针对具有不等式路径约束的微分代数方程（Differential-algebraic equations，DAE）系统的动态优化问题，通常将DAE中的等式路径约束进行微分处理，或者将其转化为点约束或不等式约束进行求解.前者需要考虑初值条件的相容性或增加约束，在变量间耦合度较高的情况下这种转化求解方法是不可行的；后者将等式约束转化为其他类型的约束会增加约束条件，增加了求解难度.为了克服该缺点，本文提出了结合后向差分法对DAE直接处理来求解上述动态优化问题的方法.首先利用控制向量参数化方法将无限维的最优控制问题转化为有限维的最优控制问题，再利用分点离散法用有限个内点约束去代替原不等式路径约束，最后用序列二次规划（Sequential quadratic programming，SQP）法使得在有限步数的迭代下，得到满足用户指定的路径约束违反容忍度下的KKT（Karush Kuhn Tucker）最优点.理论上证明了该算法在有限步内收敛.最后将所提出的方法应用在具有不等式路径约束的微分代数方程系统中进行仿真，结果验证了该方法的有效性.     

Topology optimization of fluid channels with flow rate equality constraints

This note presents topology optimization of fluid channels with flow rate equality constraints. The equality constraints on the specified boundaries are implemented using the lumped Lagrange multiplier method. The quadratic penalty term and cut-off sensitivity are used to maintain the stability of optimization.     

Exponential Lagrange stability for impulses in discrete-time delayed recurrent neural networks

This paper focuses on the problem of exponential stability in the sense of Lagrange for impulses in discrete-time delayed recurrent neural networks. By establishing a delayed impulsive discrete inequality and a novel difference inequality, combining with inequality techniques, some novel sufficient conditions are obtained to ensure exponential Lagrange stability for impulses in discrete-time delayed recurrent neural networks. Meanwhile, exponentially convergent scope of neural network is given. Finally, several numerical simulations are given to demonstrate the effectiveness of our results.     

Control Liapunov function design of neural networks that solve convex optimization and variational inequality problems

This paper presents two neural networks to find the optimal point in convex optimization problems and variational inequality problems, respectively. The domain of the functions that define the problems is a convex set, which is determined by convex inequality constraints and affine equality constraints. The neural networks are based on gradient descent and exact penalization and the convergence analysis is based on a control Liapunov function analysis, since the dynamical system corresponding to each neural network may be viewed as a so-called variable structure closed loop control system.     

Fixed‐order H∞ control design via a partially augmented Lagrangian method

In this paper we develop an augmented Lagrangian method to determine local optimal solutions of the reduced‐ and fixed‐order H_∞ synthesis problems. We cast these synthesis problems as optimization programs with a linear cost subject to linear matrix inequality (LMI) constraints along with nonlinear equality constraints representing a matrix inversion condition. The special feature of our algorithm is that only equality constraints are included in the augmented Lagrangian, while LMI constraints are kept explicitly in order to exploit currently available semi definite programming (SDP) codes. The step computation in the tangent problem is based on a Gauss–Newton model, and a specific line search and a first‐order Lagrange multiplier update rule are used to enhance efficiency. A number of computational results are reported and underline the strong practical performance of the algorithm. Copyright © 2003 John Wiley & Sons, Ltd.     

A Neural Network Methodology and Strategy of Quadratic Optimisation

According to the basic optimisation principle of artificial neural networks, a novel kind of neural network model for solving the quadratic programming problem is presented. The methodology is based on the Lagrange multiplier theory in optimisation, and seeks to provide solutions satisfying the necessary conditions of optimality. The equilibrium point of the network satisfies the Kuhn–Tucker condition for the problem. The stability and convergency of the neural network is investigated, and the strategy of the neural optimisation is discussed. The feasibility of the neural network method is verified with the computation examples. Results of the simulation of the neural network to solve optimum problems are presented to illustrate the computational power of the neural network method.     

Design of general projection neural networks for solving monotone linear variational inequalities and linear and quadratic optimization problems.

Most existing neural networks for solving linear variational inequalities (LVIs) with the mapping Mx + p require positive definiteness (or positive semidefiniteness) of M. In this correspondence, it is revealed that this condition is sufficient but not necessary for an LVI being strictly monotone (or monotone) on its constrained set where equality constraints are present. Then, it is proposed to reformulate monotone LVIs with equality constraints into LVIs with inequality constraints only, which are then possible to be solved by using some existing neural networks. General projection neural networks are designed in this correspondence for solving the transformed LVIs. Compared with existing neural networks, the designed neural networks feature lower model complexity. Moreover, the neural networks are guaranteed to be globally convergent to solutions of the LVI under the condition that the linear mapping Mx + p is monotone on the constrained set. Because quadratic and linear programming problems are special cases of LVI in terms of solutions, the designed neural networks can solve them efficiently as well. In addition, it is discovered that the designed neural network in a specific case turns out to be the primal-dual network for solving quadratic or linear programming problems. The effectiveness of the neural networks is illustrated by several numerical examples.     

Global Lagrange Stability for Takagi-Sugeno Fuzzy Cohen-Grossberg BAM Neural Networks with Time-varying Delays

This paper concerns the globally exponential stability in Lagrange sense for Takagi-Sugeno (T-S) fuzzy Cohen-Grossberg BAM neural networks with time-varying delays. Based on the Lyapunov functional method and inequality techniques, two different types of activation functions which include both Lipschitz function and general activation functions are analyzed. Several sufficient conditions in linear matrix inequality form are derived to guarantee the Lagrange exponential stability of Cohen-Grossberg BAM neural networks with time-varying delays which are represented by T-S fuzzy models. Finally, simulation results demonstrate the effectiveness of the theoretical results.     

Global exponential stability in Lagrange sense for quaternion-valued neural networks with leakage delay and mixed time-varying delays

This paper deals with the global exponential stability in Lagrange sense for quaternion-valued neural networks (QVNNs) with leakage delay, discrete time-varying delays and distributed delays. By structuring an advisable Lyapunov–Krasovskii functional in quaternion field, and adopting free-weighting-matrix method and inequality technique, a sufficient condition in quaternion-valued linear matrix inequality (LMI) to guarantee the global exponential stability in Lagrange sense is acquired, and the domain of attraction is estimated. A numerical example with simulations is supplied to confirm the availability and feasibility of the raised result.