Heuristic Rejection in Interval Global Optimization

Based on the investigation carried out in Ref. 1, this paper incorporates new studies about the properties of inclusion functions on subintervals while a branch-and-bound algorithm is solving global optimization problems. It is found that the relative place of the global minimum value within the inclusion function value of the objective function at the current interval indicates mostly whether the given interval is close to a minimizer point. This information is used in a heuristic interval rejection rule that can save a considerable amount of computation. Illustrative examples are discussed and an extended numerical study shows the advantages of the new approach.     

General Information

In this paper, we propose and analyze an SQP-type method for solving linearly constrained convex minimization problems where the objective functions are too complex to be evaluated exactly. Some basic results for global convergence and local superlinear convergence are obtained according to the properties of the approximation sequence. We illustrate the applicability of our approach by proposing a new method for solving two-stage stochastic programs with fixed recourse.     

Rational Functions with Prescribed Global and Local Minimizers

A family of multivariate rational functions is constructed. It has strong local minimizers with prescribed function values at prescribed positions. While there might be additional local minima, such minima cannot be global. A second family of multivariate rational functions is given, having prescribed global minimizers and prescribed interpolating data.     

GLOBAL ASYMPTOTIC STABILITY IN N-SPECIES NONAUTONOMOUS LOTKA-VOLTERRACOMPETITIVE SYSTEMS WITH DELAYS

A delayed n-species nonautonomous Lotka-Volterra type competitive system without dominating instantaneous negative feedback is investigated. By means of a suitable Lyapunov functional, sufficient conditions are derived for the global asymptotic stability of the positive solutions of the system. As a corollary, it is shown that the global asymptotic stability of the positive solution is maintained provided that the delayed negative feedbacks dominate other interspecific interaction effects with delays and the delays are sufficiently small.     

ANALYSIS OF AN SI EPIDEMIC MODEL WITH NONLINEAR TRANSMISSION AND STAGE STRUCTURE

A disease transmission model of SI type with stage structure is formulated. The stability of disease free equilibrium, the existence and uniqueness of an endemic equilibrium, the existence of a global attractor are investigated.     

Some Notes on Reaction Diffusion Systems with Nonlinear Boundary Conditions

This paper deals with the existence and nonexistence of global positive solution to a semilinear reaction-diffusion system with nonlinear boundary conditions.For the heat diffusion case,the necessary and sufficient conditions on the global existence of all positive solutions are obtained.For the general fast diffusion case,we get some conditions on the global existence and nonexistence of positive solutions.The results of this paper fill the some gaps which were left in this field.     

Augmented Lagrangian algorithms for linear programming

We introduce new augmented Lagrangian algorithms for linear programming which provide faster global convergence rates than the augmented algorithm of Polyak and Treti'akov. Our algorithm shares the same properties as the Polyak-Treti'akov algorithm in that it terminates in finitely many iterations and obtains both primal and dual optimal solutions. We present an implementable version of the algorithm which requires only approximate minimization at each iteration. We provide a global convergence rate for this version of the algorithm and show that the primal and dual points generated by the algorithm converge to the primal and dual optimal set, respectively.     

求一类多元多峰函数全局极小的区间斜率方法

Based on the interval analysis, an interval slope method is proposed for finding all global minimizers of a several peaks function f on domain X^0包含于R^n, which is given by interval slope discard tests and interval extension of objective function.Numerical results of representative test functions show that this method is practical and effective.     

基于增广Lagrange函数的RQP方法

Recursive quadratic programming is a family of techniques developd by Bartholomew-Biggs and other authors for solving nonlinear programming problems.This paperdescribes a new method for constrained optimization which obtains its search di-rections from a quadratic programming subproblem based on the well-known aug-mented Lagrangian function.It avoids the penalty parameter to tend to infinity.We employ the Fletcher‘s exact penalty function as a merit function and the use of an approximate directional derivative of the function that avoids the need toevaluate the second order derivatives of the problem functions.We prove that thealgorithm possesses global and superlinear convergence properties.At the sametime, numerical results are reported.     

一个耦合系统自由边界问题的整体古典解

§ 1　ＩｎｔｒｏｄｕｃｔｉｏｎＩｎｔｈｉｓｐａｐｅｒｗｅｄｉｓｃｕｓｓｔｈｅｇｌｏｂａｌｃｌａｓｓｉｃａｌｓｏｌｕｔｉｏｎｏｆａｍｕｌｔｉｄｉｍｅｎｓｉｏｎａｌｑｕａｓｉｓｔａｔｉｏｎａｒｙｐｒｏｂｌｅｍ .Ｔｈｅｐｒｏｂｌｅｍｃｏｍｅｓｆｒｏｍｔｈｅｄｉｓｃｕｓｓｉｏｎｏｆａｇｒｏｗｔｈｍｏｄｅｌｏｆｓｅｌｆｍａｉｎｔａｉｎｉｎｇｐｒｏｔｏｃｅｌｌ(ｓｅｅ [1— 3])ｉｎｍｕｌｔｉｄｉｍｅｎｓｉｏｎａｌｃａｓｅ .Ｔｈｅｐｒｏｔｏｃｅｌｌｃａｎｂｅｖｉｓｕａｌｉｚｅｄａｓｈａｖｉｎｇａｐｏｒｏｕｓｓｔ…