.png){kind=icon}
返回
Primal-dual constraint aggregation with application to stochastic programming
.png){kind=icon}
PRE
AI
DOI：10.1023/A:1019232731587.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The special constraint structure and large dimension are characteristic for multistage stochastic optimization. This results from modeling future uncertainty via branching process or scenario tree. Most efficient algorithms for solving this type of problems use certain decomposition schemes, and often only a part of the whole set of scenarios is taken into account in order to make the problem tractable. We propose a primal-dual method based on constraint aggregation, which constructs a sequence of iterates converging to a solution of the initial problem. At each iteration, however, only a reduced subproblem with smaller number of aggregate constraints has to be solved. Number of aggregates and their composition are determined by the user, and the procedure for calculating aggregates can be parallelized. The method provides a posteriori estimates of the quality of the current solution approximation in terms of the objective function value and the residual. Results of numerical tests for a portfolio allocation problem with quadratic utility function are presented.
Keyword:
constraint aggregation
decomposition
multistage stochastic programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
