Partitioning mathematical programs for parallel solution
From MaRDI portal
Publication:1380936
DOI10.1007/BF01582130zbMath0894.90108MaRDI QIDQ1380936
Michael C. Ferris, Jeffrey D. Horn
Publication date: 11 March 1998
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Parallel numerical computation (65Y05)
Related Items
Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization, GPMR: An Iterative Method for Unsymmetric Partitioned Linear Systems, A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems, A model-based approach and analysis for multi-period networks, High-multiplicity \(N\)-fold IP via configuration LP, Structure Detection in Mixed-Integer Programs, The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures, On the (co)girth of a connected matroid, Dual multilevel optimization, Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation, Computing solutions to moral-hazard programs using the Dantzig-Wolfe decomposition algorithm, Parallel interior-point solver for structured quadratic programs: Application to financial planning problems, Towards a practical parallelisation of the simplex method, Lagrangian decomposition of block-separable mixed-integer all-quadratic programs, A structure-conveying modelling language for mathematical and stochastic programming, Optimizing Large-Scale Linear Energy System Problems with Block Diagonal Structure by Using Parallel Interior-Point Methods, A Structure Conveying Parallelizable Modeling Language for Mathematical Programming, Automatic Dantzig-Wolfe reformulation of mixed integer programs, Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems, Parallel subgradient algorithm with block dual decomposition for large-scale optimization, A decomposition-based approach for the multiperiod multiproduct distribution planning problem, A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl, Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming
Uses Software
Cites Work
- Parallel bundle-based decomposition for large-scale structured mathematical programming problems
- Decomposition of linear programs using parallel computation
- Bundle-based decomposition: Conditions for convergence
- A diagonal quadratic approximation method for large scale linear programs
- New variants of bundle methods
- Decomposition Principle for Linear Programs
- An Automatic One-Way Dissection Algorithm for Irregular Finite Element Problems
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- Parallel Constraint Distribution
- An Interior Point Method for Block Angular Optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- An Efficient Heuristic Procedure for Partitioning Graphs
- A stable method for solving certain constrained least squares problems
- Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
- Parallel Variable Distribution
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Convex Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
