Choosing descent directions in unconstrained minimization problems (Q909994)

The author introduces the concept of the best descent direction with respect to a given set from \({\mathbb{R}}^ n\), for a directionally differentiable function of n variables. Then he proposes two algorithms for unconstrained minimization of convex differentiable functions and he proves corresponding convergence results.