×

Strong convergence analysis of the new relaxation nonmonotone line search algorithm. (Chinese. English summary) Zbl 1389.90304

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
PDFBibTeX XMLCite