Cart (Loading....) | Create Account
Close category search window
 

A new filled function algorithm for constrained global optimization problems

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

1 Author(s)
Liu Jie ; Coll. of Sci., Xi''an Univ. of Sci. & Technol., Xi''an, China

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.

Published in:

Computational Intelligence and Security (CIS), 2011 Seventh International Conference on

Date of Conference:

3-4 Dec. 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.