Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/14490| Título: | Branch-and-bound reduction type method for semi-infinite programming |
| Autor(es): | Pereira, Ana I. P. N. Fernandes, Edite Manuela da G. P. |
| Palavras-chave: | Semi-infinite programming Reduction method Branch-and-bound Nonlinear optimization Global optimization |
| Data: | Jun-2011 |
| Editora: | Springer Verlag |
| Revista: | Lecture Notes in Computer Science |
| Resumo(s): | Semi-infinite programming (SIP) problems can be efficiently solved by reduction type methods. Here, we present a new reduction method for SIP, where the multi-local optimization is carried out with a multi-local branch-and-bound method, the reduced (finite) problem is approximately solved by an interior point method, and the global convergence is promoted through a two-dimensional filter line search. Numerical experiments with a set of well-known problems are shown. |
| Tipo: | Artigo em ata de conferência |
| URI: | https://hdl.handle.net/1822/14490 |
| ISBN: | 978-3-642-21930-6 |
| DOI: | 10.1007/978-3-642-21931-3_23 |
| ISSN: | 0302-9743 |
| Arbitragem científica: | yes |
| Acesso: | Acesso aberto |
| Aparece nas coleções: | LES/ALG - Textos completos em actas de encontros científicos internacionais com arbitragem |
Ficheiros deste registo:
| Ficheiro | Descrição | Tamanho | Formato | |
|---|---|---|---|---|
| paper_APEF_ICCSA-AOA.pdf | 109,95 kB | Adobe PDF | Ver/Abrir |
