A Two-Term PRP-Based Descent Method
Author:
- 10 December 2007
- journal article
- research article
- Published by Taylor & Francis in Numerical Functional Analysis and Optimization
- Vol. 28 (11-12) , 1217-1230
Abstract
In this paper, by the use of the project of the PRP (Polak–Ribiére–Polyak) conjugate gradient direction, we develop a PRP-based descent method for solving unconstrained optimization problem. The method provides a sufficient descent direction for the objective function. Moreover, if exact line search is used, the method reduces to the standard PRP method. Under suitable conditions, we show that the method with some backtracking line search or the generalized Wolfe-type line search is globally convergent. We also report some numerical results and compare the performance of the method with some existing conjugate gradient methods. The results show that the proposed method is efficient.Keywords
This publication has 10 references indexed in Scilit:
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergenceIMA Journal of Numerical Analysis, 2006
- Algorithm 851ACM Transactions on Mathematical Software, 2006
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line SearchSIAM Journal on Optimization, 2005
- Benchmarking optimization software with performance profilesMathematical Programming, 2002
- CUTEACM Transactions on Mathematical Software, 1995
- Global Convergence Properties of Conjugate Gradient Methods for OptimizationSIAM Journal on Optimization, 1992
- Efficient generalized conjugate gradient algorithms, part 1: TheoryJournal of Optimization Theory and Applications, 1991
- On the limited memory BFGS method for large scale optimizationMathematical Programming, 1989
- Convergence Properties of Algorithms for Nonlinear OptimizationSIAM Review, 1986
- The conjugate gradient method in extremal problemsUSSR Computational Mathematics and Mathematical Physics, 1969