Skip to main content

Nonmonotone conjugate gradient methods for optimization

  • Contributed Papers
  • Conference paper
  • First Online:
System Modelling and Optimization

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 197))

Abstract

In this paper conjugate gradient methods with nonmonotone line search technique are introduced. This new line search technique is based on a relaxation of the strong Wolfe conditions and it allows to accept larger steps. The proposed conjugate gradient methods are still globally convergent and, at the same time, they should not suffer the propensity for short steps of some classical conjugate gradient methods. Hence, these new methods should be able to tackle efficiently large scale highly nonlinear (possibly ill-conditioned) problems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. J. D. Powell, Nonconvex minimization calculations and the conjugate gradient method, in Lecture Notes in Mathematics 1066, Springer-Verlag, Berlin, 1984, pp. 122–141.

    Google Scholar 

  2. M. Al-Baali, Descent property and global convergence of the Fletcher-Reeves methods with inexact line search, IMA J. Numer. Anal., 5 (1985), pp. 121–124.

    Article  MATH  MathSciNet  Google Scholar 

  3. D. Touati-Ahmed, C. Storey, Efficient Hybrid Conjugate Gradient Techniques, Journal of Optimization Theory and Applications, 64 (1990), pp. 379–397.

    Article  MATH  MathSciNet  Google Scholar 

  4. J. C. Gilbert, J. Nocedal, Global convergence properties of conjugate gradient methods for optimization, SIAM J. Optimization, 2 (1992), pp. 21–42.

    Article  MATH  MathSciNet  Google Scholar 

  5. M. J. D. Powell, Restart procedures for the conjugate gradient method, Math. Programming, 12 (1977), pp. 241–254.

    Article  MATH  MathSciNet  Google Scholar 

  6. L. Grippo, F. Lampariello, S. Lucidi, A nonmonotone linesearch technique for Newton's method, SIAM J. Numer. Anal. 23, (1986) pp. 707–716.

    Article  MATH  MathSciNet  Google Scholar 

  7. L. Grippo, F. Lampariello, S. Lucidi, A class of nonmonotone stabilization methods in unconstrained optimization, Numer. Math. 59, (1991) pp. 779–805.

    Article  MATH  MathSciNet  Google Scholar 

  8. S. Lucidi, M. Roma, Nonmonotone conjugate gradient methods for optimization, Technical Report IASI-CNR, R. 342, (1992)

    Google Scholar 

  9. J.J. Moré, D. J. Thuente, Line Search Algorithms with Guaranteed Sufficient Decrease, to appear in ACM Transaction on Math. Soft.

    Google Scholar 

  10. L. Grippo, Metodi di ottimizzazione non vincolata, Report IASI-CNR, RI. 64, (1988) (in Italian)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jacques Henry Jean-Pierre Yvon

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag

About this paper

Cite this paper

Lucidi, S., Roma, M. (1994). Nonmonotone conjugate gradient methods for optimization. In: Henry, J., Yvon, JP. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035469

Download citation

  • DOI: https://doi.org/10.1007/BFb0035469

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19893-2

  • Online ISBN: 978-3-540-39337-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics