Line-Searches

  • J. Frédéric Bonnans
  • J. Charles Gilbert
  • Claude Lemaréchal
  • Claudia A. Sagastizábal
Part of the Universitext book series (UTX)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • J. Frédéric Bonnans
    • 1
  • J. Charles Gilbert
    • 1
  • Claude Lemaréchal
    • 2
  • Claudia A. Sagastizábal
    • 3
  1. 1.INRIA RocquencourtLe ChesnayFrance
  2. 2.INRIA Rhône-AlpesMontbonnot, Saint IsmierFrance
  3. 3.IMPAJardim Botânico, Rio de Janeiro-RJBrazil

Personalised recommendations