A filled function method for constrained global optimization

In this paper, a filled function method for solving constrained global optimization problems is proposed. A filled function is proposed for escaping the current local minimizer of a constrained global optimization problem by combining the idea of filled function in unconstrained global optimization and the idea of penalty function in constrained optimization. Then a filled function method for obtaining a global minimizer or an approximate global minimizer of the constrained global optimization problem is presented. Some numerical results demonstrate the efficiency of this global optimization method for solving constrained global optimization problems.     

An Approach to Finding a Global Minimization with Equality and Inequality Constraints

We give an approach for finding a global minimization with equality and inequality Constraints.Our approach is to construct an exact penalty function, and prove that the global minimal points of this exact penalty function are the primal constrained global minimal points. Thus we convert the problem of global constrained optimization into a problem of global unconstrained optimization. Furthermore, the integral approach for finding a global minimization for a class of discontinuous functions is used and an implementable algorithm is given.     

Global descent methods for unconstrained global optimization

We propose in this paper novel global descent methods for unconstrained global optimization problems to attain the global optimality by carrying out a series of local minimization. More specifically, the solution framework consists of a two-phase cycle of local minimization: the first phase implements local search of the original objective function, while the second phase assures a global descent of the original objective function in the steepest descent direction of a (quasi) global descent function. The key element of global descent methods is the construction of the (quasi) global descent functions which possess prominent features in guaranteeing a global descent.     

正则型控制系统的全局反馈镇定

在对非线性控制系统全局镇定的研究中 ,Byrness,Isidori讨论了光滑非线性系统的光滑反馈与全局正则型的等价条件 ;Kokotovic,Sussmann则在讨论了全局镇定的正实条件后 ,得到了一个判定系统为全局光滑可镇定的重要条件 .本文则考察一类正则型控制系统 ,通过变换系统和构造全局反馈镇定律的方法 ,得到全局光滑镇定     

Global Coupling of an Interface Problem in an Activator-inhibitor System

An activator-inhibitor reaction system with global coupling was introduced in [1]. The authors showed that global coupling suppresses the breathing motion and enhances the propagation of the localized solution. The collision between two traveling waves for a sufficiently strong global coupling is discussed in [2]. If the width of layers is infinitesimally thin, the equation of motion for a pair of the interfaces is derived. We shall study the dynamics of interfaces in the free boundary problem with global coupling and with a strong global coupling.     

An alternating variable method for the maximal correlation problem

The maximal correlation problem (MCP) aiming at optimizing correlations between sets of variables plays an important role in many areas of statistical applications. Up to date, algorithms for the general MCP stop at solutions of the multivariate eigenvalue problem (MEP), which serves only as a necessary condition for the global maxima of the MCP. For statistical applications, the global maximizer is quite desirable. In searching the global solution of the MCP, in this paper, we propose an alternating variable method (AVM), which contains a core engine in seeking a global maximizer. We prove that (i) the algorithm converges globally and monotonically to a solution of the MEP, (ii) any convergent point satisfies a global optimal condition of the MCP, and (iii) whenever the involved matrix A is nonnegative irreducible, it converges globally to the global maximizer. These properties imply that the AVM is an effective approach to obtain a global maximizer of the MCP. Numerical testings are carried out and suggest a superior performance to the others, especially in finding a global solution of the MCP.     

变时滞Hopfield神经网络的全局吸引性和全局指数稳定性

对一类具时滞的Hopfeild型神经网络模型,在非线性神经元激励函数只要求满足Lipschitz连续的条件下,利用推广的Halanay时延微分析不等式、Dini导数以及泛函微分析技术,给出了这类模型的平衡点全局指数稳定性和全局吸引性的充分条件,这些条件易于检验,且改进和推广了前人的结论.此外,此文给出了研究神经网络模型的全局吸引性的微分不等式比较方法.     

Global efficiency in multiobjective programming *

In this paper, we are concerned with global efficiency in multiobjective optimization. After exposing a property of a cone-subconvexlike function, we prove that a local weakly efficient solution, a local efficient solution and a local properly efficient solution are respectively a global weakly efficient solution, a global efficient solution and a global properly efficient solution of a multiobjective programming problem if cone- subconvexlikeness or cone-pre-invexity is assumed     

Solving nonlinearly constrained global optimization problem via an auxiliary function method

This paper considers the nonlinearly constrained continuous global minimization problem. Based on the idea of the penalty function method, an auxiliary function, which has approximately the same global minimizers as the original problem, is constructed. An algorithm is developed to minimize the auxiliary function to find an approximate constrained global minimizer of the constrained global minimization problem. The algorithm can escape from the previously converged local minimizers, and can converge to an approximate global minimizer of the problem asymptotically with probability one. Numerical experiments show that it is better than some other well known recent methods for constrained global minimization problems.     

非线性光学中薛定谔型方程的整体吸引子

研究了一类非线性薛定谔型方程,描述了光波在光折射晶体中的传播.首先构造了该模型整体弱的吸引子,然后通过能量方程的精确分析,证明整体弱吸引子实际为系统整体强吸引子.最后给出了整体吸引子的分形维数和Hausdorff维数的上界估计.     

On Weierstrass extreme value theorem

We show that suitable restatements of the classical Weierstrass extreme value theorem give necessary and sufficient conditions for the existence of a global minimum and of both a global minimum and a global maximum.     

Global Weyl modules for the twisted loop algebra

We define global Weyl modules for twisted loop algebras and analyze their highest weight spaces, which are in fact isomorphic to Laurent polynomial rings in finitely many variables. We are able to show that the global Weyl module is a free module of finite rank over these rings. Furthermore we prove, that there exist injective maps from the global Weyl modules for twisted loop algebras into a direct sum of global Weyl modules for untwisted loop algebras. Relations between local Weyl modules for twisted and untwisted generalized current algebras are known; we provide for the first time a relation on global Weyl modules.     

Partial hybrid finite elements for composite laminates

Three types of partial hybrid finite elements are presented in order to set up a global/local finite element model for analysis of composite laminates. In the global/local model, a composite laminate is divided into three different regions: global, local, and transition regions. These are modeled using three different elements. In the global region, a 4-node degenerated plate/shell element is used to model the overall response of the composite laminate. In the local region, a multilayer element is used to predict detailed stress distribution. In the transition region, a multilayer transition element is used to smoothly connect the two previous elements. The global/local finite element model satisfies the compatibility of displacement at the boundary between the global region and the local region. It also satisfies the continuity of transverse stresses at interlaminar surfaces and traction conditions on the top and bottom surfaces of composite laminates. The global/local finite element model has high accuracy and efficiency for stress analysis of composite laminates. A numerical example of analysis of a laminated strip with free edge is presented to illustrate the accuracy and efficiency of the model.     

带状区域中渐近周期曲率流方程的整体解

该文研究了具有渐近周期系数的曲率流方程的Neumann边值问题.首先,考虑一列初值问题及其相应的全局解,通过一致的先验估计取一个收敛子列,得到其极限就是一个整体解的结论.其次,向负无穷时间方向进行重整化,使用强极值原理证明了整体解的唯一性.最后,为了研究整体解的ω-和α-极限,再次使用重整化方法,通过构造拉回函数、进行...     

Stochastic Global Optimization: Problem Classes and Solution Techniques

There is a lack of a representative set of test problems for comparing global optimization methods. To remedy this a classification of essentially unconstrained global optimization problems into unimodal, easy, moderately difficult, and difficult problems is proposed. The problem features giving this classification are the chance to miss the region of attraction of the global minimum, embeddedness of the global minimum, and the number of minimizers. The classification of some often used test problems are given and it is recognized that most of them are easy and some even unimodal. Global optimization solution techniques treated are global, local, and adaptive search and their use for tackling different classes of problems is discussed. The problem of fair comparison of methods is then adressed. Further possible components of a general global optimization tool based on the problem classes and solution techniques is presented.     

The classic differential evolution algorithm and its convergence properties

Differential evolution algorithms represent an up to date and efficient way of solving complicated optimization tasks. In this article we concentrate on the ability of the differential evolution algorithms to attain the global minimum of the cost function. We demonstrate that although often declared as a global optimizer the classic differential evolution algorithm does not in general guarantee the convergence to the global minimum. To improve this weakness we design a simple modification of the classic differential evolution algorithm. This modification limits the possible premature convergence to local minima and ensures the asymptotic global convergence. We also introduce concepts that are necessary for the subsequent proof of the asymptotic global convergence of the modified algorithm. We test the classic and modified algorithm by numerical experiments and compare the efficiency of finding the global minimum for both algorithms. The tests confirm that the modified algorithm is significantly more efficient with respect to the global convergence than the classic algorithm.     

Unifying local–global type properties in vector optimization

It is well-known that all local minimum points of a semistrictly quasiconvex real-valued function are global minimum points. Also, any local maximum point of an explicitly quasiconvex real-valued function is a global minimum point, provided that it belongs to the intrinsic core of the function’s domain. The aim of this paper is to show that these “local min–global min” and “local max–global min” type properties can be extended and unified by a single general local–global extremality principle for certain generalized convex vector-valued functions with respect to two proper subsets of the outcome space. For particular choices of these two sets, we recover and refine several local–global properties known in the literature, concerning unified vector optimization (where optimality is defined with respect to an arbitrary set, not necessarily a convex cone) and, in particular, classical vector/multicriteria optimization.     

Integral global minimization: Algorithms,implementations and numerical tests

The theoretical foundation of integral global optimization has become widely known and well accepted [4],[24],[25]. However, more effort is needed to demonstrate the effectiveness of the integral global optimization algorithms. In this work we detail the implementation of the integral global minimization algorithms. We describe how the integral global optimization method handles nonconvex unconstrained or box constrained, constrained or discrete minimization problems. We illustrate the flexibility and the efficiency of integral global optimization method by presenting the performance of algorithms on a collection of well known test problems in global optimization literature. We provide the software which solves these test problems and other minimization problems. The performance of the computations demonstrates that the integral global algorithms are not only extremely flexible and reliable but also very efficient.Research supported partially by NSERC grant and Mount St Vincent University research grant.     

Closure and connected component of a planar global semianalytic set defined by analytic functions definable in o-minimal structure

We consider a global semianalytic set defined by real analytic functions definable in an o-minimal structure. When the o-minimal structure is polynomially bounded, we show that the closure of this set is a global semianalytic set defined by definable real analytic functions. We also demonstrate that a connected component of a planar global semianalytic set defined by real analytic functions definable in a substructure of the restricted analytic field is a global semianalytic set defined by definable real analytic functions.     

New Runge–Kutta Based Schemes for ODEs with Cheap Global Error Estimation

We present a particular 5th order one-step integrator for ODEs that provides an estimation of the global error. It's based on the class of one-step integrator for ODEs of Murua and Makazaga considered as a generalization of the globally embedded RK methods of Dormand, Gilmore and Prince. The scheme we present cheaply gives useful information on the behavior of the global error. Some numerical experiments show that the estimation of the global error reflects the propagation of the true global error. Moreover we present a new step-size adjustment strategy that takes advantage of the available information about the global error. The new strategy is specially suitable for problems with exponential error growth.