Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Eq. (40): the two-update direction under an exact search

Proved
ShannoCG.SCONB.bfgsUpdate_mulVec_of_exact

by mikedeng1 · Sep 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

bfgsconjugate-gradientp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1quasi-newton

Let H^k\hat H_kH^k​ be any real n×nn\times nn×n matrix, pk,yk,gk+1∈Rnp_k, y_k, g_{k+1} \in \mathbb R^npk​,yk​,gk+1​∈Rn, and H^k+1\hat H_{k+1}H^k+1​ the BFGS update of H^k\hat H_kH^k​ with (pk,yk)(p_k, y_k)(pk​,yk​). If the line search at step kkk is exact, i.e. pk′gk+1=0p_k' g_{k+1} = 0pk′​gk+1​=0, then

dk+1=−H^k+1gk+1=−H^kgk+1+yk′H^kgk+1pk′yk pk.d_{k+1} = -\hat H_{k+1} g_{k+1} = -\hat H_k g_{k+1} + \frac{y_k' \hat H_k g_{k+1}}{p_k' y_k}\, p_k.dk+1​=−H^k+1​gk+1​=−H^k​gk+1​+pk′​yk​yk′​H^k​gk+1​​pk​.

This is the first step of Shanno's reduction of the double-update methods to Beale's method: under exact searches only one correction term of the update survives.

Formalization Note Stated generically: H^k\hat H_kH^k​ is arbitrary, ggg plays the role of gk+1g_{k+1}gk+1​ and the exact search is the hypothesis pk′gk+1=0p_k'g_{k+1} = 0pk′​gk+1​=0.

Preamble
import Mathlib
import Definitions.Def_ShannoCG_SCONB_bfgsUpdate

open Matrix
Formal statement
namespace ShannoCG.SCONB

/-- Shanno, *Conjugate Gradient Methods with Inexact Searches*, Math. Oper. Res. 3(3) (1978), §IV, p. 251 (PDF 8), eq. (40): under the exact-search condition `p_k' g_{k+1} = 0`, the
direction `d_{k+1} = −Ĥ_{k+1} g_{k+1}` (with `Ĥ_{k+1}` the update (32) of `Ĥ_k`) equals
`−Ĥ_k g_{k+1} + (y_k' Ĥ_k g_{k+1} / p_k' y_k) p_k`.

**Formalization Note.** Stated generically for any matrix `H` and vectors `p, y, g` (`g` plays
`g_{k+1}`); the exact search is the hypothesis `p ⬝ᵥ g = 0`. -/
theorem bfgsUpdate_mulVec_of_exact {n : ℕ} (H : Matrix (Fin n) (Fin n) ℝ) (p y g : Fin n → ℝ)
    (hexact : p ⬝ᵥ g = 0) :
    -(bfgsUpdate H p y *ᵥ g) = -(H *ᵥ g) + ((y ⬝ᵥ (H *ᵥ g)) / (p ⬝ᵥ y)) • p := by sorry

end ShannoCG.SCONB
Source
Shanno, Conjugate Gradient Methods with Inexact Searches, Math. Oper. Res. 3(3) (1978) 244–256, DOI 10.1287/moor.3.3.244, p. 251 (PDF p. 8), §IV, eq. (40)
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me