On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
Authors:
- Stefano LucidiSLStefano Lucidi
- Marco SciandroneMSMarco Sciandrone
- 1 January 2002
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 13 (1) , 97-116
Abstract
In this paper, starting from the study of the common elements that some globally convergent direct search methods share, a general convergence theory is established for unconstrained minimization methods employing only function values. The introduced convergence conditions are useful for developing and analyzing new derivative-free algorithms with guaranteed global convergence. As examples, we describe three new algorithms which combine pattern and line search approaches.Keywords
This publication has 13 references indexed in Scilit:
- Fortified-Descent Simplicial Search Method: A General ApproachSIAM Journal on Optimization, 1999
- On the Convergence of Pattern Search AlgorithmsSIAM Journal on Optimization, 1997
- A class of unconstrained minimization methods for neural network trainingOptimization Methods and Software, 1994
- Direct Search Methods on Parallel MachinesSIAM Journal on Optimization, 1991
- Global convergence and stabilization of unconstrained minimization methods without derivativesJournal of Optimization Theory and Applications, 1988
- Stopping criteria for linesearch methods without derivativesMathematical Programming, 1984
- Optimization of functions whose values are subject to small errorsBIT Numerical Mathematics, 1977
- A superlinearly convergent algorithm for minimization without evaluating derivativesMathematical Programming, 1975
- An efficient method for finding the minimum of a function of several variables without calculating derivativesThe Computer Journal, 1964
- `` Direct Search'' Solution of Numerical and Statistical ProblemsJournal of the ACM, 1961