A line search chooses a positive step size along a search vector , updating to . For a differentiable function , a descent direction makes sufficiently short steps decrease the objective function; an Armijo condition quantifies the decrease, while the Wolfe conditions also prevent accepting an unnecessarily short step.
Suppose is bounded below on its initial level set, continuously differentiable with a Lipschitz gradient nearby, and each descent direction uses a step satisfying fixed Wolfe conditions. If , the displayed series converges. In particular a uniform positive lower bound on these cosines gives .
For a gradient Lipschitz constant , the curvature condition gives . Sufficient decrease then gives . Summing and using the lower bound on proves the assertion.
A search direction is the nonzero vector used in the displayed optimization update. In a line search with positive step size, its orientation matters: a descent direction has negative directional derivative of the objective function. Minimization over a full line instead permits either sign of .
A line search that finds a global minimizer along the chosen ray, provided one exists. For a negative gradient direction, its decrease in the objective function is at least that of any admissible fixed step size. The cost of solving this one-dimensional minimization problem must be included when comparing computation time.
Target: vector-space.bigb, under Vector subspace.
A vector is a descent direction for a differentiable function at if its directional derivative is negative. The first-order expansion then gives for sufficiently small positive . The negative gradient is a descent direction whenever the gradient is nonzero.
For a nonzero gradient, this unit direction minimizes the directional derivative among Euclidean unit directions. The Cauchy-Schwarz inequality gives , with equality for the displayed direction. The steepest descent method usually uses the equivalent unnormalized direction and chooses a separate step length. A different choice of norm can change the steepest direction.
For and a descent direction , the Armijo condition asks for a decrease at least a fixed fraction of the decrease predicted by the first-order Taylor expansion. Put . Differentiability gives for all sufficiently small positive . Thus the condition is satisfiable without a second derivative.
Start with a trial step size and repeatedly replace by , with , until the Armijo condition holds. For a differentiable function and a descent direction, the short-step argument in the Armijo condition proves finite termination. This alone does not enforce the curvature part of the Wolfe conditions.
For a continuously differentiable function, a descent direction and , the Wolfe conditions require both the Armijo condition and
This second inequality is the weak curvature condition: the slope must have become less negative. The strong variant instead requires . The weak version already guarantees a positive curvature pair for the Quasi-Newton secant equation.
Suppose is continuously differentiable, is a descent direction, and is bounded below for . A positive step size satisfying the weak Wolfe conditions exists. To prove this, put , , and . The Armijo condition proof shows just to the right of zero. Boundedness below gives . Consequently there is a first positive zero , with on . By the mean value theorem, some satisfies
At , gives the Armijo condition, and the displayed derivative gives the weak Wolfe conditions.

Ancestors (4)

  1. Mathematical optimization
  2. Area of mathematics
  3. Mathematics
  4. Home

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

Line search is an optimization technique used to find a minimum (or maximum) of a function along a specified direction. It is commonly employed in gradient-based optimization algorithms, especially in the context of iterative methods like gradient descent, where the goal is to minimize a differentiable function. ### Key Components of Line Search: 1. **Objective Function**: The function \( f(x) \) that we want to minimize.