Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2 — every limit point is critical

Proved
ProjNewton.Superlinear.proposition2

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

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

Let f:Rn→Rf:\mathbb R^n\to\mathbb Rf:Rn→R be continuously differentiable and suppose its gradient is Lipschitz on each bounded set (Assumption (A)). Let (xk)(x_k)(xk​) be a run of (35) with the prescribed positive definite partly diagonal matrices, and suppose the scaled quadratic-form bounds (41) hold with fixed positive constants and nonnegative integer exponents (Assumption (B)). Then

xkj→xˉ⟹xˉ is a critical point of problem (1).x_{k_j}\to\bar x\quad\Longrightarrow\quad\bar x\text{ is a critical point of problem (1)}.xkj​​→xˉ⟹xˉ is a critical point of problem (1).

Every limit point is therefore stationary for the nonnegative orthant constraint; the proposition does not assert that a limit point exists.

Formalization Note MapClusterPt expresses a subsequential limit. Admissibility records the matrix-selection rule from p. 228, and the run records x0≥0x_0\ge0x0​≥0, the first accepted exponent and the update. The standing C1C^1C1 assumption and n≥1n\ge1n≥1 are explicit.

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

open Matrix Filter Topology

/-- Bertsekas (1982), Proposition 2, p. 230. -/
theorem proposition2 {n : ℕ} (hn : 0 < n) (f : Vec n → ℝ)
    (hf : ContDiff ℝ 1 f) (hA : AssumptionA f)
    (μ : Fin n → ℝ) (ε β σ : ℝ) (hpar : Params μ ε β σ)
    (D : ℕ → Matrix (Fin n) (Fin n) ℝ) (x : ℕ → Vec n)
    (hrun : IsRun f μ ε β σ D x)
    (hadm : AdmissibleScaling f μ ε D x)
    (lam1 lam2 : ℝ) (q₁ q₂ : ℕ)
    (hB : AssumptionB f μ D x lam1 lam2 q₁ q₂) :
    ∀ xbar : Vec n, MapClusterPt xbar atTop x → IsCritical f xbar := by sorry

end ProjNewton.Superlinear
Source
Bertsekas, Projected Newton Methods for Optimization Problems with Simple Constraints, SIAM J. Control Optim. 20(2) (1982), p. 230, Proposition 2; Assumptions (A), (B), (40), (41)
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