Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(2.48)–(2.49) — three-point inequalities for the prox steps of Algorithm 2

Proved
NonconvexAG.Composite.eq_2_48_2_49

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

accelerated-gradientcomposite-optimizationnonconvex-optimizationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1proximal-methods

Let X\mathcal XX be convex on its domain KKK and let P\mathcal PP be a prox map for X\mathcal XX as in (2.37). Run Algorithm 2 with any gradient map ∇Ψ\nabla\Psi∇Ψ, step sizes with α1=1\alpha_1=1α1​=1, αk∈(0,1)\alpha_k\in(0,1)αk​∈(0,1) (k≥2k\ge2k≥2), βk,λk>0\beta_k,\lambda_k>0βk​,λk​>0, and any x0x_0x0​. Then for every k≥1k\ge1k≥1 and every x∈Kx\in Kx∈K:

⟨∇Ψ(xkmd),xk−x⟩+X(xk)≤X(x)+12λk[∥xk−1−x∥2−∥xk−x∥2−∥xk−xk−1∥2],\langle\nabla\Psi(x^{md}_k),x_k-x\rangle+\mathcal X(x_k)\le\mathcal X(x)+\frac1{2\lambda_k}\Big[\|x_{k-1}-x\|^2-\|x_k-x\|^2-\|x_k-x_{k-1}\|^2\Big],⟨∇Ψ(xkmd​),xk​−x⟩+X(xk​)≤X(x)+2λk​1​[∥xk−1​−x∥2−∥xk​−x∥2−∥xk​−xk−1​∥2], ⟨∇Ψ(xkmd),xkag−x⟩+X(xkag)≤X(x)+12βk[∥xkmd−x∥2−∥xkag−x∥2−∥xkag−xkmd∥2].\langle\nabla\Psi(x^{md}_k),x^{ag}_k-x\rangle+\mathcal X(x^{ag}_k)\le\mathcal X(x)+\frac1{2\beta_k}\Big[\|x^{md}_k-x\|^2-\|x^{ag}_k-x\|^2-\|x^{ag}_k-x^{md}_k\|^2\Big].⟨∇Ψ(xkmd​),xkag​−x⟩+X(xkag​)≤X(x)+2βk​1​[∥xkmd​−x∥2−∥xkag​−x∥2−∥xkag​−xkmd​∥2].

These are the optimality conditions of the subproblems (2.40) and (2.41), in the three-point form of Lemma 2 of Lan's reference [11].

Formalization Note The paper says "for any x∈Rnx\in\mathbb R^nx∈Rn"; for x∉Kx\notin Kx∈/K the right-hand side is +∞+\infty+∞ and the inequality is void, so the statement quantifies over x∈Kx\in Kx∈K.

Preamble
import Mathlib
import Definitions.Def_ConvexOptAlg_SmoothGD_Defs
import Definitions.Def_NonconvexAG_Composite_ProxMap
import Definitions.Def_NonconvexAG_Composite_AGRun
Formal statement
namespace NonconvexAG.Composite

open ConvexOptAlg.SmoothGD

/-- (2.48) and (2.49), p. 12: the three-point inequalities for the prox subproblems (2.40) and
(2.41) of Algorithm 2, for every `k ≥ 1` and every `x` in the domain `K` of `𝒳`. -/
theorem eq_2_48_2_49 {n : ℕ} (gΨ : NonconvexAG.Smooth.E n → NonconvexAG.Smooth.E n) (K : Set (NonconvexAG.Smooth.E n)) (X : NonconvexAG.Smooth.E n → ℝ)
    (hX : ConvexOn ℝ K X) (P : NonconvexAG.Smooth.E n → NonconvexAG.Smooth.E n → ℝ → NonconvexAG.Smooth.E n) (hP : IsProxMap K X P)
    (α β lam : ℕ → ℝ) (hstep : NonconvexAG.Smooth.AGStepsizes α β lam) (x0 : NonconvexAG.Smooth.E n) :
    let xk : ℕ → NonconvexAG.Smooth.E n := xSeq gΨ P α β lam x0
    let xag : ℕ → NonconvexAG.Smooth.E n := xagSeq gΨ P α β lam x0
    let xmd : ℕ → NonconvexAG.Smooth.E n := xmdSeq gΨ P α β lam x0
    ∀ k, 1 ≤ k → ∀ x ∈ K,
      inner ℝ (gΨ (xmd k)) (xk k - x) + X (xk k) ≤
          X x + 1 / (2 * lam k) * (‖xk (k - 1) - x‖ ^ 2 - ‖xk k - x‖ ^ 2 - ‖xk k - xk (k - 1)‖ ^ 2) ∧
        inner ℝ (gΨ (xmd k)) (xag k - x) + X (xag k) ≤
          X x + 1 / (2 * β k) * (‖xmd k - x‖ ^ 2 - ‖xag k - x‖ ^ 2 - ‖xag k - xmd k‖ ^ 2) := by sorry
end NonconvexAG.Composite
Source
Ghadimi & Lan, Accelerated Gradient Methods for Nonconvex Nonlinear and Stochastic Programming, arXiv:1310.3787v1, p. 12, (2.48) and (2.49)
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

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