Several sufficient conditions for the global convergence of the Davidon–Fletcher–Powell algorithm

Several sufficient conditions for the global convergence of the Davidon–Fletcher–Powell algorithm

0.00 Avg rating0 Votes
Article ID: iaor2000509
Country: China
Volume: 21
Issue: 2
Start Page Number: 179
End Page Number: 186
Publication Date: Apr 1998
Journal: Acta Mathematicae Applicatae Sinica
Authors: ,
Abstract:

In this paper, for unconstrained optimization problems with uniformly convex objective functions; several sufficient conditions are given for the global convergence of the Davidon–Fletcher–Powell algorithm with Wolfe inexact line search.

Reviews

Required fields are marked *. Your email address will not be published.