Convergence of implementable descent algorithms for unconstrained optimization (Q1573997)

Having the paper of \textit{A. N. Iusem} and \textit{B. F. Svaiter} about a proximal regularization of the steepest descent method [RAIRO-Rech. Opér. 29, 123-130 (1995; Zbl 0835.90066)] in mind and using quasi-Fejér convergence it is shown, that for quasiconvex objectives the whole sequence, obtained by a suitable descent algorithm with Armijo step size rule, is convergent.