Referenced Items are not available for this document.
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
- Page(s):
- 31 - 34
- Print ISBN:
- 978-1-4673-4725-9
- INSPEC Accession Number:
- 13230831
- Conference Location :
- Guangzhou
- Digital Object Identifier :
- 10.1109/CIS.2012.15
- Product Type:
- Conference Publications
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
