Gradient descent is an iterative optimization algorithm for finding the minimum of a differentiable function. At the current parameters it computes the gradient of the loss function and then moves the parameters in the direction opposite to the steepest increase, by an amount proportional to the learning rate, repeating until the loss stops decreasing. In neural network training, the gradients obtained by backpropagation are passed to this algorithm to update the weights.
In practice, stochastic gradient descent (SGD), which estimates the gradient from a small mini-batch rather than the full dataset, is the common form, and optimizers such as momentum and Adam that adjust the direction and step size are all built on gradient descent.