Get access

Steepest descent

Authors

  • Juan C. Meza

    Corresponding author
    1. High Performance Computing Research, Lawrence Berkeley National Laboratory, 1 Cyclotron Road, Berkeley, CA, USA
    • High Performance Computing Research, Lawrence Berkeley National Laboratory, 1 Cyclotron Road, Berkeley, CA, USA
    Search for more papers by this author

Abstract

The steepest descent method has a rich history and is one of the simplest and best known methods for minimizing a function. While the method is not commonly used in practice due to its slow convergence rate, understanding the convergence properties of this method can lead to a better understanding of many of the more sophisticated optimization methods. Here, we give a short introduction and discuss some of the advantages and disadvantages of this method. Some recent results on modified versions of the steepest descent method are also discussed. WIREs Comp Stat 2010 2 719–722 DOI: 10.1002/wics.117

For further resources related to this article, please visit the WIREs website.

Get access to the full text of this article

Ancillary