Improved Strategies for Radial basis Function Methods for Global Optimization

We propose some strategies that can be shown to improve the performance of the radial basis function (RBF) method by Gutmann [J. Global optim. 19(3), 201–227 (2001a)] (Gutmann-RBF) and the RBF method by Regis and Shoemaker [J. Global optim. 31, 153–171 (2005)] (CORS–RBF) on some test problems when they are initialized by symmetric Latin hypercube designs (SLHDs). Both methods are designed for the global optimization of computationally expensive functions with multiple local optima. We demonstrate how the original implementation of Gutmann-RBF can sometimes converge slowly to the global minimum on some test problems because of its failure to do local search. We then propose Controlled Gutmann-RBF (CG-RBF), which is a modification of Gutmann-RBF where the function evaluation point in each iteration is restricted to a subregion of the domain centered around a global minimizer of the current RBF model. By varying the size of this subregion in different iterations, we ensure a better balance between local and global search. Moreover, we propose a complete restart strategy for CG-RBF and CORS-RBF whenever the algorithm fails to make any substantial progress after some threshold number of consecutive iterations. Computational experiments on the seven Dixon and Szegö [Towards Global optimization, pp. 1–13. North-Holland, Amsterdam (1978)] test problems and on nine Schoen [J. Global optim. 3, 133–137 (1993)] test problems indicate that the proposed strategies yield significantly better performance on some problems. The results also indicate that, for some fixed setting of the restart parameters, the two modified RBF algorithms, namely CG-RBF-Restart and CORS-RBF-Restart, are comparable on the test problems considered. Finally, we examine the sensitivity of CG-RBF-Restart and CORS-RBF-Restart to the restart parameters.     

Local Accuracy for Radial Basis Function Interpolation on Finite Uniform Grids

We consider interpolation on a finite uniform grid by means of one of the radial basis functions (RBF) φ(r)=r^γ for γ>0, γ2 or φ(r)=r^γ ln r for γ2 ₊. For each positive integer N, let h=N⁻¹ and let {x_i: i =1, 2, …, (N+1)^d} be the set of vertices of the uniform grid of mesh-size h on the unit d-dimensional cube [0, 1]^d. Given f: [0, 1]^d→ , let s_h be its unique RBF interpolant at the grid vertices: s_h(x_i)=f(x_i), i=1, 2, …, (N+1)^d. For h→0, we show that the uniform norm of the error f−s_h on a compact subset K of the interior of [0, 1]^d enjoys the same rate of convergence to zero as the error of RBF interpolation on the infinite uniform grid h ^d, provided that f is a data function whose partial derivatives in the interior of [0, 1]^d up to a certain order can be extended to Lipschitz functions on [0, 1]^d.     

约束全局整数规划问题的填充函数法

本文给出了一类新的求解箱约束全局整数规划问题的填充函数，并讨论了其填充性质．基于提出的填充函数，设计了一个求解带等式约束、不等式约束、及箱约束的全局整数规划问题的算法．初步的数值试验结果表明提出的算法是可行的。     

A New Filled Function Method for Global Optimization

A novel filled function is suggested in this paper for identifying a global minimum point for a general class of nonlinear programming problems with a closed bounded domain. Theoretical and numerical properties of the proposed filled function are investigated and a solution algorithm is proposed. The implementation of the algorithm on several test problems is reported with satisfactory numerical results.     

求解Bratu型方程的径向基函数逼近法

基于径向基函数可以逼近几乎所有函数的强大逼近功能,借鉴弹塑性静力学的处理方法,提出位移、速度、加速度联合插值的径向基函数表达式,结合MATLAB数值软件进行计算机编程,成功求解了Bratu型强非线性方程,并给出相应的相对误差.通过分析几种典型的算例,并将计算结果与一些现有的数值分析法得到的数值解进行对比,表明了该方法的可行性和精确性,为求解强非线性Bratu型方程提供了一种新思路.     

Radial Basis Function methods—reduced computational expense by exploiting symmetry

Radial basis function (RBF) methods are popular methods for scattered data interpolation and for solving PDEs in complexly shaped domains. RBF methods are simple to implement as they only require elementary linear algebra operations. In this work, center locations that result in matrices with a centrosymmetric structure are examined. The resulting matrix structure can be exploited to reduce computational expense and improve the accuracy of the methods while avoiding more complicated techniques such as domain decomposition.     

Constrained Global Optimization of Expensive Black Box Functions Using Radial Basis Functions

We present a new strategy for the constrained global optimization of expensive black box functions using response surface models. A response surface model is simply a multivariate approximation of a continuous black box function which is used as a surrogate model for optimization in situations where function evaluations are computationally expensive. Prior global optimization methods that utilize response surface models were limited to box-constrained problems, but the new method can easily incorporate general nonlinear constraints. In the proposed method, which we refer to as the Constrained Optimization using Response Surfaces (CORS) Method, the next point for costly function evaluation is chosen to be the one that minimizes the current response surface model subject to the given constraints and to additional constraints that the point be of some distance from previously evaluated points. The distance requirement is allowed to cycle, starting from a high value (global search) and ending with a low value (local search). The purpose of the constraint is to drive the method towards unexplored regions of the domain and to prevent the premature convergence of the method to some point which may not even be a local minimizer of the black box function. The new method can be shown to converge to the global minimizer of any continuous function on a compact set regardless of the response surface model that is used. Finally, we considered two particular implementations of the CORS method which utilize a radial basis function model (CORS-RBF) and applied it on the box-constrained Dixon–Szegö test functions and on a simple nonlinearly constrained test function. The results indicate that the CORS-RBF algorithms are competitive with existing global optimization algorithms for costly functions on the box-constrained test problems. The results also show that the CORS-RBF algorithms are better than other algorithms for constrained global optimization on the nonlinearly constrained test problem.     

Refined Error Estimates for Radial Basis Function Interpolation

We discuss new and refined error estimates for radial-function scattered-data interpolants and their derivatives. These estimates hold on R ^d , the d-torus, and the 2-sphere. We employ a new technique, involving norming sets, that enables us to obtain error estimates, which in many cases give bounds orders of magnitude smaller than those previously known.     

New Modified Function Method for Global Optimization

In this paper, a class of global optimization problems is considered. Corresponding to each local minimizer obtained, we introduced a new modified function and construct a corresponding optimization subproblem with one constraint. Then, by applying a local search method to the one-constraint optimization subproblem and using the local minimizer as the starting point, we obtain a better local optimal solution. This process is continued iteratively. A termination rule is obtained which can serve as stopping criterion for the iterating process. To demonstrate the efficiency of the proposed approach, numerical examples are solved.This research was partially supported by the National Science Foundation of China, Grant 10271073.     

基于径向基函数网络的区域物流能力投资结构优化

针对如何有效地提高区域物流能力,以推动区域经济增长的问题,构建了区域物流能力的投资结构优化模型.首先详细分析了优化区域产业投资结构能增强区域物流能力的原因,从产业结构的角度揭示了区域物流能力与产业投资分配之间复杂的非线性关系;然后采用径向基函数神经网络实现了它们之间的非线性映射,进而建立了有约束条件限制的非线性规划投资结构优化模型;最后以四川省2005年的产业投资实际数据为基础,采用改进遗传算法对该模型进行求解,获得了优化问题的近似最优解以及投资结构的优化方向.优化结果表明:建立的模型对产业投资结构的优化是合理、有效的,从而提供了一个能提高区域物流能力的实用且切实可行的新方法.     

A Multivariate Global Optimization Using Linear Bounding Functions

Recently linear bounding functions (LBFs) were proposed and used to find -global minima. This paper presents an LBF-based algorithm for multivariate global optimization problems. The algorithm consists of three phases. In the global phase, big subregions not containing a solution are quickly eliminated and those which possibly contain the solution are detected. An efficient scheme for the local phase is developed using our previous local minimization algorithm, which is globally convergent with superlinear/quadratic rate and does not require evaluation of gradients and Hessian matrices. To ensure that the found minimizers are indeed the global solutions or save computation effort, a third phase called the verification phase is often needed. Under adequate conditions the algorithm finds the -global solution(s) within finite steps. Numerical testing results illustrate how the algorithm works, and demonstrate its potential and feasibility.     

Parametric Method for Global Optimization

This paper considers constrained and unconstrained parametric global optimization problems in a real Hilbert space. We assume that the gradient of the cost functional is Lipschitz continuous but not smooth. A suitable choice of parameters implies the linear or superlinear (supergeometric) convergence of the iterative method. From the numerical experiments, we conclude that our algorithm is faster than other existing algorithms for continuous but nonsmooth problems, when applied to unconstrained global optimization problems. However, because we solve 2n + 1 subproblems for a large number n of independent variables, our algorithm is somewhat slower than other algorithms, when applied to constrained global optimization.This work was partially supported by the NATO Outreach Fellowship - Mathematics 219.33.We thank Professor Hans D. Mittelmann, Arizona State University, for cooperation and support.     

基于多元二次径向基神经网络的偏微分求解方法

为提高偏微分方程的计算求解精度,设计了以多元二次径向基神经网络为求解单元的偏微分计算方法,给出了多元二次径向基神经网络的具体求解结构,并以此神经网络为求解基础,给出了具体的偏微分计算步骤.通过具体的偏微分求解实例验证方法的有效性,并以3种不同设计样本数构建的多元二次径向基神经网络为计算单元,从实例求解所需的计算时间以及解的精度作对比,结果表明,采用基于多元二次径向基神经网络的偏微分方程求解方法具有求解精度高以及计算效率低等特点.     

The Partition of Unity Method for High-Order Finite Volume Schemes Using Radial Basis Functions Reconstruction

This paper introduces the use of partition of unity method for the develop-ment of a high order finite volume discretization scheme on unstructured grids for solv-ing diffusion models based on partial differential equations. The unknown function and its gradient can be accurately reconstructed using high order optimal recovery based on radial basis functions. The methodology proposed is applied to the noise removal prob-lem in functional surfaces and images. Numerical results demonstrate the effectiveness of the new numerical approach and provide experimental order of convergence.     

New Classes of Globally Convexized Filled Functions for Global Optimization

We propose new classes of globally convexized filled functions. Unlike the globally convexized filled functions previously proposed in literature, the ones proposed in this paper are continuously differentiable and, under suitable assumptions, their unconstrained minimization allows to escape from any local minima of the original objective function. Moreover we show that the properties of the proposed functions can be extended to the case of box constrained minimization problems. We also report the results of a preliminary numerical experience.     

全局优化问题的一个无参数填充函数算法

填充函数法是求解全局优化问题的一种有效的确定性算法,方法的关键在于填充函数的构造.对于一般无约束优化问题提出了一个新的无参数填充函数,通过定义证明了此填充函数能保持填充性质.利用其理论性质设计了相应的算法并对几个经典的算例进行了数值实验,实验结果表明算法有效可行.     

一类关于非光滑全局优化的双参数填充函数

为在有界闭集上寻找非光滑函数的全局极小点,本文在文献[12]的基础上提出了一个改进的填充函数定义,然后给出了一个新的双参数填充函数.讨论了所给填充函数的理论和数值性质并设计了相应的算法.分析表明所给填充函数对参数的选择优于相关文献中的结果.数值实验表明,本文所给出的新的填充函数算法是有效的.     

实现快速全局优化的跨越函数方法

本文提出了一种快速求解全局优化问题的跨越函数方法,与以填充函数法为代表的一类全局优化方法相比,本文定义的跨越函数直接凸显了在求解全局优化问题时构造辅助函数的目的,更重要的是跨越函数方法能够一步跨过函数值比当前局部极小值高的区域,而直接找到原函数f(x)的位于函数值比当前局部极小值低的区域中的局部极小点,加快了全局寻优的过程,并且通过有限次迭代,找到全局最优解.     

导弹武器系统费用预测的径向基函数网络方法

提出采用径向基函数网络理论来估算导弹武器系统的费用,武器系统的费用与武器特征参数的关系可通过神经网络的阈值和权值来表现,并且对几种用于导弹武器系统费用分析的数据分析结果进行比较分析.通过实例说明了应用径向基函数网络进行导弹武器系统费用分析不但算法可行性好、拟合精度高,而且具有运算简单,结果可靠的特点.     

Spherical Scattered Data Quasi-interpolation by Gaussian Radial Basis Function

Since the spherical Gaussian radial function is strictly positive definite, the authors use the linear combinations of translations of the Gaussian kernel to interpolate the scattered data on spheres in this article. Seeing that target functions are usually outside the native spaces, and that one has to solve a large scaled system of linear equations to obtain combinatorial coefficients of interpolant functions, the authors first probe into some problems about interpolation with Gaussian radial functions. Then they construct quasiinterpolation operators by Gaussian radial function, and get the degrees of approximation. Moreover, they show the error relations between quasi-interpolation and interpolation when they have the same basis functions. Finally, the authors discuss the construction and approximation of the quasi-interpolant with a local support function.