Abstract
In this chapter, considering the problem of computing the direction as solved (but do not forget that we have seen bad directions only, better ones will be studied in the next chapters), we focus on the computation of the stepsize. Here appear the most serious practical difficulties, while directions are generally easy to compute, once the theory is well-mastered. A firm experience is required to write a good computer code for line-searches, which are unique to optimization, and fairly important as they guarantee stability: remember Remark 1.4.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bonnans, J.F., Gilbert, J.C., Lemaréchal, C., Sagastizábal, C.A. (2003). Line-Searches. In: Numerical Optimization. Universitext. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-05078-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-05078-1_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00191-1
Online ISBN: 978-3-662-05078-1
eBook Packages: Springer Book Archive