A new conjugate gradient method and its global convergence under the exact line search
Citations Over Time
Abstract
The conjugate gradient methods are numerously used for solving nonlinear unconstrained optimization problems, especially of large scale. Their wide applications are due to their simplicity and low memory requirement. To analyze conjugate gradient methods, two types of line searches are used; exact and inexact. In this paper, we present a new method of nonlinear conjugate gradient methods under the exact line search. The theoretical analysis shows that the new method generates a descent direction in each iteration and globally convergent under the exact line search. Moreover, numerical experiments based on comparing the new method with other well known conjugate gradient methods show that the new is efficient for some unconstrained optimization problems.
Related Papers
- → Two modified conjugate gradient methods for solving unconstrained optimization and application(2023)7 cited
- → A New Conjugate Gradient Method with Exact Line Search(2018)1 cited
- → Global convergence of a new class nonlinear conjugate gradient method with exact line search(2021)1 cited
- → New conjugacy condition with pair-conjugate gradient methods for unconstrained optimization(2009)
- A New Modified HS Conjugate Gradient Method and the Global Convergence(2015)