Method of Steepest Descent -- from Wolfram MathWorld

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

Method of Steepest Descent -- from Wolfram MathWorld

Introduction to Method of Steepest Descent

Lecture 8: Gradient Descent (and Beyond)

Intensity Constraint Gradient-Based Image Reconstruction

Wolfram Multivariable Calculus Course Assistant on the App Store

What is convolution? - Questions and Answers ​in MRI

Steepest Descent Method - an overview

Steepest descent vs gradient method – GeoGebra

Steepest Descent Rate

Jack Brzezinski on LinkedIn: Wolfram

Implementing the Steepest Descent Algorithm in Python from Scratch

Demonstratio Mathematica

Doing Spy Stuff with Mathematica : r/programming

Method of Steepest Descent, PDF, Maxima And Minima