Overview#Gradient descent is a first-order iterative optimization algorithm for finding the minimum values of a function.
To find a local minimum of a function using Gradient descent, one takes steps proportional to the negative of the gradient (or of the approximate gradient) of the function at the current point. If instead one takes steps proportional to the positive of the gradient, one approaches a local maximum of that function; the procedure is then known as gradient ascent.
Gradient descent is also known as steepest descent. However, Gradient descent should not be confused with the method of steepest descent for approximating integrals.