Volume 51, Number 4, October-December 2017
|Page(s)||1101 - 1117|
|Published online||24 November 2017|
Globally convergence of nonlinear conjugate gradient method for unconstrained optimization
Received: 9 January 2017
Accepted: 5 April 2017
The conjugate gradient method is a useful and powerful approach for solving large-scale minimization problems. In this paper, a new nonlinear conjugate gradient method is proposed for large-scale unconstrained optimization. This method include the already existing two practical nonlinear conjugate gradient methods, to combine the nice global convergence properties of Fletcher-Reeves method (abbreviated FR) and the good numerical performances of the Polak–Ribiére–Polyak method (abbreviated PRP), which produces a descent search direction at every iteration and converges globally provided that the line search satisfies the Wolfe conditions. Our numerical results show that of the new method is very efficient for the given test problems. In addition we will study the methods related to the new nonlinear conjugate gradient method.
Mathematics Subject Classification: 65K05 / 90C25 / 90C26 / 90C27 / 90C30
Key words: Unconstrained optimization / conjugate gradient method / line search / global convergence
© EDP Sciences, ROADEF, SMAI 2017
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.