The filled function method is an approach for solving unconstrained global minimization problem.
填充函数法是一种解无约束全局极小化问题的方法。
The properties of this filled function and a global minimization method based on the filled function are analyzed.
给出一类求解总体极值问题的填充函数,分析了该填充函数的特性与基于填充函数的总体极小化方法。
Then, we consider a new filled function method with parameter free for solving general global optimization problems.
然后,对于一般结构的全局优化问题,我们给出了一个新的无参数的填充函数方法。
A new filled function with one parameter is used to find a global minimizer for unconstrained global optimization problems.
考虑用单参数填充函数求解无约束全局优化问题。
In this paper, a filled function method for solving global optimization problems with inequality and equality constraints is proposed.
提出了一种解决含有等式约束及不等式约束的全局优化问题的填充函数方法。
It gives an interval enclosure for filled function and presents an interval filled function algorithm to solve this nonsmooth optimization.
给出了填充函数的区间扩张,并提出了求解该非光滑优化问题的区间填充函数算法。
This paper proposes a new global optimization technique in which combines the filled function method and BP algorithm for Training feedforward neural networks.
把填充函数法与BP算法相结合,提出一种训练前向神经网络的混合型全局优化新算法。
This paper presents a neighborhood search algorithm for finding a local minimal solution of the problem, then a filled function method for solving 0-1 programming is proposed.
文章首先给出搜索0-1规划局部极小解的邻域搜索算法,在此基础上给出了填充函数算法。
In the article, we propose a new filled function and also conclude many numerical examples using the function. According to the numerical examples we can get that the filled function is effective.
本文给出了一个新的填充函数,并且利用所构造的填充函数得出了大量的算例,通过算例可以说明所构造的填充函数的有效性。
In the article, we propose a new filled function and also conclude many numerical examples using the function. According to the numerical examples we can get that the filled function is effective.
本文给出了一个新的填充函数,并且利用所构造的填充函数得出了大量的算例,通过算例可以说明所构造的填充函数的有效性。
应用推荐