Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(20), proof of Theorem 9, p. 24 — equivalent second-order form of (IPAHD-SC)

Proved
HessianDamping.IPAHDSC.run_satisfies_eq20

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

convex-optimizationhessian-dampinginertial-algorithmp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1proximal-algorithmstrong-convexity

Let f:H→Rf:H\to\mathbb Rf:H→R be convex and of class C1C^1C1 on a real Hilbert space HHH, let μ>0\mu>0μ>0, s>0s>0s>0, β≥0\beta\ge0β≥0, and let (xk)(x_k)(xk​) be a run of the inertial proximal algorithm (IPAHD-SC). Then for every k≥1k\ge1k≥1,

1s(xk+1−2xk+xk−1)+2μ (xk+1−xk)+β(∇f(xk+1)−∇f(xk))+s ∇f(xk+1)=0.\frac{1}{\sqrt s}(x_{k+1}-2x_k+x_{k-1})+2\sqrt\mu\,(x_{k+1}-x_k)+\beta\big(\nabla f(x_{k+1})-\nabla f(x_k)\big)+\sqrt s\,\nabla f(x_{k+1})=0.s​1​(xk+1​−2xk​+xk−1​)+2μ​(xk+1​−xk​)+β(∇f(xk+1​)−∇f(xk​))+s​∇f(xk+1​)=0.

This is the "equivalent formulation" (20) that the proof of Theorem 9 works with: it exhibits the algorithm as an implicit discretization of the inertial dynamic x¨+2μx˙+β∇2f(x)x˙+∇f(x)=0\ddot x+2\sqrt\mu\dot x+\beta\nabla^2f(x)\dot x+\nabla f(x)=0x¨+2μ​x˙+β∇2f(x)x˙+∇f(x)=0.

Formalization Note The run is given through the minimizing property of the proximal step, so the identity is the first-order optimality condition of that step. Positivity of sss is implicit on the page (s=h2s=h^2s=h2, hhh the positive step size).

Preamble
import Mathlib
import Definitions.Def_HessianDamping_IPAHDSC_Setting
Formal statement
namespace HessianDamping.IPAHDSC

/-- (20), proof of Theorem 9, p. 24: every run of (IPAHD-SC) satisfies, for `k ≥ 1`,
`(1/√s)(x_{k+1} - 2x_k + x_{k-1}) + 2√μ(x_{k+1} - x_k) + β(∇f(x_{k+1}) - ∇f(x_k)) + √s∇f(x_{k+1}) = 0`. -/
theorem run_satisfies_eq20 {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H] [CompleteSpace H]
    (f : H → ℝ) (hfconv : ConvexOn ℝ Set.univ f) (hfC1 : ContDiff ℝ 1 f)
    (μ : ℝ) (hμ : 0 < μ) (β s : ℝ) (hs : 0 < s) (hβ0 : 0 ≤ β)
    (x : ℕ → H) (hrun : IsIPAHDSCRun f μ β s x) (k : ℕ) (hk : 1 ≤ k) :
    (1 / Real.sqrt s) • (x (k + 1) - (2 : ℝ) • x k + x (k - 1)) +
        (2 * Real.sqrt μ) • (x (k + 1) - x k) +
        β • (gradient f (x (k + 1)) - gradient f (x k)) +
        Real.sqrt s • gradient f (x (k + 1)) = 0 := by sorry

end HessianDamping.IPAHDSC
Source
Attouch, Chbani, Fadili, Riahi, First-order optimization algorithms via inertial systems with Hessian driven damping, arXiv:1907.10536v2, p. 24, proof of Theorem 9, (20)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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