Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs

DOI10.1007/BF00248763zbMath0784.90081OpenAlexW1999556776MaRDI QIDQ2366829

Stavros A. Zenios, Søren S. Nielsen

Publication date: 21 March 1994

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00248763

zbMATH Keywords

network simplex algorithmmassively parallel computingentropic proximal pointlinear network programsquadratic proximal point

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonlinear programming (90C30) Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (6)

Data parallel computing for network-structured optimization problems ⋮ Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations ⋮ A COMPARATIVE STUDY OF PARALLEL DECOMPOSITIONS FOR MULTICOMMODITY FLOW PROBLEMS∗ ⋮ Solving multistage stochastic network programs on massively prallel computers ⋮ Interval underrelaxed bregman's method with an application ⋮ Approximate iterations in Bregman-function-based proximal algorithms

Uses Software

• KORBX
• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A distributed algorithm for convex network optimization problems
• Parallel application of block-iterative methods in medical imaging and radiation therapy
• Implementing proximal point methods for linear programming
• An iterative row-action method for interval convex programming
• Proximal minimization algorithm with \(D\)-functions
• Interior proximal point algorithm for linear programs
• Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
• Relaxation Methods for Network Flow Problems with Convex Arc Costs
• Nonlinear Perturbation of Linear Programs
• Massively Parallel Row-Action Algorithms for Some Nonlinear Transportation Problems
• An Interior Point Method for Block Angular Optimization
• On the Fine-Grain Decomposition of Multicommodity Transportation Problems
• Massively Parallel Algorithms for Singly Constrained Convex Programs
• Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• A Massively Parallel Algorithm for Nonlinear Stochastic Network Problems

This page was built for publication: Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs