Conjugate Gradient Methods

Shashi Kant Mishra () and Bhagwat Ram
Additional contact information
Shashi Kant Mishra: Banaras Hindu University, Department of Mathematics
Bhagwat Ram: Banaras Hindu University, Department of Mathematics

Chapter Chapter 8 in Introduction to Unconstrained Optimization with R, 2019, pp 211-244 from Springer

Abstract: Abstract Our interest in the conjugate gradient methods is twofold. First, they are among the most useful techniques to solve a large system of linear equations. Second, they can be adopted to solve large nonlinear optimization problems. In the previous chapters, we studied two important methods for finding a minimum point of real-valued functions of n real variables, namely, the steepest descent method and Newton’s method. The steepest descent method is easy to apply. However, convergence is often very slow. On the other hand, Newton’s algorithm normally has rapid convergence but involves considerable computation at each step. Recall Newton’s method, which involves the computation of Hessian of the function at every iteration. It is always required to reserve space for storing $$n\times n$$ Hessian to run this algorithm. Also, Newton’s method does not choose n suitable directions for n number of variables of the function. If the inverse of Hessian is not available, then Newton’s method fails to find the minimum point. These drawbacks are the central theme in the development of an important class of minimization algorithms, what so-called the conjugate direction algorithm. It uses the history of the previous iteration for creating new search directions. The conjugate direction method acts as an intermediate method between the steepest descent method and Newton’s method.

Date: 2019
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-981-15-0894-3_8

Ordering information: This item can be ordered from
http://www.springer.com/9789811508943

DOI: 10.1007/978-981-15-0894-3_8

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().