Some computable schemes for descent methods without line search are proposed. Convergence properties are presented. Numerical experiments concerning large scale unconstrained minimization problems are reported.
unconstrained optimization; descent methods; step-size estimation; convergence
