The memoryless quasi-Newton method stops short in creating an efficient compromise between a robust conjugate gradient algorithm and more efficient quasi-Newton method which uses limited storage.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2009). Limited Memory Quasi-Newton Algorithms. In: Conjugate Gradient Algorithms in Nonconvex Optimization. Nonconvex Optimization and Its Applications, vol 89. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85634-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-85634-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85633-7
Online ISBN: 978-3-540-85634-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)