Experiences with reduction method to solve semi-infinite programming problems
In this talk, some variants of reduction-type method combined with a line search filter method to solve nonlinear semi-infinite programming problems are presented. We use the stretched simulated annealing method and the branch and bound technique to compute the maximizers of the constraint. The filt...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | conferenceObject |
| Language: | eng |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10198/7442 |
| Country: | Portugal |
| Oai: | oai:bibliotecadigital.ipb.pt:10198/7442 |
| Summary: | In this talk, some variants of reduction-type method combined with a line search filter method to solve nonlinear semi-infinite programming problems are presented. We use the stretched simulated annealing method and the branch and bound technique to compute the maximizers of the constraint. The filter method is used as an alternative to merit functions to promote convergence from poor starting points. |
|---|