Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(2.18) — telescoped bound Σλᵢ⟨gᵢ, xᵢ − x₀⟩ ≤ V_{β₁}(−s₁) − V_{β_{k+1}}(−s_{k+1}) + (1/2σ)Σ_{i=1}^k λᵢ²‖gᵢ‖²_*/βᵢ

Proved
PrimalDualSubgrad.DA.eq_2_18

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

convex-optimizationdual-averagingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Fix a prox setting (Q,d,σ,x0)(Q, d, \sigma, x_0)(Q,d,σ,x0​) in a finite-dimensional normed space EEE and an argmin map π\piπ, and let (xk,gk,λk,βk)(x_k, g_k, \lambda_k, \beta_k)(xk​,gk​,λk​,βk​) be generated by the Dual Averaging scheme (2.14). Then for every k≥0k \ge 0k≥0

∑i=0kλi⟨gi,xi−x0⟩≤Vβ1(−s1)−Vβk+1(−sk+1)+12σ∑i=1kλi2βi∥gi∥∗2.\sum_{i=0}^k \lambda_i\langle g_i, x_i - x_0\rangle \le V_{\beta_1}(-s_1) - V_{\beta_{k+1}}(-s_{k+1}) + \frac{1}{2\sigma}\sum_{i=1}^k \frac{\lambda_i^2}{\beta_i}\|g_i\|_*^2.i=0∑k​λi​⟨gi​,xi​−x0​⟩≤Vβ1​​(−s1​)−Vβk+1​​(−sk+1​)+2σ1​i=1∑k​βi​λi2​​∥gi​∥∗2​.

Note that the sum on the right starts at i=1i = 1i=1. This is the core estimate of the proof of Theorem 1, from which all three parts follow.

Preamble
import Mathlib
import Definitions.Def_PrimalDualSubgrad_DA_DualAveraging
Formal statement
namespace PrimalDualSubgrad.DA

open Finset

/-- (2.18), p. 10 (proof of Theorem 1, item 1): for a run of the DA-scheme (2.14) and every
`k ≥ 0`,
`∑_{i=0}^k λ_i⟨g_i, x_i − x0⟩ ≤ V_{β_1}(−s_1) − V_{β_{k+1}}(−s_{k+1}) + (1/(2σ)) ∑_{i=1}^k λ_i²‖g_i‖²_*/β_i`. -/
theorem eq_2_18 {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]
    (P : ProxSetting E) (π : ℝ → StrongDual ℝ E → E) (hπ : IsProxMap P π)
    (lam β : ℕ → ℝ) (g : ℕ → StrongDual ℝ E) (x : ℕ → E) (hrun : IsDARun P π lam β g x)
    (k : ℕ) :
    ∑ i ∈ range (k + 1), lam i * g i (x i - P.x0) ≤
      V P (β 1) (-(sAgg lam g 1)) - V P (β (k + 1)) (-(sAgg lam g (k + 1))) +
        1 / (2 * P.σ) * ∑ i ∈ Icc 1 k, lam i ^ 2 / β i * ‖g i‖ ^ 2 := by sorry

end PrimalDualSubgrad.DA
Source
Nesterov, Primal-dual subgradient methods for convex problems, Math. Program. 120 (2009), §2, proof of Theorem 1, (2.18), p. 10
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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