Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, pp. 4–5 — the semismooth Newton update based on (2.4) is the primal-dual active set step

Proved
PDASNewton.Local.newton_step_iff_step

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

active-setcomplementarityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1semismooth-newton

Let A∈Rn×nA \in \mathbb{R}^{n \times n}A∈Rn×n, f,ψ∈Rnf, \psi \in \mathbb{R}^nf,ψ∈Rn and c>0c > 0c>0. For iterates x=(y,λ)x = (y, \lambda)x=(y,λ) and x′=(y′,λ′)x' = (y', \lambda')x′=(y′,λ′),

GF(x) (x′−x)=−F(x)G_F(x)\,(x' - x) = -F(x)GF​(x)(x′−x)=−F(x)

holds if and only if (y′,λ′)(y', \lambda')(y′,λ′) follows (y,λ)(y, \lambda)(y,λ) by one step of the primal-dual active set algorithm: Ay′+λ′=fAy' + \lambda' = fAy′+λ′=f, yi′=ψiy'_i = \psi_iyi′​=ψi​ on A={i:λi+c(y−ψ)i>0}\mathcal{A} = \{i : \lambda_i + c(y - \psi)_i > 0\}A={i:λi​+c(y−ψ)i​>0} and λi′=0\lambda'_i = 0λi′​=0 on I={i:λi+c(y−ψ)i≤0}\mathcal{I} = \{i : \lambda_i + c(y - \psi)_i \le 0\}I={i:λi​+c(y−ψ)i​≤0}.

This is the identification that makes "the primal-dual active set method or, equivalently, the semismooth Newton method" of Theorem 3.1 one statement.

Formalization Note GFG_FGF​ uses GmG_mGm​ with δ=0\delta = 0δ=0, as the paper does. No matrix hypothesis is needed.

Preamble
import Mathlib
import Definitions.Def_PDASNewton_Local_Setting
Formal statement
namespace PDASNewton.Local

/-- §2, pp. 4–5: the semismooth Newton update based on (2.4),
`G_F(x^k)(x^{k+1} - x^k) = -F(x^k)`, is equivalent to one step (ii)–(iii) of the primal-dual
active set strategy. -/
theorem newton_step_iff_step {n : ℕ} (A : Matrix (Fin n) (Fin n) ℝ) (f ψ : Fin n → ℝ)
    (c : ℝ) (hc : 0 < c) (y lam y' lam' : Fin n → ℝ) :
    GF A ψ c (y, lam) ((y', lam') - (y, lam)) = -Fmap A f ψ c (y, lam) ↔
      IsStep A f ψ c y lam y' lam' := by sorry

end PDASNewton.Local
Source
Hintermüller, Ito, Kunisch, The primal-dual active set strategy as a semismooth Newton method, HAL hal-01660511v1, pp. 4–5, (2.4)–(2.6) and 'the semismooth Newton update based on (2.4) is equivalent to the primal-dual active set strategy'
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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