A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
Indexed incrossref
Abstract
A new nonlinear conjugate gradient method and an associated implementation, based on an inexact line search, are proposed and analyzed. With exact line search, our method reduces to a nonlinear version of the Hestenes–Stiefel conjugate gradient scheme. For any (inexact) line search, our scheme satisfies the descent condition gT k dk ≤ − 7 8 ‖gk‖2. Moreover, a global convergence result is established when the line search fulfills the Wolfe conditions. A new line search scheme is developed that is efficient and highly accurate. Efficiency is achieved by exploiting properties of linear interpolants in a neighborhood of a local minimizer. High accuracy is achieved by using a convergence criterion, which we call…
Citation impact
1,105
total citations
- FWCI
- 24.57
- Percentile
- 100%
- References
- 34
Citations per year
Authors
2Topics & keywords
Topics
Keywords
- Line search
- Conjugate gradient method
- Broyden–Fletcher–Goldfarb–Shanno algorithm
- Nonlinear conjugate gradient method
- Mathematics
- Gradient descent
- Convergence (economics)
- Line (geometry)
No related works found for this paper.