Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 1 — primal convergence of four Frank–Wolfe variants

Proved
JaggiFW.PrimalDual.theorem_1

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

conditional-gradientfrank-wolfep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1primal-convergence

Let fff be convex and continuously differentiable on a compact convex domain DDD, with finite curvature constant CfC_fCf​. Start any of Algorithms 1–4 at x(0)∈Dx^{(0)}\in Dx(0)∈D, and let x∗x^*x∗ minimize fff on DDD. If the approximate linear subproblems have quality parameter δ≥0\delta\ge0δ≥0, then every iterate with k≥1k\ge1k≥1 satisfies

f(x(k))−f(x∗)≤2Cfk+2(1+δ).f(x^{(k)})-f(x^*)\le\frac{2C_f}{k+2}(1+\delta).f(x(k))−f(x∗)≤k+22Cf​​(1+δ).

This is the paper's uniform primal convergence rate for its four update rules.

Formalization Note The theorem quantifies over an unbounded run, since the bound holds for every k≥1k\ge1k≥1. It uses the exact supremum CfC_fCf​, whose finiteness is made explicit. The ambient Hilbert space is generalized to a real normed space via the Fréchet derivative, and convexity is required only on DDD. For Algorithm 1 the exact oracle corresponds to δ=0\delta=0δ=0; allowing a larger nonnegative δ\deltaδ merely loosens its bound.

Preamble
import Mathlib
import Definitions.Def_JaggiFW_PrimalDual_Setting
Formal statement
namespace JaggiFW.PrimalDual

/-- Theorem 1 (primal convergence), page 4. -/
theorem theorem_1 {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
    (D : Set E) (hDc : IsCompact D) (hDconv : Convex ℝ D)
    (f : E → ℝ) (hfC1 : ContDiff ℝ 1 f) (hfconv : ConvexOn ℝ D f)
    (hCf : BddAbove (curvatureSet f D))
    (xstar : E) (hxstar : xstar ∈ D) (hmin : ∀ y ∈ D, f xstar ≤ f y)
    (δ : ℝ) (hδ : 0 ≤ δ) (v : Variant) (x s : ℕ → E) (hx0 : x 0 ∈ D)
    (hrun : ∀ k, IsFWStep f D δ (curvatureConst f D) v x s k) :
    ∀ k : ℕ, 1 ≤ k →
      f (x k) - f xstar ≤ 2 * curvatureConst f D / ((k : ℝ) + 2) * (1 + δ) := by sorry

end JaggiFW.PrimalDual
Source
Jaggi, Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization, ICML 2013 (JMLR W&CP 28), https://proceedings.mlr.press/v28/jaggi13.html, PDF p. 4, Theorem 1
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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me