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.     

加速牛顿迭代收敛的新方法

提出了加速牛顿迭代收敛的新思想，构造出一类加权牛顿迭代格式，通过选取最优加权因子，使得该格式具有高阶收敛性和较小的渐近误差常数。     

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

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

Duffing-van der Pol振子随机分岔的全局分析

应用广义胞映射方法研究了参激和外激共同作用的Duffing-van der Pol振子的随机分岔.以 系统参数通过某一临界值时，如果系统的随机吸引子或随机鞍的形态发生突然变化，则认为 系统发生随机分岔为定义，分析了参激强度和外激强度的变化对于随机分岔的影响.揭示了 随机分岔的发生主要是由于系统的随机吸引子与系统的随机鞍碰撞产生的.分析表明，广义 胞映射方法是分析随机分岔的有力工具，这种全局分析方法可以清晰地给出随机分岔的发生 和发展. 关键词： 随机分岔 全局分析 广义胞映射方法 随机吸引子 随机鞍     

共轭下降法的全局收敛性

本文提出了一种Armijo型的线搜索，并在这种线搜索下讨论了共轭下降法的全局收敛性，且可得方法在每次迭代均产生一个下降搜索方向．     

Evaluation of the Lazarus-Leblond constants in the asymptotic model of the interfacial wavy crack

The paper addresses the problem of a semi-infinite plane crack along the interface between two isotropic half-spaces. Two methods of solution have been considered in the past: Lazarus and Leblond [1998a. Three-dimensional crack-face weight functions for the semi-infinite interface crack-I: variation of the stress intensity factors due to some small perturbation of the crack front. J. Mech. Phys. Solids 46, 489-511, 1998b. Three-dimensional crack-face weight functions for the semi-infinite interface crack-II: integrodifferential equations on the weight functions and resolution J. Mech. Phys. Solids 46, 513-536] applied the “special” method by Bueckner [1987. Weight functions and fundamental fields for the penny-shaped and the half-plane crack in three space. Int. J. Solids Struct. 23, 57-93] and found the expression of the variation of the stress intensity factors for a wavy crack without solving the complete elasticity problem; their solution is expressed in terms of the physical variables, and it involves five constants whose analytical representation was unknown; on the other hand, the “general” solution to the problem has been recently addressed by Bercial-Velez et al. [2005. High-order asymptotics and perturbation problems for 3D interfacial cracks. J. Mech. Phys. Solids 53, 1128-1162], using a Wiener-Hopf analysis and singular asymptotics near the crack front.The main goal of the present paper is to complete the solution to the problem by providing the connection between the two methods. This is done by constructing an integral representation for Lazarus-Leblond's weight functions and by deriving the closed form representations of Lazarus-Leblond's constants.     

Discrete global descent method for discrete global optimization and nonlinear integer programming

A novel method, entitled the discrete global descent method, is developed in this paper to solve discrete global optimization problems and nonlinear integer programming problems. This method moves from one discrete minimizer of the objective function f to another better one at each iteration with the help of an auxiliary function, entitled the discrete global descent function. The discrete global descent function guarantees that its discrete minimizers coincide with the better discrete minimizers of f under some standard assumptions. This property also ensures that a better discrete minimizer of f can be found by some classical local search methods. Numerical experiments on several test problems with up to 100 integer variables and up to 1.38 × 10¹⁰⁴ feasible points have demonstrated the applicability and efficiency of the proposed method.     

Solving a class of multiplicative programming problems via c-programming

In this note we show that many classes of global optimization problems can be treated most satisfactorily by classical optimization theory and conventional algorithms. We focus on the class of problems involving the minimization of the product of several convex functions on a convex set which was studied recently by Kunoet al. [3]. It is shown that these problems are typical composite concave programming problems and thus can be handled elegantly by c-programming [4]–[8] and its techniques.     

心理素质诊断模型的建立与应用

综合运用国内外多种测量量表对大学生的心理素质进行诊断与测试 ,并应用多元统计分析方法对其心理素质结构主因素进行定量分析 ,在此基础上建立了心理素质诊断模型 ,并运用该模型对实际问题进行了分析 .