Approximations of Stochastic Optimization Problems Subject to Measurability Constraints

Pierre Carpentier 1 Jean-Philippe Chancelier 2 Michel de Lara 2
1 OC - Optimisation et commande
2 CERMICS - Centre d'Enseignement et de Recherche en Mathématiques et Calcul Scientifique
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
Document type :
Journal articles
Complete list of metadatas
https://hal-ensta-paris.archives-ouvertes.fr//hal-00975464
Contributor : Aurélien Arnoux <>
Submitted on : Tuesday, April 8, 2014 - 4:36:24 PM
Last modification on : Friday, July 5, 2019 - 9:28:02 AM

Identifiers

Collections

ENSTA | PARISTECH | UMA_ENSTA | ENPC | INSMI | CERMICS

Citation

Pierre Carpentier, Jean-Philippe Chancelier, Michel de Lara. Approximations of Stochastic Optimization Problems Subject to Measurability Constraints. SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2009, 19 (4), pp.1719-1734. ⟨10.1137/070692376⟩. ⟨hal-00975464⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

267

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD