Skip to main content
Springer Nature Link
Log in

Conjugate-Gradient Methods

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

Introduction

  Notation and Preliminaries

Linear CG Algorithms

Nonlinear CG Algorithms

Nonlinear CG-Related Algorithms

  Classical Alternatives to CG

  Nonlinear CG Variants

  Variable-Storage/Limited-Memory Algorithms

  Affine-Reduced-Hessian Algorithms

Conclusion

See also

References

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Adams L, Nazareth JL (1996) Linear and nonlinear conjugate gradient-related methods. SIAM, Philadelphia

    MATH  Google Scholar 

  2. Barrett R, Berry M, Chan TF, Demmel J, Donato J, Dongarra J, Eijkhout V, Pozo R, Romine C, Vorst H van der (1993) Templates for the solution of linear systems. SIAM, Philadelphia

    MATH  Google Scholar 

  3. Bertsekas DP (1999) Nonlinear programming, 2nd edn. Athena Sci, Belmont, MA

    MATH  Google Scholar 

  4. Buckley A (1978) Extending the relationship between the conjugate gradient and BFGS algorithms. Math Program 15:343–348

    Article  MATH  MathSciNet  Google Scholar 

  5. Dai YH (1997) Analyses of nonlinear conjugate gradient methods. PhD Diss Inst Computational Math Sci/Engin Computing Chinese Acad Sci, Beijing, China

    Google Scholar 

  6. Davidon WC (1991) Variable metric method for minimization. SIAM J Optim 1:1–17, (Original (with a different preface): Argonne Nat Lab Report ANL-5990 (Rev, Argonne, Illinois)

    Article  MATH  MathSciNet  Google Scholar 

  7. Fenelon MC (1981) Preconditioned conjugate-gradient-type methods for large-scale unconstrained optimization. PhD Diss Stanford Univ, Stanford, CA

    Google Scholar 

  8. Fletcher R, Reeves C (1964) Function minimization by conjugate gradients. Computer J 7:149–154

    Article  MATH  MathSciNet  Google Scholar 

  9. Golub GH, O'Leary DP (1989) Some history of the conjugate gradient and Lanczos algorithms 1948–1976. SIAM Rev 31:50–102

    Article  MATH  MathSciNet  Google Scholar 

  10. Hestenes MR (1980) Conjugate direction methods in optimization. Appl Math, vol 12. Springer, Berlin

    MATH  Google Scholar 

  11. Hestenes MR, Stiefel EL (1952) Methods of conjugate gradients for solving linear systems. J Res Nat Bureau Standards (B) 49:409–436

    MATH  MathSciNet  Google Scholar 

  12. Kolda TG, O'Leary DP, Nazareth JL (1998) BFGS with update skipping and varying memory. SIAM J Optim 8:1060–1083

    Article  MATH  MathSciNet  Google Scholar 

  13. Leonard MW (1995) Reduced Hessian quasi-Newton methods for optimization. PhD Diss Univ Calif, San Diego, CA

    Google Scholar 

  14. Luenberger DG (1984) Linear and nonlinear programming, 2nd edn. Addison-Wesley, Reading, MA

    MATH  Google Scholar 

  15. Nazareth JL (1979) A relationship between the BFGS and conjugate gradient algorithms and its implications for new algorithms. SIAM J Numer Anal 16:794–800

    Article  MATH  MathSciNet  Google Scholar 

  16. Nazareth JL (1986) The method of successive affine reduction for nonlinear minimization. Math Program 35:97–109

    Article  MATH  MathSciNet  Google Scholar 

  17. Nesterov YE (1983) A method of solving a convex programming problem with convergence rate O(1/k2). Soviet Math Dokl 27:372–376

    MATH  Google Scholar 

  18. Nocedal J (1980) Updating quasi-Newton matrices with limited storage. Math Comput 35:773–782

    Article  MATH  MathSciNet  Google Scholar 

  19. Nocedal J (1992) Theory of algorithms for unconstrained optimization. Acta Numer 1:199–242

    MathSciNet  Google Scholar 

  20. Polak E, Ribière G (1969) Note sur la convergence de methode de directions conjuguees. Revue Franc Inform Rech Oper 16:35–43

    Google Scholar 

  21. Polyak BT (1964) Some methods of speeding up the convergence of iteration methods. USSR Comput Math Math Phys 4:1–17

    Article  Google Scholar 

  22. Polyak BT (1969) The conjugate gradient method in extremal problems. USSR Comput Math Math Phys 9:94–112

    Article  Google Scholar 

  23. Powell MJD (1977) Restart procedures for the conjugate gradient method. Math Program 12:241–254

    Article  MATH  MathSciNet  Google Scholar 

  24. Shah BV, Buehler RJ, Kempthorne O (1964) Some algorithms for minimizing a function of several variables. J SIAM 12:74–91

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department Pure and Applied Math., Washington State University, Pullman, USA

    J. L. Nazareth

  2. Department Applied Math., University Washington, Seattle, USA

    J. L. Nazareth

Authors
  1. J. L. Nazareth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Nazareth, J.L. (2008). Conjugate-Gradient Methods . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_85

Download citation

Publish with us

Policies and ethics

Search

Navigation