Quasi-Newton 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 9 in Introduction to Unconstrained Optimization with R, 2019, pp 245-289 from Springer
Abstract:
Abstract The Quasi-Newton methodsQuasi-Newton methods do not compute the Hessian of nonlinear functions. The Hessian is updated by analyzing successive gradient vectors instead. The Quasi-Newton algorithm was first proposed by William C. Davidon, a physicist while working at Argonne National Laboratory, United States in 1959. In Newton’s method, we require to compute the inverse of the Hessian at every iterations which is a very expensive computation. It requires an order n cube effort if n is the size of the Hessian. These drawbacks of Newton’s method gave motivation to develop the Quasi-Newton methods. The idea of Quasi-Newton method is that to approximate the inverse of Hessian by some other matrix which should be positive definite so that we can get a good approximation of the Hessian inverse at a given iteration. This saves the work of computation of second derivatives and also avoids the difficulties associated with the loss of positive definiteness. This approximate matrix is updated on every iteration so that as the search direction proceeds the second-order derivative information improves. In this chapter, we present three important Quasi-Newton methods, and they are Rank One Correction Formula method, Davidon Fletcher Powell method, and Broyden–Fletcher–Goldfarb–Shanno 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_9
Ordering information: This item can be ordered from
http://www.springer.com/9789811508943
DOI: 10.1007/978-981-15-0894-3_9
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 ().