Scenario Decomposition with Alternating Projections
摘要
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.