By Topic

A Weak Filled Function Algorithm for Unconstrained Searching Optimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Guiyu Li ; Key Wireless Network Optimization Center of Guangzhou, Guangdong Planning & Designing Inst. of Telecommun. Co., Ltd., Guangzhou, China ; Jiongcheng Li ; Henghui Xiao ; Shengpei Ding

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.

Published in:

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

Date of Conference:

17-18 Nov. 2012