Skip to main content
Log in

A Spectral Conjugate Gradient Method for Unconstrained Optimization

  • Published:
Applied Mathematics & Optimization Submit manuscript

Abstract.

A family of scaled conjugate gradient algorithms for large-scale unconstrained minimization is defined. The Perry, the Polak—Ribière and the Fletcher—Reeves formulae are compared using a spectral scaling derived from Raydan's spectral gradient optimization method. The best combination of formula, scaling and initial choice of step-length is compared against well known algorithms using a classical set of problems. An additional comparison involving an ill-conditioned estimation problem in Optics is presented.

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.

Author information

Authors and Affiliations

Authors

Additional information

Accepted 22 August 2000. Online publication 26 February 2001.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Birgin, E., Martínez, J. A Spectral Conjugate Gradient Method for Unconstrained Optimization. Appl Math Optim 43, 117–128 (2001). https://doi.org/10.1007/s00245-001-0003-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00245-001-0003-0

Navigation