Approximate γ–tilted convexity (Definition 16)
DefinitionTiltedCvx_Supplement_ApproxTiltedConvexWrtconvex-analysisgeneralized-convexitynonsmooth-analysisoptimizationp2o-gran-per-chapterp2o-plan-bookp2o-v1
Let , proper and lower semicontinuous, and . The function is approximately –tilted convex with respect to if for every and every there is with
The supporting vector may depend on ; exact –tilted convexity with respect to implies the approximate version. It is the tool behind the regularity results (Theorems 35 and 36).
Formalization Note . Properness, lower semicontinuity and are hypotheses of the theorems that use the predicate.
Definition code
import Mathlib
import Definitions.Def_TiltedCvx_effDom
import Definitions.Def_TiltedCvx_psi
open scoped InnerProductSpace
namespace TiltedCvx.Supplement
/-- **Approximate γ–tilted convexity (Definition 16).** Pedramfar–Khanna–Quinn–Aggarwal,
arXiv:2611.03472, Definition 16, p.54: let `γ ∈ (0, 1]`, `f : ℝ^d → ℝ̄` proper lsc and
`F : ℝ^d ⇒ ℝ^d`. `f` is approximately γ–tilted convex with respect to `F` if, for every
`x ∈ dom(f) ∩ dom(F)` and every `ε > 0`, there is `v ∈ F(x)` such that
`f(y) − f(x) ≥ ψγ(⟨y − x, v⟩) − ε` for all `y ∈ dom(f)`.
**Formalization Note** `dom F = {x | F x ≠ ∅}`; the vector `v` may depend on `ε`. The inequality
is in `EReal`; for `γ > 0` and `x, y ∈ dom f` all its terms are real. "Proper lsc" and
`γ ∈ (0, 1]` are hypotheses of the theorems that use the predicate. -/
def ApproxTiltedConvexWrt {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
(γ : ℝ) (f : E → EReal) (F : E → Set E) : Prop :=
∀ x ∈ TiltedCvx.effDom f, (F x).Nonempty → ∀ ε : ℝ, 0 < ε →
∃ v ∈ F x, ∀ y ∈ TiltedCvx.effDom f,
TiltedCvx.psi γ ((⟪y - x, v⟫_ℝ : ℝ) : EReal) - (ε : EReal) ≤ f y - f x
end TiltedCvx.Supplement
Source
Pedramfar–Khanna–Quinn–Aggarwal, Tilted Convexity and an Exact Offline–Online Separation, arXiv:2611.03472, Definition 16, p.54