DocumentCode
2985571
Title
A new filled function algorithm for constrained global optimization problems
Author
Jie, Liu
Author_Institution
Coll. of Sci., Xi´´an Univ. of Sci. & Technol., Xi´´an, China
fYear
2011
fDate
3-4 Dec. 2011
Firstpage
38
Lastpage
41
Abstract
A new filled function is proposed for solving constrained global optimization problems without the coercive condition. The filled function is proposed for escaping the current local minimizer of a constrained global problem by combining the idea of filled function in unconstrained global optimization and the idea of penalty function in constrained optimization. Some numerical results on some typical test problems using algorithm demonstrate the efficiency of the algorithm.
Keywords
optimisation; filled function algorithm; local minimizer; penalty function; typical test problems; unconstrained global optimization problems; Algorithm design and analysis; Economics; Educational institutions; Image processing; Mathematical programming; Search problems; constrained global optimization problems; filled function; filled function method;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Security (CIS), 2011 Seventh International Conference on
Conference_Location
Hainan
Print_ISBN
978-1-4577-2008-6
Type
conf
DOI
10.1109/CIS.2011.17
Filename
6128070
Link To Document