The gradient descent can be combined with a line search, finding the locally optimal step size γ {\displaystyle \gamma } on every iteration. Performing the line search can be time-consuming. Conversely, using a fixed small γ {\displaystyle \gamma } can yield poor convergence.