Method of Steepest Descent -- from Wolfram MathWorld
Por um escritor misterioso
Descrição
An algorithm for finding the nearest local minimum of a function which presupposes that the gradient of the function can be computed. The method of steepest descent, also called the gradient descent method, starts at a point P_0 and, as many times as needed, moves from P_i to P_(i+1) by minimizing along the line extending from P_i in the direction of -del f(P_i), the local downhill gradient. When applied to a 1-dimensional function f(x), the method takes the form of iterating
Steepest Descent Method - an overview
Wolfram Multivariable Calculus Course Assistant on the App Store
Lecture 8: Gradient Descent (and Beyond)
Implementing the Steepest Descent Algorithm in Python from Scratch
Steepest descent vs gradient method – GeoGebra
IJMS, Free Full-Text
Lecture 7: Gradient Descent (and Beyond)
Steepest Descent - an overview
Gradient Descent Explained. A comprehensive guide to Gradient
