Global convergence of general derivative-free trust-region algorithms to first and second order critical points

In this paper we prove global convergence for first and second-order stationarity points of a class of derivative-free trust-region methods for unconstrained optimization. These methods are based on the sequential minimization of linear or quadratic models built from evaluating the objective functio...

ver descrição completa

Detalhes bibliográficos
Autor principal: Conn, Andrew R. (author)
Outros Autores: Scheinberg, Katya (author), Vicente, Luís Nunes (author)
Formato: other
Idioma:eng
Publicado em: 2006
Assuntos:
Texto completo:http://hdl.handle.net/10316/11325
País:Portugal
Oai:oai:estudogeral.sib.uc.pt:10316/11325
Descrição
Resumo:In this paper we prove global convergence for first and second-order stationarity points of a class of derivative-free trust-region methods for unconstrained optimization. These methods are based on the sequential minimization of linear or quadratic 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.