The convergence properties of the Fletcher-Reeves method for unconstrained
optimization are further studied with the technique of generalized line sea
rch. Two conditions are given which guarantee the global convergence of the
Fletcher-Reeves method using generalized Wolfe line searches or generalize
d Arjimo line searches, whereas an example is constructed showing that the
conditions cannot be relaxed in certain senses.