解非线性约束方程的拉格朗日全局投影方法

基于最优化方法求解约束非线性方程组的一个突出困难是计算 得到的仅是该优化问题的稳定点或局部极小点,而非方程组的解点.由此引出的问题是如何从一个稳定点出发得到一个相对于方程组解更好的点. 该文采用投影型算法,推广了Nazareth-Qi$^{[8,9]}$ 求解无约束非线性方程组的拉格朗日全局算法(Lagrangian Global-LG)于约束方程上; 理论上证明了从优化问题的稳定点出发,投影LG方法可寻找到一个更好的点. 数值试验证明了LG方法的有效性.     

A convex analysis approach for convex multiplicative programming

Global optimization problems involving the minimization of a product of convex functions on a convex set are addressed in this paper. Elements of convex analysis are used to obtain a suitable representation of the convex multiplicative problem in the outcome space, where its global solution is reduced to the solution of a sequence of quasiconcave minimizations on polytopes. Computational experiments illustrate the performance of the global optimization algorithm proposed.      

General variable neighborhood search for the continuous optimization

We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Different neighborhoods and distributions, induced from different metrics are ranked and used to get random points in the shaking step. We also propose VNS for solving constrained optimization problems. The constraints are handled using exterior point penalty functions within an algorithm that combines sequential and exact penalty transformations. The extensive computer analysis that includes the comparison with genetic algorithm and some other approaches on standard test functions are given. With our approach we obtain encouraging results.     

On global existence of solutions to a cross-diffusion system

We consider a strongly coupled nonlinear parabolic system which arises in population dynamics in n-dimensional domains (n?1). We prove the global existence of classical solutions to the system for n<10.     

二阶时滞小波神经网络的全局指数稳定性分析

通过构造李雅谱诺夫泛函,对具有时滞的二阶神经网络的稳定性进行分析,利用Eazumikhin定理得到了网络平衡点全局指数稳定的时滞相关与无关的充分条件,当衰减率依赖于时间时,得出了它们之间的一个线性关系,并进行了简明扼要的分析.     

A hybrid method for multidimensional scaling using city-block distances

The problem of multidimensional scaling with city-block distances in the embedding space is reduced to a two level optimization problem consisting of a combinatorial problem at the upper level and a quadratic programming problem at the lower level. A hybrid method is proposed combining randomized search for the upper level problem with a standard quadratic programming algorithm for the lower level problem. Several algorithms for the combinatorial problem have been tested and an evolutionary global search algorithm has been proved most suitable. An experimental code of the proposed hybrid multidimensional scaling algorithm is developed and tested using several test problems of two- and three-dimensional scaling.     

两类非线性系统的全局稳定性

本文利用 Liapunov 函数方法和论证系统正半轨线有界的 Shimanov区域方法,给出了两类非线性系统的零解为全局稳定的充分条件,并讨论了一些低阶实例,得到了较好的结果.     

Global dynamics behaviors for a nonautonomous Lotka–Volterra almost periodic dispersal system with delays

A nonautonomous Lotka–Volterra dispersal system with continuous delays and discrete delays is considered. By using a comparison theorem and delay differential equation basic theory, we obtain sufficient conditions for the permanence of the population in every patch. By constructing a suitable Lyapunov functional, we prove that the system is globally asymptotically stable under some appropriate conditions. Using almost periodic functional hull theory, we get sufficient conditions for the existence, uniqueness and globally asymptotical stability for an almost periodic solution. This implies that the population in every patch exhibits stable almost periodic fluctuation. Furthermore, the results show that the permanence and global stability of system, and the existence and uniqueness of a positive almost periodic solution, depend on the delay; then we call it “profitless”.     

Stability analysis for neural networks with inverse Lipschitzian neuron activations and impulses

In this paper, a new concept called α-inverse Lipschitz function is introduced. Based on the topological degree theory and Lyapunov functional method, we investigate global convergence for a novel class of neural networks with impulses where the neuron activations belong to the class of α-inverse Lipschitz functions. Some sufficient conditions are derived which ensure the existence, and global exponential stability of the equilibrium point of neural networks. Furthermore, we give two results which are used to check the stability of uncertain neural networks. Finally, two numerical examples are given to demonstrate the effectiveness of results obtained in this paper.     

A Smoothing-Type Algorithm for Solving Linear Complementarity Problems with Strong Convergence Properties

In this paper, we construct an augmented system of the standard monotone linear complementarity problem (LCP), and establish the relations between the augmented system and the LCP. We present a smoothing-type algorithm for solving the augmented system. The algorithm is shown to be globally convergent without assuming any prior knowledge of feasibility/infeasibility of the problem. In particular, if the LCP has a solution, then the algorithm either generates a maximal complementary solution of the LCP or detects correctly solvability of the LCP, and in the latter case, an existing smoothing-type algorithm can be directly applied to solve the LCP without any additional assumption and it generates a maximal complementary solution of the LCP; and that if the LCP is infeasible, then the algorithm detect correctly infeasibility of the LCP. To the best of our knowledge, such properties have not appeared in the existing literature for smoothing-type algorithms. This work was partially supported by the National Natural Science Foundation of China (Grant No. 10571134), the Natural Science Foundation of Tianjin (Grant No. 07JCYBJC05200), and the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry.