Journal Articles Mathematics of Operations Research Year : 2015

On the Convergence of Decomposition Methods for Multistage Stochastic Convex Programs

Abstract

We prove the almost-sure convergence of a class of sampling-based nested decomposition algorithms for multistage stochastic convex programs in which the stage costs are general convex functions of the decisions , and uncertainty is modelled by a scenario tree. As special cases, our results imply the almost-sure convergence of SDDP, CUPPS and DOASA when applied to problems with general convex cost functions.
Fichier principal
Vignette du fichier
ConvergenceOfDecompositionMethods.pdf (488) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01208295 , version 1 (02-10-2015)

Identifiers

Cite

Pierre Girardeau, Vincent Leclere, A. B. Philpott. On the Convergence of Decomposition Methods for Multistage Stochastic Convex Programs. Mathematics of Operations Research, 2015, 40 (1), ⟨10.1287/moor.2014.0664⟩. ⟨hal-01208295⟩
147 View
330 Download

Altmetric

Share

More