Asynchronous gradient algorithms for a class of convex separable network flow problems

DOI10.1007/BF00248264zbMath0848.90055MaRDI QIDQ1915768

Didier El Baz

Publication date: 1 July 1996

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

zbMATH Keywords

dual problemdistributed algorithmsparallel iterative methodssingle commodity strictly convex network flowasynchronous gradient algorithms

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Parallel numerical computation (65Y05)

Related Items (2)

Optimal scaling of a gradient method for distributed resource allocation ⋮ A new stopping criterion for linear perturbed asynchronous iterations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asynchronous implementation of relaxation and gradient algorithms for convex network flow problems
• An iterative row-action method for interval convex programming
• Some convergence results for asynchronous algorithms
• Parallel synchronous and asynchronous implementations of the auction algorithm
• Synchronous and asynchronous implementations of relaxation algorithms for nonlinear network optimization
• Periodic chaotic relaxation
• Chaotic relaxation
• Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
• M-Functions and Parallel Asynchronous Algorithms
• Distributed asynchronous computation of fixed points
• Asynchronous Relaxations for the Numerical Solution of Differential Equations by Parallel Processors
• On Block-Iterative Entropy Maximization
• A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius
• Relaxation Methods for Network Flow Problems with Convex Arc Costs
• Parallel Algorithms for the Iterative Solution to Linear Systems
• Distributed dynamic programming
• Massively Parallel Algorithms for Singly Constrained Convex Programs
• Asynchronous Iterative Methods for Multiprocessors
• Asymptotic agreement and convergence of asynchronous stochastic algorithms
• Convex Analysis

This page was built for publication: Asynchronous gradient algorithms for a class of convex separable network flow problems