| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 631.07 KB | Adobe PDF |
Orientador(es)
Resumo(s)
The filter method is a technique for solving nonlinear programming problems. The filter algorithm has two phases in each iteration. The first one reduces a measure of infeasibility, while in the second the objective function value is reduced. In real optimization problems, usually the objective function is not differentiable or its derivatives are unknown. In these cases it becomes essential to use optimization methods where the calculation of the derivatives or the verification of their existence is not necessary: direct search methods or derivative-free methods are examples of such techniques. In this work we present a new direct search method, based on simplex methods, for general constrained optimization that combines the features of simplex and filter methods. This method neither computes nor approximates derivatives, penalty constants or Lagrange multipliers.
Descrição
Palavras-chave
Nonlinear constrained optimization Filter methods Direct search methods
Contexto Educativo
Citação
Editora
University of Zielona Gora Press