Global convergence of the fletcher-reeves algorithm with inexact linesearch

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

In this paper, we investigate the convergence properties of the Fletcher-Reeves algorithm. Under conditions weaker than those in a paper of M. Al-Baali, we get the global convergence of the Fletcher-Reeves algorithm with a low-accuracy inexact linesearch.

This work is supported by the National Natural Science Foundation of China