Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

After (37) — finite line search, descent and critical-point termination

Proved
ProjNewton.Superlinear.well_defined

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

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

For the algorithm of (32)–(37) with f∈C1f\in C^1f∈C1, each feasible noncritical point has a sufficiently small trial step accepted by the Armijo inequality: some m0m_0m0​ makes every m≥m0m\ge m_0m≥m0​ acceptable. At a critical point, m=0m=0m=0 is accepted and the projected unit step fixes the point. Consequently every run with admissible matrices stays feasible, strictly decreases fff at a noncritical iterate, and remains fixed at a critical iterate.

xk noncritical ⟹ f(xk+1)<f(xk),xk critical ⟹ xk+1=xk.x_k\text{ noncritical}\ \Longrightarrow\ f(x_{k+1})<f(x_k),\qquad x_k\text{ critical}\ \Longrightarrow\ x_{k+1}=x_k.xk​ noncritical ⟹ f(xk+1​)<f(xk​),xk​ critical ⟹ xk+1​=xk​.

This records the well-definedness and descent conclusion stated after (37).

Formalization Note The run predicate chooses the first acceptable nonnegative exponent, as on p. 229. The fixed-point sentence on p. 230 says “for all α≥0\alpha\ge0α≥0,” matching Proposition 1(a).

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

open Matrix Filter Topology

/-- Bertsekas (1982), discussion following (37), pp. 229–230. -/
theorem well_defined {n : ℕ} (hn : 0 < n) (f : Vec n → ℝ)
    (hf : ContDiff ℝ 1 f) (μ : Fin n → ℝ) (ε β σ : ℝ)
    (hpar : Params μ ε β σ) :
    (∀ (x : Vec n), x ∈ orthant n →
      ∀ (D : Matrix (Fin n) (Fin n) ℝ), D.PosDef →
      DiagonalWrt D (Ik f μ ε x) →
      (¬ IsCritical f x → ∃ m₀ : ℕ, ∀ m ≥ m₀, Armijo f μ ε β σ D x m) ∧
      (IsCritical f x → Armijo f μ ε β σ D x 0 ∧ arc f D x 1 = x)) ∧
    (∀ (D : ℕ → Matrix (Fin n) (Fin n) ℝ) (x : ℕ → Vec n),
      IsRun f μ ε β σ D x → AdmissibleScaling f μ ε D x →
      ∀ k, x k ∈ orthant n ∧
        (¬ IsCritical f (x k) → f (x (k + 1)) < f (x k)) ∧
        (IsCritical f (x k) → x (k + 1) = x k)) := by sorry

end ProjNewton.Superlinear
Source
Bertsekas, Projected Newton Methods for Optimization Problems with Simple Constraints, SIAM J. Control Optim. 20(2) (1982), pp. 229–230, §2 discussion 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