A computational study on different penalty functions with DIRECT algorithm
The most common approach for solving constrained optimization problems is based on penalty functions, where the constrained problem is transformed into an unconstrained problem by penalizing the objective function when constraints are violated. In this paper, we analyze the implementation of penalty...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | conferencePaper |
| Idioma: | eng |
| Publicado em: |
2013
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/25200 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/25200 |
| Resumo: | The most common approach for solving constrained optimization problems is based on penalty functions, where the constrained problem is transformed into an unconstrained problem by penalizing the objective function when constraints are violated. In this paper, we analyze the implementation of penalty functions, within the DIRECT algorithm. In order to assess the applicability and performance of the proposed approaches, some benchmark problems from engineering design optimization are considered. |
|---|