Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

After (37) — positivity of the Armijo right-hand side

Proved
ProjNewton.Superlinear.armijo_rhs_positive

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

bound-constraintsnonlinear-optimizationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1projected-newton

Fix the paper's algorithm parameters and a feasible point xxx. Let DDD be symmetric positive definite and diagonal with respect to the enlarged set Ik+I_k^+Ik+​ defined by (32). For every trial exponent m≥0m\ge0m≥0, the right-hand side of (37) is nonnegative, and

RHS⁡37(m)>0⟺x is not critical.\operatorname{RHS}_{37}(m)>0\quad\Longleftrightarrow\quad x\text{ is not critical}.RHS37​(m)>0⟺x is not critical.

This distinguishes a genuine descent step from a critical fixed point at every trial step.

Formalization Note The factor σ>0\sigma>0σ>0 is retained in the stated right-hand side. The C1C^1C1 standing assumption, n≥1n\ge1n≥1, feasibility and all parameter ranges are explicit. The displayed I+(x)I^+(x)I+(x) here denotes the iteration's enlarged set Ik+I_k^+Ik+​, not the smaller set (17).

Preamble
import Mathlib
import Definitions.Def_ProjNewton_Superlinear_Algorithm
Formal statement
namespace ProjNewton.Superlinear

open Matrix Filter Topology

/-- Bertsekas (1982), after (37), p. 229. -/
theorem armijo_rhs_positive {n : ℕ} (hn : 0 < n) (f : Vec n → ℝ)
    (hf : ContDiff ℝ 1 f) (μ : Fin n → ℝ) (ε β σ : ℝ)
    (hpar : Params μ ε β σ) (x : Vec n) (hx : x ∈ orthant n)
    (D : Matrix (Fin n) (Fin n) ℝ) (hD : D.PosDef)
    (hdiag : DiagonalWrt D (Ik f μ ε x)) :
    ∀ m : ℕ, 0 ≤ σ * armijoRHS f μ ε D x (β ^ m) ∧
      (0 < σ * armijoRHS f μ ε D x (β ^ m) ↔ ¬ IsCritical f x) := by sorry

end ProjNewton.Superlinear
Source
Bertsekas, Projected Newton Methods for Optimization Problems with Simple Constraints, SIAM J. Control Optim. 20(2) (1982), p. 229, §2 after (37)
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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me