大规模界约束优化的子空间截断牛顿法

给出了大规模界约束优化的一个子空间截断牛顿法。利用截断牛顿法修正非有效约束所对应的变量，用投影梯度法修正有效约束所对应的变量，文中证明了方法的整体收敛性，并对方法进行了数值试验，且与子空间有限内存拟牛顿法进行了数值比较。     

一类非经典扩散方程整体解的存在唯一性及长时间行为

本文讨论非经典扩散方程第一初边值问题整体解的存在唯一性及长时间行为，建立了一系列新的结果，较好地改进许多已有的结论．     

解可分离约束双凹规划问题的一种外逼近方法[英文]

在本文中，我们提出了双凹规划问题和更一般的广义凹规划问题。我们给出了双凹规划问题的整体最优性条件，并构造了一个有限终止外逼近算法。     

On error bounds for lower semicontinuous functions

We give some sufficient conditions for proper lower semicontinuous functions on metric spaces to have error bounds (with exponents). For a proper convex function f on a normed space X the existence of a local error bound implies that of a global error bound. If in addition X is a Banach space, then error bounds can be characterized by the subdifferential of f. In a reflexive Banach space X, we further obtain several sufficient and necessary conditions for the existence of error bounds in terms of the lower Dini derivative of f. Received: April 27, 2001 / Accepted: November 6, 2001?Published online April 12, 2002     

一类非光滑最优化信赖域算法

本文把通常的光滑信赖域算法推广到非光滑情形，目标函数仅为局部李普希兹连续，文中子问题的目标函数不必是通常的二次逼近形式。     

Pure adaptive search in global optimization

Pure adaptive seach iteratively constructs a sequence of interior points uniformly distributed within the corresponding sequence of nested improving regions of the feasible space. That is, at any iteration, the next point in the sequence is uniformly distributed over the region of feasible space containing all points that are strictly superior in value to the previous points in the sequence. The complexity of this algorithm is measured by the expected number of iterations required to achieve a given accuracy of solution. We show that for global mathematical programs satisfying the Lipschitz condition, its complexity increases at mostlinearly in the dimension of the problem.This work was supported in part by NATO grant 0119/89.     

周期摄动保守系统的存在性定理

本文利用全局反函数定理讨论了一类非线性边值问题解的存在性与唯一性.     

带有非局部源项的发展方程全局解的不存在性

通过试验函数法,本文讨论了具有形如‖u‖p或‖ Du‖p的非局部源项的发展方程全局解的不存在性.     

带有不等式约束的全局最优性条件

本文利用不连续罚函数方法将带有不等式约束的全局优化问题的求解转化为 讨论一非线性方程的求根问题,从而得到若干个全局最优性条件.     

EXPONENTIAL STABILITY AND PERIODIC SOLUTION OF HYBRID BIDIRECTIONAL ASSOCIATIVE MEMORY NEURAL NETWORKS WITH DISCRETE DELAYS

In this paper, we study the existence, uniqueness, and the global exponential stability of the periodic solution and equilibrium of hybrid bidirectional associative memory neural networks with discrete delays. By ingeniously importing real parameters di > 0 (i = 1,2, …, n) which can be adjusted, making use of the Lyapunov functional method and some analysis techniques, some new sufficient conditions are established. Our results generalize and improve the related results in [9]. These conditions can be used both to design globally exponentially stable and periodical oscillatory hybrid bidirectional associative neural networks with discrete delays, and to enlarge the area of designing neural networks. Our work has important significance in related theory and its application.