Approximations of Stochastic Optimization Problems Subject to Measurability Constraints - ENSTA Paris - École nationale supérieure de techniques avancées Paris Accéder directement au contenu
Article Dans Une Revue SIAM Journal on Optimization Année : 2009

Approximations of Stochastic Optimization Problems Subject to Measurability Constraints

Résumé

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
Fichier non déposé

Dates et versions

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

Identifiants

Citer

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⟩
107 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More