Asynchronous gradient algorithms for a class of convex separable network flow problems
type: Item
instance of: scholarly article
title: Asynchronous gradient algorithms for a class of convex separable network flow problems
zbMATH Open document ID: 0848.90055
DOI: 10.1007/BF00248264
author: Didier El Baz
published in: Computational Optimization and Applications
publication date: 1996-07-01T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 894724
zbMATH Keywords: distributed algorithms
zbMATH Keywords: single commodity strictly convex network flow
zbMATH Keywords: parallel iterative methods
zbMATH Keywords: asynchronous gradient algorithms
zbMATH Keywords: dual problem
MaRDI profile type: Publication
cites work: Parallel Algorithms for the Iterative Solution to Linear Systems
cites work: Asynchronous Iterative Methods for Multiprocessors
cites work: Distributed dynamic programming
cites work: Distributed asynchronous computation of fixed points
cites work: Parallel synchronous and asynchronous implementations of the auction algorithm
cites work: Q4845367
cites work: Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
cites work: Q4001523
cites work: Relaxation Methods for Network Flow Problems with Convex Arc Costs
cites work: An iterative row-action method for interval convex programming
cites work: On Block-Iterative Entropy Maximization
cites work: Synchronous and asynchronous implementations of relaxation algorithms for nonlinear network optimization
cites work: Chaotic relaxation
cites work: Periodic chaotic relaxation
cites work: M-Functions and Parallel Asynchronous Algorithms
cites work: Asynchronous implementation of relaxation and gradient algorithms for convex network flow problems
cites work: Some convergence results for asynchronous algorithms
cites work: Asymptotic agreement and convergence of asynchronous stochastic algorithms
cites work: A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius
cites work: Q4095788
cites work: Q4098608
cites work: Q4720701
cites work: Q3806252
cites work: Asynchronous Relaxations for the Numerical Solution of Differential Equations by Parallel Processors
cites work: Massively Parallel Algorithms for Singly Constrained Convex Programs
cites work: Convex Analysis
cites work: Q3730336
description: scientific article; zbMATH DE number 894724