in mathematics, gradient descent is a first-order iterative optimization algorithm for finding a local minimum of a differentiable function. the idea is to take repeated steps in the opposite direction of the gradient of the function at the current point, because this is the direction of steepest descent.