Benders decomposition with adaptive oracles for large scale optimization
DOI10.1007/s12532-020-00197-0zbMath1480.90005OpenAlexW3108280926MaRDI QIDQ2063193
Nagisa Sugishita, K. I. M. McKinnon, Andreas Grothey, Nicolò Mazzi
Publication date: 10 January 2022
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-020-00197-0
Large-scale problems in mathematical programming (90C06) Stochastic programming (90C15) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items (2)
Cites Work
- Applying oracles of on-demand accuracy in two-stage stochastic programming -- a computational study
- On approximations with finite precision in bundle methods for nonsmooth optimization
- Partitioning procedures for solving mixed-variables programming problems
- Multi-stage stochastic optimization applied to energy planning
- Bundle-type methods for inexact data
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- Uncontrolled inexact information within bundle methods
- Solving two-stage stochastic programming problems with level decomposition
- Level bundle methods for oracles with on-demand accuracy
- Introduction to Stochastic Programming
- Inexact Bundle Methods for Two-Stage Stochastic Programming
- Inexact Cuts in Benders Decomposition
- On Solving Multistage Stochastic Programs with Coherent Risk Measures
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- A proximal bundle method based on approximate subgradients
This page was built for publication: Benders decomposition with adaptive oracles for large scale optimization
