期刊
INFORMS JOURNAL ON COMPUTING
卷 19, 期 2, 页码 239-247出版社
INFORMS
DOI: 10.1287/ijoc.1050.0163
关键词
stochastic programming; large-scale optimization; quadratic programming; mean-variance optimization
We consider decomposition approaches for the solution of multistage stochastic programs that appear in financial applications. In particular, we discuss the performance of two algorithms that we test on the mean-variance portfolio optimization problem. The first algorithm is based on a regularized version of Benders decomposition, and we discuss its extension to the quadratic case. The second algorithm is an augmented lagrangian method. Our results indicate that the algorithm based on regularized Benders decomposition is more efficient, which is in line with similar studies performed in the linear setting.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据