Skip to main content
  • 162 Accesses

Abstract

In this chapter we shall consider a number of minimization methods which require the evaluation of the derivatives of the function as well as the function values themselves. Much of the theory surrounding such methods is strictly applicable only to quadratic functions (see Section 3.3), but fortunately many objective functions can be well approximated by quadratics in the neighbourhood of the minimum. We begin with an account of the simplest and possibly oldest of this type of minimization procedure, steepest descent.

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 EPUB and 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.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1987 B. S. Everitt

About this chapter

Cite this chapter

Everitt, B.S. (1987). Gradient methods. In: Introduction to Optimization Methods and their Application in Statistics. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-3153-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-3153-4_3

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-7917-4

  • Online ISBN: 978-94-009-3153-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics