Please use this identifier to cite or link to this item:

TitleBranch-and-bound reduction type method for semi-infinite programming
Author(s)Pereira, Ana I. P. N.
Fernandes, Edite Manuela da G. P.
KeywordsSemi-infinite programming
Reduction method
Nonlinear optimization
Global optimization
Issue dateJun-2011
PublisherSpringer Verlag
JournalLecture Notes in Computer Science
Abstract(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.
TypeConference paper
AccessOpen access
Appears in Collections:LES/ALG - Textos completos em actas de encontros científicos internacionais com arbitragem

Files in This Item:
File Description SizeFormat 
paper_APEF_ICCSA-AOA.pdf109,95 kBAdobe PDFView/Open

Partilhe no FacebookPartilhe no TwitterPartilhe no DeliciousPartilhe no LinkedInPartilhe no DiggAdicionar ao Google BookmarksPartilhe no MySpacePartilhe no Orkut
Exporte no formato BibTex mendeley Exporte no formato Endnote Adicione ao seu ORCID