p. 12 β the ambiguity set π« is contained in every outer approximation π«^j
ProvedDRConvexOpt.InfConv.subset_outerambiguity-setdistributionally-robust-optimizationouter-approximationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be the standardized ambiguity set (4) and let be a partition of the index set of its confidence sets, given by a block map. Then for every block ,
where imposes only the probability conditions for , together with the expectation condition of .
This inclusion is what makes the naΓ―ve approximation (6) conservative, and it is the first inequality in the proof of Theorem 3.
Formalization Note The statement holds for every block map (surjective or not), without any of the standing conditions (C1)β(C3).
Preamble
import Mathlib import Definitions.Def_DRConvexOpt_InfConv_Setting
Formal statement
namespace DRConvexOpt.InfConv
open MeasureTheory Matrix Filter Topology
/-- p. 12: the ambiguity set π« is a subset of each outer approximation π«^j. -/
theorem subset_outer {nP nQ nK nI nJ : β} (d : AmbData nP nQ nK nI)
(blk : Fin (nI + 1) β Fin nJ) (j : Fin nJ) :
ambiguitySet d β outerSet d blk j := by sorry
end DRConvexOpt.InfConv
Source
Wiesemann, Kuhn & Sim, Distributionally Robust Convex Optimization, Optimization Online preprint 3757 (version of September 22, 2013), p. 12, sentence following the definition of π«^j
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.