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.
Powell damping repairs a negative-curvature trial pair
Example
Consider the nonconvex function at . The gradient is . The trial direction and trial step give and . Use to compare the raw and Powell-damped updates.
Facts & Assumptions
Given: The function, point, trial direction and step, and initial matrices in the Example.
Bfgs curvature pairs and Hessian/inverse updates: an undamped BFGS update requires ; Powell damping uses and, if , forms with .
Powell damping gives a strictly positive curvature pair: this damping rule gives in the damped branch.
Bfgs updates preserve the secant equations, symmetry, and positive definiteness: for SPD and positive damped curvature, the BFGS Hessian update remains SPD and satisfies .
Full-memory Bfgs with Wolfe search, descent reset, and Powell damping: the normal search branch requires a strong Wolfe step and reports line-search failure if its finite search does not return one.
Verification
Given: The function, point, trial direction and step, and initial matrices in the Example.
[F1] Bfgs curvature pairs and Hessian/inverse updates: an undamped BFGS update requires ; Powell damping uses and, if , forms with .
[F2] Powell damping gives a strictly positive curvature pair: this damping rule gives in the damped branch.
[F3] Bfgs updates preserve the secant equations, symmetry, and positive definiteness: for SPD and positive damped curvature, the BFGS Hessian update remains SPD and satisfies .
[F4] Full-memory Bfgs with Wolfe search, descent reset, and Powell damping: the normal search branch requires a strong Wolfe step and reports line-search failure if its finite search does not return one.
Here , and . The Armijo inequality holds for , but the directional derivatives are and . For , the Wolfe curvature test would require , which is false; the strong curvature test fails as well. Thus this is a nonconvex trial pair, not a step accepted by the strong-Wolfe search of [F4].
The raw pair has , so its BFGS curvature denominator is negative. Direct substitution into the formal Hessian-update expression gives , whose quadratic form at is ; it is not SPD.
Here and , so and . Therefore , as also follows from [F2].
The damped update is It is SPD and , in agreement with [F3]. The example shows the algebraic role of damping; because the trial fails Wolfe, the normal line-search algorithm rejects it rather than treating it as a successful BFGS iteration.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
8 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)
- Manuel Carreira-Perpiñán, Lecture Notes on Numerical Optimization (standard reference, not scraped)