A new filled function method based on adaptive search direction and valley widening for global optimization

被引:0
作者
Xiangjuan Wu
Yuping Wang
Ninglei Fan
机构
[1] Xidian University,School of Computer Science and Technology
来源
Applied Intelligence | 2021年 / 51卷
关键词
Adaptive search direction; Valley widening; Filled function; Global optimization;
D O I
暂无
中图分类号
学科分类号
摘要
The filled function methods are a kind of effective method to find the global minimum for optimization problems. However, there exist four limitations to this kind of method: 1) A large number of local minima may take a lot of iterations (time and computation cost) for the methods to find the global minimum. 2) The parameters (if any) in the constructed filled function are difficult to adjust and control. 3) It is hard to select a proper initial point. The initial point can affect the effectiveness of the method greatly. 4) The narrow valleys will make the method difficult to find a more superior minimum. To break the limitations, we use a flatten technique to eliminate a number of local minima firstly. Then we design a new continuously filled function without any adjustable parameter. Moreover, we propose an adaptive strategy for determining the initial points by using uniformly distributed search directions. Furthermore, we propose a narrow valley widening strategy which can make it much easier for the filled function method to get a more superior minimum in the narrow valleys. Based on these strategies, we develop a new effective filled function method. 7 widely used benchmark functions are tested and the performance comparison is made between the developed method and two state-of-the-art filled function methods. The experimental results demonstrate that the developed method in this work is more effective than the compared algorithms for solving global optimization problems.
引用
收藏
页码:6234 / 6254
页数:20
相关论文
共 102 条
[1]  
Ahmadianfar I(2020)Gradient-based optimizer: A new metaheuristic optimization algorithm Inf Ences 540 131-159
[2]  
Bozorg-Haddad O(2020)Heap-based optimizer inspired by corporate rank hierarchy for global optimization Expert Syst Appl 113702 161-1256
[3]  
Chu X(2016)A new filled function method applied to unconstrained global optimization Appl Math Comput 273 1246-527
[4]  
B QAA(2014)A new filled function method with two parameters for global optimization J Optim Theory Appl 163 510-695
[5]  
B MS(2015)A new filled function method for global optimization Appl Math Comput 268 685-204
[6]  
B IY(1990)A filled function method for finding a global minimizer of a function of several variables Math Program 46 191-252
[7]  
El-Gindy TM(1987)A class of filled functions for finding global minimizers of a function of several variables J Optim Theory Appl 54 241-137
[8]  
Salim MS(2006)Algorithm 851: CG_DESCENT, a conjugate gradient method with guaranteed descent ACM Trans Math Softw 32 113-3279
[9]  
Ahmed AI(2018)Improved one-class classification using filled function. Appl Intell 48 3263-5859
[10]  
Fei W(2011)A new filled function algorithm for constrained global optimization problems Appl Math Comput 217 5853-872