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.
Utilizza questo identificativo per citare o creare un link a questo documento:
http://hdl.handle.net/11573/16174
Titolo: | On the Global Convergence of Derivative Free Methods for Unconstrained Optimization |
Autori: | |
Data di pubblicazione: | 2002 |
Rivista: | |
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. |
Handle: | http://hdl.handle.net/11573/16174 |
Appare nella tipologia: | 01.a Pubblicazione su Rivista |
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.