Parallel bundle-based decomposition for large-scale structured mathematical programming problems
From MaRDI portal
Recommendations
- Parallel solution of large-scale, block-angular linear programs
- Decomposition of linear programs using parallel computation
- Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
- Scalable parallel Benders decomposition for stochastic linear programming
- Alternating direction splittings for block angular parallel optimization
Cites work
- A stable method for solving certain constrained least squares problems
- An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming
- An Application of Bin-Packing to Multiprocessor Scheduling
- Bounds on Multiprocessing Timing Anomalies
- Convex Analysis
- scientific article; zbMATH DE number 3846333 (Why is no real title available?)
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- Performance Guarantees for Scheduling Algorithms
- The Decomposition Algorithm for Linear Programs
Cited in
(17)- Load balancing in the parallel optimization of block-angular linear programs
- Active set methods for problems in column block angular form
- Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
- On the efficacy of distributed simplex algorithms for linear programming
- Partitioning mathematical programs for parallel solution
- Scenario analysis via bundle decomposition
- Generalized proximal point algorithm for convex optimization
- A cutting plane method from analytic centers for stochastic programming
- Parallel subgradient algorithm with block dual decomposition for large-scale optimization
- Alternating direction splittings for block angular parallel optimization
- The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures
- Coordination in Coarse-Grained Decomposition
- scientific article; zbMATH DE number 1113880 (Why is no real title available?)
- Multicoordination Methods for Solving Convex Block-Angular Programs
- Parallel implementation of a central decomposition method for solving large-scale planning problems
- Parallel solution of large-scale, block-angular linear programs
- Towards a practical parallelisation of the simplex method
This page was built for publication: Parallel bundle-based decomposition for large-scale structured mathematical programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751515)
