Active-set strategy in Powell's method for optimization without derivatives

AUTOR(ES)

Arouxét, Ma. Belén, Echebest, Nélida, Pilotta, Elvio A.

FONTE

Computational & Applied Mathematics

DATA DE PUBLICAÇÃO

2011

RESUMO

In this article we present an algorithm for solving bound constrained optimization problems without derivatives based on Powell's method [38] for derivative-free optimization. First we consider the unconstrained optimization problem. At each iteration a quadratic interpolation model of the objective function is constructed around the current iterate and this model is minimized to obtain a new trial point. The whole process is embedded within a trust-region framework. Our algorithm uses infinity norm instead of the Euclidean norm and we solve a box constrained quadratic subproblem using an active-set strategy to explore faces of the box. Therefore, a bound constrained optimization algorithm is easily extended. We compare our im_ plementation with NEWUOA and BOBYQA, Powell's algorithms for unconstrained and bound constrained derivative free optimization respectively. Numerical experiments show that, in general, our algorithm require less functional evaluations than Powell's algorithms.

Documentos Relacionados

• Numerical results for a globalized active-set Newton method for mixed complementarity problems
• GPU Finite Element Method Computation Strategy Without Mesh Coloring
• An Active Search Method for Finding Objects with Near-Optimal Property Values within a Given Set
• Um metodo de região de confiança para minimização irrestrita sem derivadas
• A strategy for organ allografts without using immunosuppressants or irradiation