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...

ver descrição completa

Detalhes bibliográficos
Autor principal: Pereira, Ana I. (author)
Outros Autores: Fernandes, Edite M.G.P. (author)
Formato: conferenceObject
Idioma:eng
Publicado em: 2012
Assuntos:
Texto completo:http://hdl.handle.net/10198/7442
País:Portugal
Oai:oai:bibliotecadigital.ipb.pt:10198/7442
Descrição
Resumo: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.