Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points
Authors:
- Andrew R. ConnACAndrew R. Conn
- Katya ScheinbergKSKatya Scheinberg
- Luís N. VicenteLVLuís N. Vicente
- 1 January 2009
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 20 (1) , 387-415
Abstract
In this paper we prove global convergence for first- and second-order stationary points of a class of derivative-free trust-region methods for unconstrained optimization. These methods are based on the sequential minimization of quadratic (or linear) models built from evaluating the objective function at sample sets. The derivative-free models are required to satisfy Taylor-type bounds, but, apart from that, the analysis is independent of the sampling techniques. A number of new issues are addressed, including global convergence when acceptance of iterates is based on simple decrease of the objective function, trust-region radius maintenance at the criticality step, and global convergence for second-order critical points.Keywords
This publication has 11 references indexed in Scilit:
- Introduction to Derivative-Free Optimization2009
- Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolationIMA Journal of Numerical Analysis, 2008
- Geometry of interpolation sets in derivative free optimizationMathematical Programming, 2006
- Optimizing partially separable functions without derivativesOptimization Methods and Software, 2005
- On trust region methods for unconstrained minimization without derivativesMathematical Programming, 2003
- Wedge trust region methods for derivative free optimizationMathematical Programming, 2002
- On the Lagrange functions of quadratic models that are defined by interpolation*Optimization Methods and Software, 2001
- An Example of Non-Convergence of Trust Region Algorithms1998
- Direct search algorithms for optimization calculationsActa Numerica, 1998
- A New Algorithm for Unconstrained Optimization1970