Conjugate-Direction Methods


In the multidimensional optimization methods described so far, the direction of search in each iteration depends on the local properties of the objective function. Although a relation may exist between successive search directions, such a relation is incidental. In this chapter, methods are described in which the optimization is performed by using sequential search directions that bear a strict mathematical relationship to one another. An important class of methods of this type is a class based on a set of search directions known as conjugate directions.


Line Search Quadratic Problem Conjugate Direction Solution Trajectory Solve Prob 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. R. Hestenes and E. L. Stiefel, “Methods of conjugate gradients for solving linear systems,” J. Res. Natl. Bureau Standards, vol. 49, pp. 409–436, 1952.MATHMathSciNetGoogle Scholar
  2. 2.
    R. Fletcher and C. M. Reeves, “Function minimization by conjugate gradients,” Computer J., vol. 7, pp. 149–154, 1964.MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    M. J. D. Powell, “An efficient method for finding the minimum of a function of several variables without calculating derivatives,” Computer J., vol. 7, pp. 155–162, 1964.MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    W. I. Zangwill, “Minimizing a function without calculating derivatives,” Computer J., vol.10, pp. 293–296, 1968.CrossRefMathSciNetGoogle Scholar
  5. 5.
    R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, New York, 1985.MATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Personalised recommendations