On the implementation of a log-barrier progressive hedging method for multistage stochastic programs
From MaRDI portal
Publication:964982
DOI10.1016/j.cam.2009.12.050zbMath1189.65127OpenAlexW2062064054MaRDI QIDQ964982
Kim-Chuan Toh, Xin-Wei Liu, Gongyun Zhao
Publication date: 21 April 2010
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2009.12.050
numerical experimentslog-barrier methodprogressive hedging methodLagrangian dualpolynomial-time complexitymultistage stochastic programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Applying the progressive hedging algorithm to stochastic generalized networks
- MSLiP: A computer code for the multistage stochastic linear programming problem
- Approximate scenario solutions in the progressive hedging algorithm. A numerical study with an application to fisheries management
- Some advances in decomposition methods for stochastic linear programming
- Interior-point methods with decomposition for solving large-scale linear programs
- A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming
- Parallel decomposition of multistage stochastic programming problems
- Scenario analysis via bundle decomposition
- Mixing stochastic dynamic programming and scenario aggregation
- Parallelizable preprocessing method for multistage stochastic programming problems
- Scenario Formulation of Stochastic Linear Programs and the Homogeneous Self-Dual Interior-Point Method
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- A Primal-Dual Decomposition-Based Interior Point Approach to Two-Stage Stochastic Linear Programming
- Stochastic programming in production planning: a case with none-simple recourse
- Introduction to Stochastic Programming
- A Decomposition Method Based on SQP for a Class of Multistage Stochastic Nonlinear Programs
- On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization
- A log-barrier method with Benders decomposition for solving two-stage stochastic linear programs