Theorem 1 — primal convergence of four Frank–Wolfe variants
ProvedJaggiFW.PrimalDual.theorem_1Let be convex and continuously differentiable on a compact convex domain , with finite curvature constant . Start any of Algorithms 1–4 at , and let minimize on . If the approximate linear subproblems have quality parameter , then every iterate with satisfies
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 . It uses the exact supremum , 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 . For Algorithm 1 the exact oracle corresponds to ; allowing a larger nonnegative merely loosens its bound.
import Mathlib import Definitions.Def_JaggiFW_PrimalDual_Setting
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.