Source: wikibot/backtracking-line-search
= Backtracking line search
{wiki=Backtracking_line_search}
Backtracking line search is an optimization technique used to determine an appropriate step size for iterative algorithms, particularly in the context of gradient-based optimization methods. The goal of the line search is to find a step size that will sufficiently decrease the objective function while ensuring that the search doesn't jump too far, which could potentially lead to instability or divergence.