Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.2, pp. 347–348 — ψ*_{k+1} ≥ ψ*_k + a_{k+1} f(x^{k+1})

Proved
RelSmoothFOM.DualAvg.psi_star_step

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

dual-averagingfirst-order-methodsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1relative-smoothness

Let QQQ be a convex subset of a finite-dimensional real inner-product space EEE, let f,hf, hf,h be convex on QQQ and differentiable at every point of QQQ, and let 0≤μ<L0 \le \mu < L0≤μ<L. Suppose fff is LLL-smooth relative to hhh on QQQ, and let (xk)(x^k)(xk) be a run of the dual averaging scheme (Algorithm 2) with models ψk\psi_kψk​ and ψk∗=ψk(xk)\psi^*_k = \psi_k(x^k)ψk∗​=ψk​(xk). Then for every k≥0k \ge 0k≥0,

ψk+1∗≥ψk∗+ak+1f(xk+1).\psi^*_{k+1} \ge \psi^*_k + a_{k+1} f(x^{k+1}) .ψk+1∗​≥ψk∗​+ak+1​f(xk+1).

Summed over kkk, this recursion gives the lower half of (36), ∑i=0k−1ai+1f(xi+1)≤ψk∗\sum_{i=0}^{k-1} a_{i+1} f(x^{i+1}) \le \psi^*_k∑i=0k−1​ai+1​f(xi+1)≤ψk∗​.

Formalization Note Relative strong convexity is not needed and is not assumed.

Preamble
import Mathlib
import Definitions.Def_RelSmoothFOM_DualAvg_Setting
Formal statement
namespace RelSmoothFOM.DualAvg

/-- Proof of Theorem 3.2, pp. 347–348: along a run of Algorithm 2, for every `k`,
`ψ*_{k+1} ≥ ψ*_k + a_{k+1} f(x^{k+1})`, where `ψ*_k = ψ_k(x^k)`. -/
theorem psi_star_step
    {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E] [FiniteDimensional ℝ E]
    (Q : Set E) (hQ : Convex ℝ Q)
    (f h : E → ℝ) (hfd : ∀ x ∈ Q, DifferentiableAt ℝ f x) (hfc : ConvexOn ℝ Q f)
    (hhd : ∀ x ∈ Q, DifferentiableAt ℝ h x) (hhc : ConvexOn ℝ Q h)
    (L μ : ℝ) (hμ : 0 ≤ μ) (hμL : μ < L)
    (hsm : IsRelSmooth Q f h L)
    (x : ℕ → E) (hrun : IsDualAveragingRun Q f h L μ x) :
    ∀ k : ℕ, daModel f h L μ x (k + 1) (x (k + 1)) ≥
      daModel f h L μ x k (x k) + daWeight L μ k * f (x (k + 1)) := by sorry

end RelSmoothFOM.DualAvg
Source
Lu, Freund & Nesterov, Relatively smooth convex optimization by first-order methods, and applications, SIAM J. Optim. 28 (2018), pp. 347–348, proof of Theorem 3.2, display preceding (36)
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