Partitioning mathematical programs for parallel solution

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)

zbMATH Keywords

partitioning; heuristics; graph partitioning; bundle method; large, constrained, optimization

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C06: Large-scale problems in mathematical programming

90C05: Linear programming

65Y05: Parallel numerical computation

Related Items

Computing solutions to moral-hazard programs using the Dantzig-Wolfe decomposition algorithm, 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, On the (co)girth of a connected matroid, Dual multilevel optimization, Parallel interior-point solver for structured quadratic programs: Application to financial planning problems, A Structure Conveying Parallelizable Modeling Language for Mathematical Programming

Uses Software

• METIS
• PVM
• KORBX
• Chaco

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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