具有离散和分布时滞的随机基因神经网络的均方全局渐近稳定性

研究了一类具有混合时滞的随机神经网络的均方稳定性问题．不同于其他已有的文章,混合时滞对描述基因神经网络的分子浓度更具有现实意义．基于李雅普诺夫稳定性理论和线性矩阵不等式条件,给出了随机基因神经网络的均方渐近稳定性条件．相关的例子证明了理论结果的有效性．     

一个新的Hilbert型积分不等式及其最佳推广

利用权函数的方法,建立一个新的、具有混合核的Hilbert型积分不等式,并证明其常数因子为最佳值,还考虑了其等价形式及(p,q)引入两对共轭指数的最佳推广情形.     

自反Banach空间中一类广义集值强非线性变分不等式问题

在自反Banach空间中引进并研究一类具有集值映射的广义强非线性变分不等式问题,并且证明了这类变分不等式解的存在性定理。结果修正、改进和推广了文献Cho Y.J等人的主要结果。     

局部传输信息不等式和曲率维数条件的等价性

本文得到了曲率维数条件CD(ρ,∞) 和CD(0, n)与相应的局部传输信息不等式的等价性.     

两参数分数Wiener过程滞后增量有多大

主要讨论了阶为a(0相似文献   

网络环境下航天器交会对接系统的鲁棒H_∞滤波

以航天器空间交会对接为背景,探讨了其网络环境下的鲁棒H?滤波问题。基于传统的C-W方程,重新构建网络环境下航天器交会对接系统的数学模型。选取时滞相关Lyapunov函数并结合自由权矩阵处理方法,给出网络化滤波误差系统渐近稳定且满足H?性能的充分条件,进而将滤波器的设计转化为受线性矩阵不等式约束的凸优化求解问题。仿真表明,最劣情况下最优的H?扰动抑制水平达到??1.4142,得到的相对位置和速度估计误差分别为0.07与0.02,证明该算法是可行且有效的。     

一种无恢复过程的SQP-滤子法

本文研究非线性不等式约束优化问题,构造一个新的SQP-滤子法.该方法将滤子技术有机融合到简金宝提出的可行SQP方法中,利用转轴运算的思想,产生一个近似积极约束集,当QP子问题不相容时,利用广义投影技术获得可行搜索方向.该算法既能避免罚函数的选择,又能避免常规滤子算法中的恢复算法,一定程度上简化了计算.最后,在合理的条件下,证明了算法的全局收敛性.     

关于Landau不等式

本文给出Landau不等式的一种改进。     

Further studies on stability analysis of nonlinear Roesser-type two-dimensional systems

This paper is concerned with further relaxations of the stability analysis of nonlinear Roesser-type two-dimensional （2D） systems in the Takagi-Sugeno fuzzy form. To achieve the goal, a novel slack matrix variable technique, which is homogenous polynomially parameter-dependent on the normalized fuzzy weighting functions with arbitrary degree, is developed and the algebraic properties of the normalized fuzzy weighting functions are collected into a set of augmented matrices. Consequently, more information about the normalized fuzzy weighting functions is involved and the relaxation quality of the stability analysis is significantly improved. Moreover, the obtained result is formulated in the form of linear matrix inequalities, which can be easily solved via standard numerical software. Finally, a numerical example is provided to demonstrate the effectiveness of the proposed result.     

Tracking problem under a time-varying topology

This paper studies the multi-agent tracking problem of a third-order maneuvering target under uncertain communication environments. Each tracking agent is assumed to be a third-order system and can only use its own and neighbors＇ position, velocity, and acceleration information to design its control input. In this work, the uncertain communication environments are modelled by a finite number of constant Laplacian matrices together with their corresponding scheduling functions. Sufficient conditions for the existence of a tracking strategy have been expressed in terms of the solvability of linear matrix inequalities. Finally, a numerical example is employed to demonstrate the effectiveness of the proposed tracking strategy.