Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1 — critical points and descent along the projected arc

Proved
ProjNewton.Superlinear.proposition1

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

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

Let n≥1n\ge1n≥1, let f:Rn→Rf:\mathbb R^n\to\mathbb Rf:Rn→R be continuously differentiable, let x≥0x\ge0x≥0, and let DDD be symmetric positive definite and diagonal with respect to I+(x)I^+(x)I+(x). Define x(a)=[x−aD∇f(x)]+x(a)=[x-aD\nabla f(x)]^+x(a)=[x−aD∇f(x)]+ for a≥0a\ge0a≥0. Then:

x is critical⟺x(a)=x for every a≥0.x\text{ is critical}\quad\Longleftrightarrow\quad x(a)=x\text{ for every }a\ge0.x is critical⟺x(a)=x for every a≥0.

If xxx is not critical, some aˉ>0\bar a>0aˉ>0 satisfies f(x(a))<f(x)f(x(a))<f(x)f(x(a))<f(x) for every 0<a≤aˉ0<a\le\bar a0<a≤aˉ. This links the orthant first-order condition to the projected arc and supplies local descent.

Formalization Note Feasibility, the paper's standing C1C^1C1 assumption and n≥1n\ge1n≥1 are explicit. The matrix condition zeroes rows indexed by I+(x)I^+(x)I+(x); symmetry supplies the matching columns.

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

open Matrix Filter Topology

/-- Bertsekas (1982), Proposition 1, p. 226. -/
theorem proposition1 {n : ℕ} (hn : 0 < n) (f : Vec n → ℝ)
    (hf : ContDiff ℝ 1 f) (x : Vec n) (hx : x ∈ orthant n)
    (D : Matrix (Fin n) (Fin n) ℝ) (hD : D.PosDef)
    (hdiag : DiagonalWrt D (Iplus f x)) :
    (IsCritical f x ↔ ∀ a : ℝ, 0 ≤ a → arc f D x a = x) ∧
    (¬ IsCritical f x → ∃ abar : ℝ, 0 < abar ∧
      ∀ a ∈ Set.Ioc (0 : ℝ) abar, f (arc f D x a) < 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. 226, Proposition 1
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