Skip to main content
Log in

Convergence Properties of the Dependent PRP Conjugate Gradient Methods

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

In this paper, a new region of β k with respect to β k PRP is given. With two Armijo-type line searches, the authors investigate the global convergence properties of the dependent PRP conjugate gradient methods, which extend the global convergence results of PRP conjugate gradient method proved by Grippo and Lucidi (1997) and Dai and Yuan (2002).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. M. Al-Baali, Descent property and global convergence of the Fletcher-Reeves method with inexact line search, IMA J. Numer. Anal., 1985, 5: 121–124.

    Google Scholar 

  2. Y. H. Dai, Further insight into the convergence of the Fletcher-Reeves method, Science in China, 1999, 42(9): 905–916.

    Article  Google Scholar 

  3. Y. H. Dai and Y. X. Yuan, Convergence properties of the Fletcher-Reeves method, IMA J. Numer. Anal., 1996, 16(2): 155–164.

    Article  Google Scholar 

  4. J. C. Gilbert and J. Nocedal, Global Convergence properties of conjugate gradient methods for optimization, SIAM. J. Optimization, 1992, 2(1): 21–24.

    Article  Google Scholar 

  5. L. Grippo and S. Lucidi, A global convergent version of the Polak-Ribiere conjugate gradient method, Mathematical Programming, 1997, 78: 375–391.

    Article  Google Scholar 

  6. Y. F. Hu and C. Storey, Global convergence result for conjugate gradient methods, Journal of Optimization Theory and Application, 1991, 71(2): 399–405.

    Article  Google Scholar 

  7. G. H. Liu, J. Y. Han, and H. X. Yin, Global convergence of the Fletcher-Reeves algorithm with an inexact line search, Appl. Math. J. Chinese Univ. (Ser. B), 1995, 10: 75–82.

    Google Scholar 

  8. J. L. Nazareth, A view of conjugate gradient-related algorithms for nonlinear optimization, in Linear Conjugate Gradient-Related Methods (ed. by L. Adams and J. L. Nazareth), SIAM, Philadelphia, 1996, 149–163.

  9. M. J. D. Powell, Nonconvex minimization calculations and the conjugate gradient method, Lecture Notes in Mathematics, 1984, 1066: 122–141.

    Article  Google Scholar 

  10. D. Touati-Ahmed and C. Storey, Efficient hybrid conjugate gradient techniques, J. Optimization Theory Appl., 1990, 64: 379–397.

    Article  Google Scholar 

  11. G. Zoutendijk, Nonlinear programming, Computational Methods, in Integer and Nonlinear Programming (ed. by J. Abadie), North-Hollan, Amsterdam, 1970, 37–86.

  12. M. J. D. Powell, Convergence properties of algorithms for nonlinear optimization, SIAM Review, 1986, 28: 487–500.

    Article  Google Scholar 

  13. R. De Leone, M. Gaudiooso, and L. Grippo, Stopping criteria for linesearch methods without derivatives, Mathematical Programming, 1984, 30: 285–300.

    Google Scholar 

  14. Y. H. Dai and Y. X. Yuan, Conjugate gradient methods with Armijo-type line searches, Acta Mathematicae Applicatae Sinica (English Series), 2002, 18(1): 123–130.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shujun Lian.

Additional information

This work is supported by National Science Foundation of China (10571106) and the Foundation of Qufu Normal University.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lian, S., Wang, C. & Cao, L. Convergence Properties of the Dependent PRP Conjugate Gradient Methods. Jrl Syst Sci & Complex 19, 288–296 (2006). https://doi.org/10.1007/s11424-006-0288-9

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-006-0288-9

Key Word

Navigation