A line search is an optimization procedure that chooses a step length along a specified search direction. Given a current point , a direction
,
and an objective function
,
it seeks a scalar
for which
produces sufficient improvement. An exact line search minimizes over the allowed values of
,
while an inexact line search commonly enforces the Armijo or Wolfe conditions.