Hu, Ping Strong convergence analysis of the new relaxation nonmonotone line search algorithm. (Chinese. English summary) Zbl 1389.90304 Numer. Math., Nanjing 38, No. 4, 324-329 (2016). Summary: In this paper we give a new relaxation non-monotone line search rule for unconstrained optimization problems, construct a new non-monotone steepest descent algorithm, and prove that the algorithm has strong global convergence. MSC: 90C30 Nonlinear programming 65K05 Numerical mathematical programming methods Keywords:relaxation nonmonotone search algorithm; global convergence; steepest descent method; unconstrained optimization problem PDFBibTeX XMLCite \textit{P. Hu}, Numer. Math., Nanjing 38, No. 4, 324--329 (2016; Zbl 1389.90304)