Epiconvergence of relaxed stochastic optimization problem - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2013

Epiconvergence of relaxed stochastic optimization problem

Résumé

In this paper we consider the relaxation of a dynamic stochastic optimization problem where we replace a stochastic constraint - for example an almost sure constraint - by a conditional expectation constraint. We show an epiconvergence result relying on the Kudo convergence of $\sigma-$algebra and continuity of the objective and constraint operators. We also present some classicals constraints in stochastic optimization and give some conditions insuring their continuity. We conclude with a decomposition algorithm that uses such a relaxation.
Fichier principal
Vignette du fichier
epiconvergence_of_relaxation.pdf (179.63 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00848275 , version 1 (26-07-2013)
hal-00848275 , version 2 (26-09-2013)
hal-00848275 , version 3 (02-11-2020)

Identifiants

  • HAL Id : hal-00848275 , version 1

Citer

Vincent Leclère. Epiconvergence of relaxed stochastic optimization problem. 2013. ⟨hal-00848275v1⟩
287 Consultations
309 Téléchargements

Partager

Gmail Facebook X LinkedIn More