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
Archimedean Solids - page includes images of each solid's net as
Doing Spy Stuff with Mathematica : r/programming
Understanding Gradient Descent in Python
File:Gradient descent with momentum.svg - Wikimedia Commons
Steepest Descent - an overview
Intro to optimization in deep learning: Gradient Descent
The Steepest-Descent Method - ppt video online download
WolframAlpha Pro Teaches Step-by-Step Arithmetic for All Grade
Curves of Steepest Descent for 3D Functions - Wolfram
