Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Eq. (42): the self-scaled restart matrix on a gradient orthogonal to ptp_tpt​

Proved
ShannoCG.SCONB.scaledRestart_mulVec_of_orth

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

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

Let pt,yt,gk+1∈Rnp_t, y_t, g_{k+1} \in \mathbb R^npt​,yt​,gk+1​∈Rn with pt′yt≠0p_t' y_t \ne 0pt′​yt​=0 and pt′gk+1=0p_t' g_{k+1} = 0pt′​gk+1​=0, and let H^k\hat H_kH^k​ be the self-scaled restart matrix (37). Then

H^kgk+1=pt′ytyt′yt gk+1−yt′gk+1yt′yt pt.\hat H_k g_{k+1} = \frac{p_t' y_t}{y_t' y_t}\, g_{k+1} - \frac{y_t' g_{k+1}}{y_t' y_t}\, p_t.H^k​gk+1​=yt′​yt​pt′​yt​​gk+1​−yt′​yt​yt′​gk+1​​pt​.

Under exact searches on a quadratic the hypothesis pt′gk+1=0p_t'g_{k+1} = 0pt′​gk+1​=0 holds, and this simplified form is substituted into (40) to obtain the direction (43).

Formalization Note Stated generically, with ggg in place of gk+1g_{k+1}gk+1​.

Preamble
import Mathlib
import Definitions.Def_ShannoCG_SCONB_gammaScale
import Definitions.Def_ShannoCG_SCONB_scaledRestart

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. (42): if `p_t' g_{k+1} = 0`, the self-scaled restart matrix (37)
satisfies `Ĥ_k g_{k+1} = (p_t'y_t / y_t'y_t) g_{k+1} − (y_t'g_{k+1} / y_t'y_t) p_t`.

**Formalization Note.** Stated generically (`g` plays `g_{k+1}`); `p_t ⬝ᵥ y_t ≠ 0` keeps the
quotients in (37) genuine. -/
theorem scaledRestart_mulVec_of_orth {n : ℕ} (pt yt g : Fin n → ℝ) (hpy : pt ⬝ᵥ yt ≠ 0)
    (horth : pt ⬝ᵥ g = 0) :
    scaledRestart pt yt *ᵥ g = gammaScale pt yt • g - ((yt ⬝ᵥ g) / (yt ⬝ᵥ yt)) • pt := 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. (42)
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