Abstract
Conjugate gradient methods are a class of important methods for unconstrained optimization, especially when the dimension is large. This paper proposes a new conjugacy condition, which considers an inexact line search scheme but reduces to the old one if the line search is exact. Based on the new conjugacy condition, two nonlinear conjugate gradient methods are constructed. Convergence analysis for the two methods is provided. Our numerical results show that one of the methods is very efficient for the given test problems.
Original language | English |
---|---|
Pages (from-to) | 87-101 |
Number of pages | 15 |
Journal | Applied Mathematics and Optimization |
Volume | 43 |
Issue number | 1 |
DOIs | |
Publication status | Published - Jan 2001 |
Scopus Subject Areas
- Control and Optimization
- Applied Mathematics