A primal-dual decomposition algorithm for multistage stochastic convex programming

J.A. Gromicho Dos Santos, A. Berkelaar, R. Kouwenberg, S. Zhang

    Research output: Contribution to JournalArticleAcademic


    This paper presents a new and high performance solution method for multistage stochastic convex programming. Stochastic programming is a quantitative tool developed in the field of optimization to cope with the problem of decision-making under uncertainty. Among others, stochastic programming has found many applications in finance, such as asset-liability and bond-portfolio management. However, many stochastic programming applications still remain computationally intractable because of their overwhelming dimensionality. In this paper we propose a new decomposition algorithm for multistage stochastic programming with a convex objective and stochastic recourse matrices, based on the path-following interior point method combined with the homogeneous self-dual embedding technique. Our preliminary numerical experiments show that this approach is very promising in many ways for solving generic multistage stochastic programming, including its superiority in terms of numerical efficiency, as well as the flexibility in testing and analyzing the model. © Springer-Verlag Berlin 2005.
    Original languageEnglish
    Pages (from-to)153-177
    JournalMathematical Programming
    Issue number1
    Publication statusPublished - 2005


    Dive into the research topics of 'A primal-dual decomposition algorithm for multistage stochastic convex programming'. Together they form a unique fingerprint.

    Cite this