Support function of an atomic set equals that of its convex hull
ProvedJaggiFW.Sparsity.support_convexHullatomic-domainsconvex-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1support-function
Let be a set of atoms in a real inner product space, and let be a vector. For every real ,
When is finite and nonempty, some atom attains the largest inner product over the whole convex hull. Thus the support function of and of its convex hull agree, and in the finite case their common value is attained.
Formalization Note The attained point is stated as an atom in ; the paper calls it a vertex. The bound formulation of support equality also handles empty or unbounded atomic sets without assigning a default real supremum.
Preamble
import Mathlib import Definitions.Def_JaggiFW_Sparsity_Setting
Formal statement
namespace JaggiFW.Sparsity
/-- The support of an atomic set agrees with that of its convex hull (§4, PDF p. 5). -/
theorem support_convexHull {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
(A : Set E) (y : E) :
(∀ c : ℝ, (∀ s ∈ convexHull ℝ A, inner ℝ s y ≤ c) ↔
(∀ a ∈ A, inner ℝ a y ≤ c)) ∧
(A.Finite → A.Nonempty →
∃ a ∈ A, IsGreatest ((fun s => inner ℝ s y) '' convexHull ℝ A) (inner ℝ a y)) := by sorry
end JaggiFW.Sparsity
Source
Jaggi, Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization, ICML 2013 (JMLR W&CP 28), PDF p. 5, §4 "Optimizing over Atomic Sets", support-function paragraph
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.