so hopefully the sequence ( x n ) {\displaystyle (\mathbf {x} _{n})} converges to the desired local minimum. Note that the value of the step size γ {\displaystyle \gamma } is allowed to change at every iteration. With certain assumptions on the function F {\displaystyle F} (for example, F {\displaystyle F} convex and ∇ F {\displaystyle \nabla F} Lipschitz) and particular choices of γ {\displaystyle \gamma } (e.g., chosen either via a line search that satisfies the Wolfe conditions, or the Barzilai–Borwein method[2][3] shown as following),