Domain sensitivity for singular elliptic problems: Harmonic transformation approach

A method for computing the sensitivities of functionals depending on the solutions of elliptic equations defined over variable domains is presented. It is based on the material derivative approach and allows the uniform treatment of both singular and nonsingular cases. The novelty consists in defining the vector field connected with the domain transformation as the solution of an auxiliary elliptic equation. Such a choice does not restrict the range of admissible goal functionals and has many advantages from the numerical point of view. It allows one also to consider singular domain variations.     

Unconstrained and constrained global optimization of polynomial functions in one variable

In Floudas and Visweswaran (1990), a new global optimization algorithm (GOP) was proposed for solving constrained nonconvex problems involving quadratic and polynomial functions in the objective function and/or constraints. In this paper, the application of this algorithm to the special case of polynomial functions of one variable is discussed. The special nature of polynomial functions enables considerable simplification of the GOP algorithm. The primal problem is shown to reduce to a simple function evaluation, while the relaxed dual problem is equivalent to the simultaneous solution of two linear equations in two variables. In addition, the one-to-one correspondence between the x and y variables in the problem enables the iterative improvement of the bounds used in the relaxed dual problem. The simplified approach is illustrated through a simple example that shows the significant improvement in the underestimating function obtained from the application of the modified algorithm. The application of the algorithm to several unconstrained and constrained polynomial function problems is demonstrated.     

基于增广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　ＩｎｔｒｏｄｕｃｔｉｏｎＣｏｎｓｉｄｅｒｔｈｅｆｏｌｌｏｗｉｎｇｎｏｎｌｉｎｅａｒｏｐｔｉｍｉｚａｔｉｏｎｐｒｏｂｌｅｍ :ｍｉｎｉｍｉｚｅｆ(ｘ)ｓｕｂｊｅｃｔｔｏＣ(ｘ) =0 ,　ａ≤ｘ≤ｂ ,( 1 .1 )ｗｈｅｒｅｆ(ｘ) :Ｒｎ→Ｒ ,Ｃ(ｘ) =(ｃ1(ｘ) ,ｃ2 (ｘ) ,...,ｃｍ(ｘ) ) Ｔ:Ｒｎ→Ｒｍ ａｒｅｔｗｉｃｅｃｏｎｔｉｎｕｏｕｓｌｙｄｉｆｆｅｒｅｎｔｉａｂｌｅ,ｍ≤ｎ ,ａ ,ｂ∈Ｒｎ.Ｔｒｕｓｔｒｅｇｉｏｎａｌｇｏｒｉｔｈｍｓａｒｅｖｅｒｙｅｆｆｅｃｔｉｖｅｆｏｒｓｏｌｖｉｎｇｎｏｎｌｉｎｅａｒｏｐｔｉｍｉ…     

具有功能反应的两斑块扩散时滞竞争系统正周期解的存在性

§ 1　ＩｎｔｒｏｄｕｃｔｉｏｎＦｏｒｍａｎｙｓｐｅｃｉｅｓｔｈｅｓｐａｔｉａｌｆａｃｔｏｒｓａｒｅｉｍｐｏｒｔａｎｔｉｎｐｏｐｕｌａｔｉｏｎｄｙｎａｍｉｃｓ .Ｔｈｅｔｈｅｏｒｅｔｉｃａｌｓｔｕｄｙｏｆｓｐａｔｉａｌｄｉｓｔｒｉｂｕｔｉｏｎｈａｓｂｅｅｎｅｘｔｅｎｓｉｖｅｌｙｓｔｕｄｉｅｄｉｎｍａｎｙｐａｐｅｒｓ .Ｍｏｓｔｏｆｔｈｅｐｒｅｖｉｏｕｓｐａｐｅｒｓｆｏｃｕｓｅｄｏｎｔｈｅｃｏｅｘｉｓｔｅｎｃｅｏｆｐｏｐｕｌａｔｉｏｎｓｍｏｄｅｌｌｅｄｂｙｓｔｓｔｅｍｓｏｆｏｒｄｉｎａｒｙｄｉｆｆｅｒｅ…     

TESTING DIFFERENT CONJUGATE GRADIENT METHODS FOR LARGE—SCALE UNCONSTRAINED OPTIMIZATION

In this PaPer we test different conjugate gradient (CG) methods for solving large-scale unconstrained optimization problems.The methods are divided in two groups:the first group includes five basic CG methods and the second five hybrid CG methods.A collection of medium-scale and large-scale test problems are drawn from a standard code of test problems.CUTE.The conjugate gradient methods are ranked according to the numerical results.Some remarks are given.     

非线性差分方程组多正解的存在性

本文应用不动点指数理论证明了一个非线性差分方程组多正解的存在性.     

分布式配送系统在运输时间均匀分布条件下的性能分析

本文在运输时间不确定的前提下，对分布式配送系统在两个部件和最终产品早到无限制的情形下建立了随机优化模型。我们在极小化库存费用的同时以满足定时送货要求为目标，讨论了如何确定运输提前期，并给出了敏感性分析结果。     

不等式组与变分不等式的极大熵函数方法

利用极大熵函数方法将不等式组及变分不等式的求解问题转化为近似可微优化问题，给出了不等式组及变分不等式问题近似解的可微优化方法，得到了不等式组和变分不等式问题的解集合的示性函数．     

开关布局中本质不同的开关线路计算

通过对开关布局问题的研究，来解决一类象开关线路一样比较特殊，比较复杂的布局优化问题。从而寻找出这类问题的全局优化算法。本应用对称群对集合的作用，轨道，不动点等讨论了开关布局问题，给出了本质不同的开关线路个数的计算公式。