.png){kind=icon}
返回
A parameter free filled function for unconstrained global optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2009.10.057.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The filled function method is considered as an efficient method to find the global minimum of multidimensional functions. A number of filled functions were proposed recently, most of which have one or two adjustable parameters. However, there is no efficient criterion to choose the parameter appropriately. In this paper, we propose a filled function without parameter. And this function includes neither exponential terms nor logarithmic terms so it is superior to the traditional ones. Theories of the filled function are investigated. And an algorithm which does not compute gradients during minimizing the filled function is presented. Moreover, the numerical experiments demonstrate the efficiency of the proposed filled function. (C) 2009 Elsevier Inc. All rights reserved.
Keyword:
Filled function
Unconstrained global optimization
Local minimizer
Global minimizer
Filled function method
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容