Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

§5, p. 408 — Algorithm MR is a special case of Algorithm GIN

Proved
GlobalInexactNewton.Backtracking.mr_isGINRun

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

global-convergenceinexact-newtonp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let EEE be a real normed space and F:E→EF:E\to EF:E→E. Every run of Algorithm MR with parameters ηmax⁡\eta_{\max}ηmax​, ttt, θmin⁡\theta_{\min}θmin​, θmax⁡\theta_{\max}θmax​ is a run of Algorithm GIN with the same ttt, the same iterates xkx_kxk​, and the levels ηk\eta_kηk​ equal to the final values of the while-loop. That is, ηk∈[0,1)\eta_k\in[0,1)ηk​∈[0,1), and sk=xk+1−xk=σk(ηk)s_k=x_{k+1}-x_k=\sigma_k(\eta_k)sk​=xk+1​−xk​=σk​(ηk​) satisfies the inexact Newton condition (2.1) and the sufficient decrease condition (2.2) at level ηk\eta_kηk​.

This is how the global convergence results for GIN (Theorems 3.4 and 3.5) transfer to Algorithm MR.

Formalization Note The final level of iteration kkk is η(mk)\eta^{(m_k)}η(mk​), the level visited after the loop body has run mkm_kmk​ times. The statement needs no differentiability or finite dimension, so neither is assumed.

Preamble
import Mathlib
import Definitions.Def_GlobalInexactNewton_Backtracking_Method
open Filter Topology
Formal statement
namespace GlobalInexactNewton.Backtracking

/-- Eisenstat–Walker (1994), §5, before Theorem 5.2, p. 408: Algorithm MR is a special case of
Algorithm GIN. Every run of Algorithm MR is a run of Algorithm GIN with the same `t` and with the
final loop levels `η_k = trialLevel (ηbar k) (θ k) (m k)`. -/
theorem mr_isGINRun {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
    (F : E → E) (ηmax t θmin θmax : ℝ) (x : ℕ → E) (ηbar : ℕ → ℝ) (σ : ℕ → ℝ → E)
    (θ : ℕ → ℕ → ℝ) (m : ℕ → ℕ) (hrun : IsMRRun F ηmax t θmin θmax x ηbar σ θ m) :
    IsGINRun F t x (fun k => trialLevel (ηbar k) (θ k) (m k)) := by sorry

end GlobalInexactNewton.Backtracking
Source
Eisenstat and Walker, Globally Convergent Inexact Newton Methods, SIAM J. Optim. 4(2) (1994), §5, before Theorem 5.2, p. 408
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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