On a reduction line search filter method for nonlinear semi-Infinite programming problems
In this paper, a reduction-type method combined with a line search filter method to solve nonlinear semi-infinite programming problems is presented. The algorithm uses the simulated annealing method equipped with a function stretching technique to compute the maximizers of the constraint, and a pena...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | conferencePaper |
| Idioma: | eng |
| Publicado em: |
2008
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/9691 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/9691 |
| Resumo: | In this paper, a reduction-type method combined with a line search filter method to solve nonlinear semi-infinite programming problems is presented. The algorithm uses the simulated annealing method equipped with a function stretching technique to compute the maximizers of the constraint, and a penalty technique to solve the reduced finite optimization problem. The filter method is used as an alternative to merit functions to guarantee convergence from poor starting points. Preliminary numerical results with a problems test set are shown. |
|---|