An adaptive penalty method for DIRECT algorithm in engineering optimization

By Vila?a, R.; Rocha, A.M.A.C.

AIP Conference Proceedings

2012

Abstract

The most common approach for solving constrained optimization problems is based on penalty functions, where the constrained problem is transformed into a sequence of unconstrained problem by penalizing the objective function when constraints are violated. In this paper, we analyze the implementation of an adaptive penalty method, within the DIRECT algorithm, in which the constraints that are more difficult to be satisfied will have relatively higher penalty values. In order to assess the applicability and performance of the proposed method, some benchmark problems from engineering design optimization are considered.

ALGORITMI Members

RepositoriUM:

Google Scholar: