This document discusses conjugate direction methods for optimization. Specifically, it introduces the conjugate gradient method, which is an algorithm for finding the minimum of a function. The document was prepared by Shaheen Sardar, a professor at Hanyang University in South Korea. It provides references for further reading on conjugate gradient methods and linear/nonlinear programming.

1. Conjugate direction methods
Prepared by: Shaheen Sardar
Ph.D. Industrial and Management Engineering
Hanyang University, South Korea

3. Conjugate gradient method

4. Conjugate gradient method

24. References
1. M. Erdmann. Lecture notes for 16-811 Mathematical
Fundamentals for Robotics. The Robotics Institute,
Carnegie Mellon University, 1998.
2. David G. Luenberger and Yinyu Ye. Linear and
Nonlinear Programming. Addison-Wesley, 3rd edition,
2008.http://eng.uok.ac.ir/mfathi/Courses/Advanced%
20Eng%20Math/Linear%20and%20Nonlinear%20Prog
ramming.pdf
3. Conjugate Gradient Method. Com S 477/577. Nov 6,
2007.http://www.cs.iastate.edu/~cs577/handouts/c
onjugate-gradient.pdf

25. Thank You