Journal of Optimization Theory and Applications

, Volume 64, Issue 2, pp 379–397

Efficient hybrid conjugate gradient techniques

  • D. Touati-Ahmed
  • C. Storey
Contributed Papers

DOI: 10.1007/BF00939455

Cite this article as:
Touati-Ahmed, D. & Storey, C. J Optim Theory Appl (1990) 64: 379. doi:10.1007/BF00939455

Abstract

Descent property and global convergence proofs are given for a new hybrid conjugate gradient algorithm. Computational results for this algorithm are also given and compared with those of the Fletcher-Reeves method and the Polak-Ribière method, showing a considerable improvement over the latter two methods. We also give new criteria for restarting conjugate gradient algorithms that prove to be computationally very efficient. These criteria provide a descent property and global convergence for any conjugate gradient algorithm using a nonnegative update β.

Key Words

Static optimization Fletcher-Reeves method Polak-Ribière method hybrid conjugate-gradient algorithms 

Copyright information

© Plenum Publishing Corporation 1990

Authors and Affiliations

  • D. Touati-Ahmed
    • 1
  • C. Storey
    • 1
  1. 1.Department of MathematicsLoughborough University of TechnologyLoughboroughEngland

Personalised recommendations