Header menu link for other important links
X
Investigating EA solutions for approximate KKT conditions in smooth problems
R. Tulshyan, R. Arora, K. Deb,
Published in
2010
Pages: 689 - 696
Abstract
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity, non-differentiability, multi-modality and noise in problems. However, an EA's solution is never guaranteed to be optimal in generic problems, even for smooth problems, and importantly EAs still lack a theoretically motivated termination criterion for stopping an EA run only when a near-optimal point is found. We address both these issues in this paper by integrating the Karush-Kuhn-Tucker (KKT) optimality conditions that involve first-order derivatives of objective and constraint functions with an EA. For this purpose, we define a KKT-proximity measure by relaxing the complimentary slackness condition associated with the KKT conditions. Results on a number of standard constrained test problems indicate that in spite of not using any gradient information and any theoretical optimality conditions, an EA's selection, recombination and mutation operation lead the search process to a point close to the KKT point. This suggests that the proposed KKT-proximity measure can be used a termination criterion in an EA simulation. Copyright 2010 ACM.
About the journal
JournalProceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10