By Topic

Constrained optimization using the quasi-chaotic optimization method with the exact penalty function and the sequential quadratic programming

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
$33 $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

2 Author(s)
Takashi Okamoto ; Graduate School of Engineering, Chiba University, JAPAN ; Hironori Hirata

In this study, we propose a new constrained optimization method using the quasi-chaotic optimization method (Q-COM) with the exact penalty function and the Sequential Quadratic Programming (SQP). The Q-COM, which has been proposed recently, is a global optimization method to solve unconstrained optimization problems in which the simultaneous perturbation gradient approximation is introduced into the chaotic optimization method to apply to a class of problems whose objective function values only can be computed. The SQP is well known and powerful constrained optimization method to find local optimal solution. In the proposed method, the Q-COM with the exact penalty function is used as the global search method and the SQP is used as the local search method. We confirm the effectiveness of the proposed method through applications to various types of benchmark problems that include the coil spring design problem and the benchmark problems used in the special session on constrained real parameter optimization in CEC2006.

Published in:

Systems, Man, and Cybernetics (SMC), 2011 IEEE International Conference on

Date of Conference:

9-12 Oct. 2011