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.
Bfgs curvature pairs and Hessian/inverse updates
Definition
Fix an integer . For successive points and vectors , define the step vector and the gradient-difference vector . Their curvature is , using the Euclidean inner product of The Euclidean inner product on .
A real matrix is symmetric positive definite (SPD) when and for every nonzero . For an SPD matrix , write for its inverse; denotes the identity matrix of Rectangular matrix multiplication and the identity matrix , including zero-sized shapes. If and , set . The BFGS Hessian update and its inverse form are The denominators are positive under the stated hypotheses.
For Powell damping, first set . If , set . If , set The damped BFGS update is the same formula with replaced by and .
The secant equations are and for an undamped pair; for a damped pair they use . An inverse pair is consistent when .
Remarks
The two update formulas are algebraically equivalent when and are consistent. A positive curvature pair is required for both updates. Powell damping changes the gradient-difference vector used in the secant equation; a convergence theorem for the undamped update does not automatically cover the damped branch.
Depends on
Used by
- Full-memory Bfgs with Wolfe search, descent reset, and Powell damping Algorithm
- Reduced-BFGS SQP KKT step with projected Hessian error Algorithm
- An exact Bfgs secant update on a two-variable quadratic Example
- Full-memory and limited-memory storage costs Example
- Powell damping repairs a negative-curvature trial pair Example
- A Wolfe step gives positive Bfgs curvature on a descent direction Lemma
- Bfgs trace and determinant identities give a matrix potential inequality Lemma
- Bfgs updates preserve the secant equations, symmetry, and positive definiteness Lemma
- Locally Lipschitz Hessians give the BFGS Dennis–Moré condition Lemma
- Powell damping gives a strictly positive curvature pair Lemma
- The L-Bfgs two-loop recursion equals the stored inverse updates and costs linear memory work Lemma
Dependency tree · two levels
17 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)