§5.2, proof of Proposition 3, p. 19 — the value of the SDP (19) bounds the inner problem (18)
ProvedMomentDRO.WorstCov.primal19_bounds_innerdistributionally-robust-optimizationdualitymoment-problemp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1semidefinite-programming
Let and , let define the cost , let , , let and . For every distribution there is a feasible point of the SDP
whose objective value is at least the expected cost under :
The page states that (19) "by strong duality achieves the same optimum" as (18). This item is the half of that equality used by the proof: every value of (18) is dominated by a value of (19). The other half is the attainment proved through the mixture construction.
Formalization Note and as in (18). The objective is written with the sign of the proof's last display (p. 21), not the misprinted sign of (19a).
Preamble
import Mathlib import Definitions.Def_MomentDRO_WorstCov_Setting open MeasureTheory Matrix
Formal statement
namespace MomentDRO.WorstCov
theorem primal19_bounds_inner {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) :
∀ Q ∈ D1 Set.univ μhat Sighat 0 γ2,
∃ (Lam : Fin K → Matrix (Fin n) (Fin n) ℝ) (lam : Fin K → Fin n → ℝ) (nu : Fin K → ℝ),
Feasible19 μhat Sighat γ2 Lam lam nu ∧
∫ ξ, pwCost a b x ξ ∂Q ≤ obj19 a b x lam nu := 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 (19a)–(19d)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.