How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Wolfe and strong Wolfe line-search conditions
Definition
Let be open, let be (Continuously differentiable maps, local inverses, and local diffeomorphisms), let , and let . Define the open parameter set , which contains , the feasible ray , and for . At every , including , the chain rule gives . By A total derivative computes every directional derivative, and its matrix is the Jacobian, the matrix of is the Jacobian, whose scalar-field row is the transpose of the gradient. Hence , using the gradient convention of The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case and the Euclidean inner product of The Euclidean inner product on . A direction is a descent direction at when .
Assume for the line-search conditions below that is a descent direction at . Fix constants . A feasible step is a Wolfe step when
It is a strong Wolfe step when it satisfies the first inequality and
The first inequality is the Armijo sufficient-decrease condition. The second Wolfe inequality is the curvature condition. Every strong Wolfe step is a Wolfe step, because and the strong curvature bound implies .
For a descent direction define its descent angle by
The denominator is nonzero for a descent direction. The Cauchy–Schwarz inequality Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation ensures .
Depends on
- Continuously differentiable maps, local inverses, and local diffeomorphisms
- The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- The chain rule for total derivatives: $D(g\circ f)(a)=Dg(f(a))\circ Df(a)$
- A total derivative computes every directional derivative, and its matrix is the Jacobian
- Cauchy-Schwarz $\lvert\langle x,y\rangle\rvert \le \lVert x\rVert_2\lVert y\rVert_2$ with its equality case, the triangle inequality for $\lVert\cdot\rVert_2$, the parallelogram law and polarisation
Used by
- Finite-budget bracketing and zoom for a strong Wolfe step Algorithm
- Finite-budget inexact Newton–Krylov with a descent safeguard Algorithm
- Fletcher–Reeves and safeguarded Polak–Ribière nonlinear conjugate gradients Algorithm
- A strong Wolfe step can leave PR+ ascending; the safeguard restarts Counterexample
- An indefinite Rosenbrock Hessian makes the raw Newton direction ascend Example
- Newton, Cauchy, and truncated-CG steps on one indefinite model Example
- One accepted Rosenbrock step gives different FR and PR+ coefficients Example
- The standard Rosenbrock start accepts a full Newton step Example
- A strong Wolfe step exists on a bounded-below descent ray Lemma
- A Wolfe step gives positive Bfgs curvature on a descent direction Lemma
- A Wolfe step has a lower bound from its descent angle Lemma
- Bracketing and zoom terminate with a checked step or a failure Lemma
- Fletcher–Reeves descent and direction-growth bound Lemma
- Locally Lipschitz Hessians give the BFGS Dennis–Moré condition Lemma
- The safeguarded PR+ direction has a uniform angle bound Lemma
- Fixed-memory L-Bfgs converges linearly under uniform curvature and scale bounds Theorem
- Fletcher–Reeves has vanishing gradient liminf under strong Wolfe Theorem
- FR and unrestarted PR+ match linear CG on SPD quadratics Theorem
- Full-memory Bfgs converges globally and linearly on a uniformly strongly convex level set Theorem
- Full-memory Bfgs is locally superlinear when the Hessian is Lipschitz Theorem
- Safeguarded PR+ converges in gradient norm under strong Wolfe Theorem
- Wolfe steps imply the Zoutendijk summability condition Theorem
Dependency tree · two levels
30 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Jorge Nocedal and Stephen J. Wright, Numerical Optimization, 2nd ed. (standard reference, not scraped)