A Weak Filled Function Algorithm for Unconstrained Searching Optimization

Author

Guiyu Li ; Jiongcheng Li ; Henghui Xiao ; Shengpei Ding

Author_Institution

Key Wireless Network Optimization Center of Guangzhou, Guangdong Planning & Designing Inst. of Telecommun. Co., Ltd., Guangzhou, China

fYear

2012

fDate

17-18 Nov. 2012

Firstpage

31

Lastpage

34

Abstract

Aiming at the optimization algorithm, weak filled function method is proposed and which with simple form is constructed. The restriction of this method is weaker than the known filled function method, thus it is easier to construct function and solve algorithm. The weak filled function method is feasible through the theoretical analysis, and the global minimum of simulation example can be obtained in its interval. The results indicate that weak filled function method is an effective method.

Keywords

optimisation; search problems; unconstrained searching optimization; weak filled function algorithm; Algorithm design and analysis; Approximation methods; Linear programming; Minimization; Neural networks; Optimization; Search problems; Unconstrained searching optimization; global minimum; local minimum; weak filled function method;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Intelligence and Security (CIS), 2012 Eighth International Conference on

Conference_Location

Guangzhou

Print_ISBN

978-1-4673-4725-9

Type

conf

DOI

10.1109/CIS.2012.15

Filename

6405861