Data parallel computing for network-structured optimization problems
From MaRDI portal
Publication:1328430
DOI10.1007/BF01299446zbMath0803.90122OpenAlexW1993229124WikidataQ114693969 ScholiaQ114693969MaRDI QIDQ1328430
Publication date: 26 July 1994
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01299446
large scale optimizationconnection machineConnection Machinedata level parallelismdata-parallel decompositiondata-parallel solutionvector-random access machine
Programming involving graphs or networks (90C35) Large-scale problems in mathematical programming (90C06) Parallel numerical computation (65Y05)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interval-constrained matrix balancing
- Stochastic network optimization models for investment planning
- A relaxed version of Bregman's method for convex programming
- A distributed algorithm for convex network optimization problems
- Dual coordinate step methods for linear network flow problems
- Matrix scaling, entropy minimization, and conjugate duality. I: Existence conditions
- Partitioning procedures for solving mixed-variables programming problems
- An iterative row-action method for interval convex programming
- Synchronous and asynchronous implementations of relaxation algorithms for nonlinear network optimization
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Data structures for network algorithms on massively parallel architectures
- Auction algorithms for network flow problems: A tutorial introduction
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- The auction algorithm: A distributed relaxation method for the assignment problem
- Proximal minimization algorithm with \(D\)-functions
- Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations
- Solving multistage stochastic network programs on massively prallel computers
- Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs
- Multiplier and gradient methods
- Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
- Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
- Finding Minimum-Cost Circulations by Successive Approximation
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- A Comparative Study of Algorithms for Matrix Balancing
- A regularized decomposition method for minimizing a sum of polyhedral functions
- On Block-Iterative Entropy Maximization
- Relaxation Methods for Network Flow Problems with Convex Arc Costs
- OR Practice—Large-Scale Nonlinear Network Models and Their Application
- Implementing an “exact” Newton method for separable convex transportation problems
- Nonlinear Perturbation of Linear Programs
- Formulating Two-Stage Stochastic Programs for Interior Point Methods
- Massively Parallel Row-Action Algorithms for Some Nonlinear Transportation Problems
- On the Fine-Grain Decomposition of Multicommodity Transportation Problems
- An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations
- Performance Characteristics of the Jacobi and the Gauss-Seidel Versions of the Auction Algorithm on the Alliant FX/8
- Matrix Balancing on a Massively Parallel Connection Machine
- Massively Parallel Algorithms for Singly Constrained Convex Programs
- Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program
- 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
- A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures
- A Massively Parallel Algorithm for Nonlinear Stochastic Network Problems
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- An algorithm for the chromatic number of a graph
- Some Computer Organizations and Their Effectiveness
