Gradient descent - Wikipedia
https://en.wikipedia.org/wiki/Gradient_descent
OverviewDescriptionSolution of a linear systemSolution of a non-linear systemCommentsModificationsExtensionsTheoretical propertiesGradient descent is a method for unconstrained mathematical optimization. It is a first-order iterative algorithm for finding a local minimum of a differentiable multivariate function. The idea is to take repeated steps in the opposite direction of the gradient (or approximate gradient) of the function at the current point, because this is the direction of steepest descent. Conversely, stepping in the direction of the gradient will lead to a local maximum of that function; …
DA: 88 PA: 87 MOZ Rank: 33