Solving semi-infinite programming problems using filter method

Pereira, Ana I.; Costa, M. Fernanda P.; Fernandes, Edite M.G.P.

http://hdl.handle.net/10198/4794

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
Resumo_EUROPT2010.pdf		525.57 KB	Unknown	Download

Send Feedback

Authors

Pereira, Ana I.

Costa, M. Fernanda P.

Fernandes, Edite M.G.P.

Abstract(s)

Semi-infinite programming problems can be efficiently solved by reduction type methods. Here, we present a new global reduction method for Semi-infinite programming, where the multi-local optimization is carried out with a stretched simulated annealing algorithm, the reduced problem is approximately solved by a primal-dual interior point method combined with a three-dimensional filter line search strategy, and the global convergence is promoted through a two-dimensional filter line search. Numerical experiments with a set of well-known problems are shown.

Keywords

Semi-infinite programming Nonlinear optimization

URI

http://hdl.handle.net/10198/4794

Citation

Pereira, Ana I.; Costa, M. Fernanda; Fernandes, Edite M.G.P. (2010). Solving semi-infinite programming problems using filter method. In 8th EUROPT Workshop on Advances in Continuous Optimization.