Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(34), p. 347 — along the dual averaging scheme, ψ*_k ≤ h(x) + A_k f(x) for every x ∈ Q

Proved
RelSmoothFOM.DualAvg.eq_34

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

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

Let QQQ be a convex subset of a finite-dimensional real inner-product space EEE, and let f,hf, hf,h be convex on QQQ and differentiable at every point of QQQ. Let 0≤μ<L0 \le \mu < L0≤μ<L and suppose fff is μ\muμ-strongly convex relative to hhh on QQQ. 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 and every x∈Qx \in Qx∈Q,

ψk∗≤h(x)+Akf(x),Ak=∑i=0k−1ai+1.\psi^*_k \le h(x) + A_k f(x), \qquad A_k = \sum_{i=0}^{k-1} a_{i+1}.ψk∗​≤h(x)+Ak​f(x),Ak​=i=0∑k−1​ai+1​.

This is the upper half of (36): the model's optimal value never exceeds hhh plus AkA_kAk​ times the objective at any feasible point.

Formalization Note For k≥1k \ge 1k≥1, ψk∗=ψk(xk)\psi^*_k = \psi_k(x^k)ψk∗​=ψk​(xk) because xkx^kxk minimises ψk\psi_kψk​ over QQQ; for k=0k = 0k=0, ψ0=h\psi_0 = hψ0​=h and x0x^0x0 is the hhh-center. The relative smoothness condition is not needed and is not assumed.

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

/-- (34), proof of Theorem 3.2, p. 347: along a run of Algorithm 2, for every `k` and every
`u ∈ Q`, `ψ*_k = ψ_k(x^k) ≤ h(u) + A_k f(u)`. -/
theorem eq_34
    {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)
    (hsc : IsRelStronglyConvex Q f h μ)
    (x : ℕ → E) (hrun : IsDualAveragingRun Q f h L μ x) :
    ∀ k : ℕ, ∀ u ∈ Q, daModel f h L μ x k (x k) ≤ h u + daSum L μ k * f u := by sorry

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