In this chapter we focus on a splitting algorithm for a broad class of multistage stochastic programming, namely, risk-averse and distributionally robust problems. The considered algorithm, denoted by Scenario Decomposition with Alternating Projections (SDAP), is a special implementation of the Douglas-Rachford splitting method that enjoys significant flexibility and opens the way to handle, in a single algorithm, several classes of risk measures and ambiguity sets.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Scenario Decomposition with Alternating Projections

  • Wim Stefanus van Ackooij,
  • Welington Luis de Oliveira

摘要

In this chapter we focus on a splitting algorithm for a broad class of multistage stochastic programming, namely, risk-averse and distributionally robust problems. The considered algorithm, denoted by Scenario Decomposition with Alternating Projections (SDAP), is a special implementation of the Douglas-Rachford splitting method that enjoys significant flexibility and opens the way to handle, in a single algorithm, several classes of risk measures and ambiguity sets.