A quadratic approximation-based local search operator for handling two equality constraints in continuous optimization problems

Carlos H. Fonseca, Elizabeth Fialho Wanner

Research output: Chapter in Book/Published conference outputConference publication

Abstract

This work presents extensions of the general methodology of employing quadratic approximations of the objective function and constraints for handling non-linear equality constraints in single-objective optimization problems. The methodology does not require any extra function evaluation since the quadratic approximations are constructed using only information that would be already obtained in the course of the optimization algorithms. The methodology is coupled with the Real Biased Genetic Algorithm to tackle non-linear single-objective optimization problems with two equality constraints. The modified algorithm is tested with a set of analytical problems. The results show the modified algorithm finds the constrained optima with enhanced precision and faster convergence. Considering that the new technique does not impose any additional cost to the algorithms, it can be stated that the technique is also suitable for costly black-box problems.

Original languageEnglish
Title of host publication2016 IEEE Congress on Evolutionary Computation (CEC)
PublisherIEEE
Pages4911-4917
Number of pages7
ISBN (Electronic)978-1-5090-0622-9
DOIs
Publication statusPublished - 14 Nov 2016
Event2016 IEEE Congress on Evolutionary Computation - Vancouver, Canada
Duration: 24 Jul 201629 Jul 2016

Congress

Congress2016 IEEE Congress on Evolutionary Computation
Abbreviated titleCEC 2016
Country/TerritoryCanada
CityVancouver
Period24/07/1629/07/16

Bibliographical note

-

Fingerprint

Dive into the research topics of 'A quadratic approximation-based local search operator for handling two equality constraints in continuous optimization problems'. Together they form a unique fingerprint.

Cite this