.png){kind=icon}
.png){kind=icon}
Return
An ADMM algorithm for two-stage stochastic programming problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-019-03471-0.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The alternate direction method of multipliers (ADMM) has received significant attention recently as a powerful algorithm to solve convex problems with a block structure. The vast majority of applications focus on deterministic problems. In this paper we show that ADMM can be applied to solve two-stage stochastic programming problems, and we propose an implementation in three blocks with or without proximal terms. We present numerical results for large scale instances, and extend our findings for risk averse formulations using utility functions.
Keywords:
SAMPLE AVERAGE APPROXIMATION
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W