Multicoordination Methods for Solving Convex Block-Angular Programs

DOI10.1137/S1052623496313635MaRDI QIDQ4702340zbMATH OpenOpenAlexFDO

Authors

Publication date 24 November 1999

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s1052623496313635

zbMATH Keywords

coordinationdecompositionlarge-scale optimizationparallel computing

Mathematics Subject Classification ID

Decomposition methods (49M27) Parallel numerical computation (65Y05) Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35)

Recommendations

• Parallel bundle-based decomposition for large-scale structured mathematical programming problems
• Load balancing in the parallel optimization of block-angular linear programs
• Alternating direction splittings for block angular parallel optimization
• Parallel solution of large-scale, block-angular linear programs
• scientific article; zbMATH DE number 4009672

Cited in

(4)

• scientific article; zbMATH DE number 4139478 (Why is no real title available?)
• Coordination in Coarse-Grained Decomposition
• Multicommodity network flows: A survey. II: Solution methods
• Correction

This page was built for publication: Multicoordination Methods for Solving Convex Block-Angular Programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4702340)