Nonmonotone conjugate gradient algorithm without gradient Lipschitz continuity for nonconvex minimizations
Nonmonotone conjugate gradient algorithm without gradient Lipschitz continuity for nonconvex minimizations
Abstract For this article, a nonmonotone nonlinear gradient method framework is designed for nonconvex optimization problems. Using two classical nonmonotone line search techniques, the global convergence is proven, and we do not need the assumption that the gradient is Lipschitz continuous. Furthermore, a specific nonlinear gradient method using the Hardmar …