An asynchronous bundle-trust-region method for dual decomposition of stochastic mixed-integer programming
From MaRDI portal
Recommendations
- Asynchronous Lagrangian scenario decomposition
- On parallelizing dual decomposition in stochastic integer programming
- Dual decomposition in stochastic integer programming
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
- Scalable branching on dual decomposition of stochastic mixed-integer programming problems
Cites work
- A parallel bundle framework for asynchronous subspace optimization of nonsmooth convex functions
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- A scenario decomposition algorithm for 0-1 stochastic programs
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
- An Incremental Method for Solving Convex Finite Min-Max Problems
- Asynchronous Lagrangian scenario decomposition
- Benchmarking optimization software with performance profiles.
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Decomposition algorithms for stochastic programming on a computational grid
- Distributed asynchronous incremental subgradient methods
- Dual decomposition in stochastic integer programming
- Generalized Bundle Methods
- Incremental bundle methods using upper models
- Incremental proximal methods for large scale convex optimization
- Incremental subgradient methods for nondifferentiable optimization
- Incremental-like bundle methods with application to energy planning
- Multiarea stochastic unit commitment for high wind penetration in a transmission constrained network
- On parallelizing dual decomposition in stochastic integer programming
Cited in
(16)- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
- A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl
- Scalable branching on dual decomposition of stochastic mixed-integer programming problems
- Asynchronous level bundle methods
- A massively parallel interior-point solver for LPs with generalized arrowhead structure, and applications to energy system models
- Asynchronous Lagrangian scenario decomposition
- On parallelizing dual decomposition in stochastic integer programming
- Distributed asynchronous column generation
- On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs
- Asynchronous column generation
- Optimal Convergence Rates for the Proximal Bundle Method
- Implementation of an oracle-structured bundle method for distributed optimization
- Hyperrectangular partition schemes for two-stage stochastic linear mixed integer programming problems
- Leveraging GPU batching for scalable nonlinear programming through massive Lagrangian decomposition
- A massively parallel interior-point method for arrowhead linear programs with local linking structure
- Decomposition algorithms for computational stochastic mixed-integer programming: a survey
This page was built for publication: An asynchronous bundle-trust-region method for dual decomposition of stochastic mixed-integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4620422)
