Article ID: | iaor2003737 |
Country: | Germany |
Volume: | 91 |
Issue: | 2 |
Start Page Number: | 289 |
End Page Number: | 305 |
Publication Date: | Jan 2002 |
Journal: | Mathematical Programming |
Authors: | Nocedal J., Marazzi M. |
Keywords: | programming: quadratic |
A new method for derivative-free optimization is presented. It is designed for solving problems in which the objective function is smooth and the number of variables is moderate, but the gradient is not available. The method generates a model that interpolates the objective function at a set of sample points, and uses trust regions to promote convergence. The step-generation subproblem ensures that all the iterates satisfy a geometric condition and are therefore adequate for updating the model. The sample points are updated using a scheme that improves the accuracy of the interpolation model when needed. Two versions of the method are presented: one using linear models and the other using quadratic models. Numerical tests comparing the new approach with established methods for derivate-free optimization are reported.