An Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse
From MaRDI portal
Publication:5501230
DOI10.1137/140967337zbMath1317.90222OpenAlexW893700568MaRDI QIDQ5501230
Yongjia Song, James R. Luedtke
Publication date: 3 August 2015
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/140967337
Related Items
A Scalable Bounding Method for Multistage Stochastic Programs ⋮ The stochastic critical node problem over trees ⋮ The Benders by batch algorithm: design and stabilization of an enhanced algorithm to solve multicut Benders reformulation of two-stage stochastic programs ⋮ On conditional cuts for stochastic dual dynamic programming ⋮ Incremental Bundle Methods using Upper Models ⋮ Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes ⋮ Unnamed Item ⋮ A Primal–Dual Lifting Scheme for Two-Stage Robust Optimization ⋮ Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse ⋮ Risk Averse Shortest Paths: A Computational Study ⋮ Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs ⋮ Large-scale unit commitment under uncertainty: an updated literature survey ⋮ An Embarrassingly Parallel Method for Large-Scale Stochastic Programs ⋮ Constraint generation for risk averse two-stage stochastic programs ⋮ Regularized decomposition of large scale block-structured robust optimization problems ⋮ An improved L-shaped method for solving process flexibility design problems ⋮ Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse ⋮ Optimization-Driven Scenario Grouping ⋮ Multistage Robust Mixed-Integer Optimization with Adaptive Partitions ⋮ Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse ⋮ Optimization for L1-Norm Error Fitting via Data Aggregation ⋮ Generalized adaptive partition-based method for two-stage stochastic linear programs: geometric oracle and analysis ⋮ Generalized adaptive partition-based method for two-stage stochastic linear programs with fixed recourse
Uses Software
Cites Work
- Applying oracles of on-demand accuracy in two-stage stochastic programming -- a computational study
- A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs
- Stochastic linear programming. Models, theory, and computation.
- Adaptive multicut aggregation for two-stage stochastic linear programs with recourse
- Accelerating the regularized decomposition method for two stage stochastic linear problems
- Convergence aspects of adaptive clustering in variable aggregation
- Improving aggregation bounds for two-stage stochastic programs
- New variants of bundle methods
- A hierarchy of bounds for stochastic mixed-integer programs
- Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method
- Solving two-stage stochastic programming problems with level decomposition
- The empirical behavior of sampling methods for stochastic programming
- Stochastic Network Interdiction
- On a New Collection of Stochastic Linear Programming Test Problems
- Level bundle methods for oracles with on-demand accuracy
- Chance-Constrained Binary Packing Problems
- Covering Linear Programming with Violations
- Risk-Averse Optimization in Two-Stage Stochastic Models: Computational Aspects and a Study
- Introduction to Stochastic Programming
- Bounds on the value of information in uncertain decision problems II
- Inexact Bundle Methods for Two-Stage Stochastic Programming
- Aggregation and Disaggregation Techniques and Methodology in Optimization
- Solving LP Relaxations of Large-Scale Precedence Constrained Problems
- Aggregation bounds in stochastic linear programming
- A regularized decomposition method for minimizing a sum of polyhedral functions
- Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
- Aggregation in Dynamic Programming
- Bounds on the Effect of Aggregating Variables in Linear Programs
- Bounds for Row-Aggregation in Linear Programming
- Tight Bounds for Stochastic Convex Programs
- Bounds on the Expectation of a Convex Function of a Random Variable: With Applications to Stochastic Programming
- Primal-Dual Aggregation and Disaggregation for Stochastic Linear Programs
- A branch and bound method for stochastic integer problems under probabilistic constraints
- Aggregation and Disaggregation in Integer Programming Problems
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- The Scenario Generation Algorithm for Multistage Stochastic Linear Programming
