Eqs. (13)–(15) — attained Fenchel dual representation of worst-case value
ProvedFenchelRobust.Counterpart.eq_13_15_dualityconjugate-functionfenchel-dualityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization
Let be nonempty, convex, and compact with . Let be concave on its effective domain for every , and assume for every . With and , for every decision ,
and some attains this infimum. This is the strong-duality identity immediately before the affine-support calculation in the proof of Theorem 2.
Formalization Note. The paper writes and ; the statement uses an extended-real supremum and infimum plus an explicit attaining vector. The function is represented only on its effective domain. Closedness from the general Notation paragraph is omitted: the relative-interior qualification supports the duality step without it.
Preamble
import Mathlib import Definitions.Def_FenchelRobust_Counterpart_Model
Formal statement
namespace FenchelRobust.Counterpart
/-- Equations (13)–(15), including the attainment indicated by `min`. -/
theorem eq_13_15_duality {m n L : ℕ} (a0 : Fin m → ℝ)
(A : Matrix (Fin m) (Fin L) ℝ) (Z : Set (Fin L → ℝ))
(D : (Fin n → ℝ) → Set (Fin m → ℝ))
(f : (Fin m → ℝ) → (Fin n → ℝ) → ℝ)
(hZnonempty : Z.Nonempty) (hZconvex : Convex ℝ Z) (hZcompact : IsCompact Z)
(hZzero : (0 : Fin L → ℝ) ∈ intrinsicInterior ℝ Z)
(hconcave : ∀ x, ConcaveOn ℝ (D x) (fun a => f a x))
(hregular : Regular a0 D) :
∀ x : Fin n → ℝ,
let F := worstCase a0 A Z D f x
let dual := fun v : Fin m → ℝ =>
supportFun (uncertaintySet a0 A Z) v - concaveConj (D x) (fun a => f a x) v
F = (⨅ v, dual v) ∧ ∃ v, F = dual v := by sorry
end FenchelRobust.Counterpart
Source
Ben-Tal, den Hertog, Vial, Deriving robust counterparts of nonlinear uncertain inequalities, CentER Discussion Paper 2012-053 (July 2, 2012), p. 5, Eqs. (13)–(15), proof of Theorem 2
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.