Data parallel computing for network-structured optimization problems
type: Item
instance of: scholarly article
title: Data parallel computing for network-structured optimization problems
zbMATH Open document ID: 0803.90122
DOI: 10.1007/BF01299446
author: Stavros A. Zenios
published in: Computational Optimization and Applications
publication date: 1994-07-26T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 90C06
zbMATH DE Number: 611041
zbMATH Keywords: data level parallelism
zbMATH Keywords: connection machine
zbMATH Keywords: vector-random access machine
zbMATH Keywords: Connection Machine
zbMATH Keywords: data-parallel solution
zbMATH Keywords: large scale optimization
zbMATH Keywords: data-parallel decomposition
Wikidata QID: Q114693969
describes a project that uses: MINOS
MaRDI profile type: Publication
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
cites work: Dual coordinate step methods for linear network flow problems
cites work: The auction algorithm: A distributed relaxation method for the assignment problem
cites work: Auction algorithms for network flow problems: A tutorial introduction
cites work: Relaxation Methods for Network Flow Problems with Convex Arc Costs
cites work: Q4001523
cites work: Q5580053
cites work: An iterative row-action method for interval convex programming
cites work: Q5750347
cites work: On Block-Iterative Entropy Maximization
cites work: Interval-constrained matrix balancing
cites work: Q4026286
cites work: Proximal minimization algorithm with \(D\)-functions
cites work: Synchronous and asynchronous implementations of relaxation algorithms for nonlinear network optimization
cites work: An algorithm for the chromatic number of a graph
cites work: OR Practice—Large-Scale Nonlinear Network Models and Their Application
cites work: The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2
cites work: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
cites work: Some Computer Organizations and Their Effectiveness
cites work: A dual algorithm for the solution of nonlinear variational problems via finite element approximation
cites work: Finding Minimum-Cost Circulations by Successive Approximation
cites work: A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures
cites work: Multiplier and gradient methods
cites work: Performance Characteristics of the Jacobi and the Gauss-Seidel Versions of the Auction Algorithm on the Alliant FX/8
cites work: An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations
cites work: Implementing an “exact” Newton method for separable convex transportation problems
cites work: Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations
cites work: Q4323612
cites work: Formulating Two-Stage Stochastic Programs for Interior Point Methods
cites work: Nonlinear Perturbation of Linear Programs
cites work: Stochastic network optimization models for investment planning
cites work: Data structures for network algorithms on massively parallel architectures
cites work: Massively Parallel Algorithms for Singly Constrained Convex Programs
cites work: A Massively Parallel Algorithm for Nonlinear Stochastic Network Problems
cites work: Solving multistage stochastic network programs on massively prallel computers
cites work: Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs
cites work: A relaxed version of Bregman's method for convex programming
cites work: Q5590418
cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: Q3730336
cites work: Scenarios and Policy Aggregation in Optimization Under Uncertainty
cites work: A regularized decomposition method for minimizing a sum of polyhedral functions
cites work: Matrix scaling, entropy minimization, and conjugate duality. I: Existence conditions
cites work: A Comparative Study of Algorithms for Matrix Balancing
cites work: L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
cites work: Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
cites work: Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program
cites work: Q3992188
cites work: Matrix Balancing on a Massively Parallel Connection Machine
cites work: On the Fine-Grain Decomposition of Multicommodity Transportation Problems
cites work: Massively Parallel Row-Action Algorithms for Some Nonlinear Transportation Problems
cites work: A distributed algorithm for convex network optimization problems
cites work: Q3348730
full work available at URL: https://doi.org/10.1007/bf01299446
OpenAlex ID: W1993229124
Recommended article: Q4845367

Data parallel computing for network-structured optimization problems (Recommended article)
Recommended article: Parallel algorithms for a multi-level network optimization problem
Similarity Score: 0.9170464
Recommender Run: Recommender Run 3

Data parallel computing for network-structured optimization problems (Recommended article)
Recommended article: Q4394586
Similarity Score: 0.9140786
Recommender Run: Recommender Run 3

Data parallel computing for network-structured optimization problems (Recommended article)
Recommended article: Q3336623
Similarity Score: 0.90905
Recommender Run: Recommender Run 3

Data parallel computing for network-structured optimization problems (Recommended article)
Recommended article: Q4352996
Similarity Score: 0.90311867
Recommender Run: Recommender Run 3

Data parallel computing for network-structured optimization problems (Recommended article)
Recommended article: Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations
Similarity Score: 0.8925286
Recommender Run: Recommender Run 3

Data parallel computing for network-structured optimization problems (Recommended article)
Recommended article: Q3686511
Similarity Score: 0.891904
Recommender Run: Recommender Run 3

Data parallel computing for network-structured optimization problems (Recommended article)
Recommended article: Q4388450
Similarity Score: 0.8884894
Recommender Run: Recommender Run 3