% You need the following packages in the main file to let this entry work:
% \usepackage[english,ngerman]{babel} multilingual support
% \usepackage{url} urls formatting
% \usepackage{hyperref} make url klickable, recommended
% Just put them into the preamble of the main .tex-file.
% You should possibly make some changes to the typography of this entry,
% e.g. quotation marks.
% Which fields of this entry will be shown in the bibliography depends on the bibtex-style, which you use
@incollection{oai:export,
author = {Suvrajeet Sen and Zhihong Zhou},
title = {Multistage Stochastic Decomposition: A Bridge between Stochastic Programming and Approximate Dynamic Programming},
series = {Stochastic Programming E-Print Series},
year = {2012},
publisher = {Institut für Mathematik},
editor =
{
Julie L.
Higle and Werner
Römisch and Surrajeet
Sen
},
WernerRömischSurrajeetSenabstract = {Multi-stage stochastic programs (MSP) pose some of the more challenging optimization problems. Because such models can become rather intractable in general, it is important to design algorithms that can provide approximations which, in the long run, yield solutions that are arbitrarily close to an optimum. In this paper, we propose a statistically motivated sequential sampling method that is applicable to multi-stage stochastic linear programs, and we refer to it as the multistage stochastic decomposition (MSD) algorithm. As with earlier SD methods for two- stage stochastic linear programs, this approach preserves one of the most attractive features of SD: asymptotic convergence of the solutions can be proven (with probability one) without any iteration requiring more than a small sample-size. This data-driven approach also allows us to sequentially update value function approximations, and the computations themselves can be organized in a manner that decomposes the scenario generation (stochastic) process from the optimization computations. As a by-product of this study, we also show that SD algorithms are essentially approximate dynamic programming algorithms for SP. Our asymptotic analysis also reveals conceptual connections between multiple SP algorithms. },
note = {published; SIOPT}
url = { \url{http://edoc.hu-berlin.de/docviews/abstract.php?id=39237} },
url = { \url{urn:nbn:de:kobv:11-100200569} },
number = {
3},
timestamp = {2016-05-31T07:55:17Z}
}