A Weak Filled Function Algorithm for Unconstrained Searching Optimization

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 fea...

Full description

Saved in:
Bibliographic Details
Main Authors: Guiyu Li, Jiongcheng Li, Henghui Xiao, Shengpei Ding
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Approximation methods
global minimum
Linear programming
local minimum
Minimization
Neural networks
Optimization
Search problems
Unconstrained searching optimization
weak filled function method
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
DOI:10.1109/CIS.2012.15