§5.2, proof of Proposition 3, p. 19 — the SDP (19) and the inner problem (18) have the same optimal value
ProvedMomentDRO.WorstCov.optimal_values_eqdistributionally-robust-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1semidefinite-programmingstrong-duality
Let , , , and . For every real , is the maximum (attained) of the SDP
if and only if is the maximum (attained) of the inner problem
This is the page's claim that (19) "by strong duality achieves the same optimum" as (18), stated as an equality of attained maxima.
Formalization Note " is the maximum" is IsGreatest, never a real supremum. , .
Preamble
import Mathlib import Definitions.Def_MomentDRO_WorstCov_Setting open MeasureTheory Matrix
Formal statement
namespace MomentDRO.WorstCov
theorem optimal_values_eq {n K : ℕ} [NeZero K] (a b : Fin K → ℝ) (x : Fin n → ℝ)
(μhat : Fin n → ℝ) (Sighat : Matrix (Fin n) (Fin n) ℝ) (hSig : Sighat.PosDef)
(γ2 : ℝ) (hγ2 : 0 < γ2) (v : ℝ) :
IsGreatest {t | ∃ (Lam : Fin K → Matrix (Fin n) (Fin n) ℝ) (lam : Fin K → Fin n → ℝ)
(nu : Fin K → ℝ), Feasible19 μhat Sighat γ2 Lam lam nu ∧ t = obj19 a b x lam nu} v ↔
IsGreatest ((fun Q => ∫ ξ, pwCost a b x ξ ∂Q) '' D1 Set.univ μhat Sighat 0 γ2) v := by sorry
end MomentDRO.WorstCov
Source
Delage & Ye, Distributionally robust optimization under moment uncertainty with application to data-driven problems, authors' draft of 20 Feb 2008 (OR 58(3), 2010), p. 19, §5.2, proof of Proposition 3, (18) and (19)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.