A Primal-Dual Decomposition Algorithm for Multistage Stochastic Convex Programming |
| |
Authors: | Arjan Berkelaar Joaquim A S Gromicho Roy Kouwenberg Shuzhong Zhang |
| |
Institution: | (1) World Bank Treasury, World Bank, United States of America;(2) Vrije Universiteit, The Netherlands & ORTEC International, Amsterdam, Gouda, The Netherlands;(3) School of Management, Asian Institute of Technology, Thailand;(4) Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, Hong Kong |
| |
Abstract: | 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.Research supported by Hong Kong RGC Earmarked Grant CUHK4233/01E. |
| |
Keywords: | Multistage stochastic programming Convex objective Interior point method Homogeneous self-dual embedding |
本文献已被 SpringerLink 等数据库收录! |
|