Approximations of Stochastic Optimization Problems Subject to Measurability Constraints - Archive ouverte HAL Access content directly
Journal Articles SIAM Journal on Optimization Year : 2009

Approximations of Stochastic Optimization Problems Subject to Measurability Constraints

(1) , (2) , (2)
1
2

Abstract

Motivated by the numerical resolution of stochastic optimization problems subject to measurability constraints, we focus upon the issue of discretization. There exist indeed two components to be discretized for such problems, namely, the random variable modelling uncertainties (noise) and the $\sigma$-field modelling the knowledge (information) according to which decisions are taken. There is no reason to bind these two discretizations, which are a priori unrelated. In this setting, we present conditions under which the discretized problems converge to the original one. The focus is put on the convergence notions ensuring the quality of the approximation; we illustrate their importance by means of a counterexample based on the Monte Carlo approximation. Copyright © 2009 Society for Industrial and Applied Mathematics
Not file

Dates and versions

hal-00975464 , version 1 (08-04-2014)

Identifiers

Cite

Pierre Carpentier, Jean-Philippe Chancelier, Michel de Lara. Approximations of Stochastic Optimization Problems Subject to Measurability Constraints. SIAM Journal on Optimization, 2009, 19 (4), pp.1719-1734. ⟨10.1137/070692376⟩. ⟨hal-00975464⟩
99 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More