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

DOI10.1007/BF00248264MaRDI QIDQ1915768zbMATHFDO

Authors Didier El Baz

Publication date 1 July 1996

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

zbMATH Keywords

distributed algorithmsdual problemparallel iterative methodssingle commodity strictly convex network flowasynchronous gradient algorithms

Mathematics Subject Classification ID

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

Recommendations

• Asynchronous implementation of relaxation and gradient algorithms for convex network flow problems
• Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
• Partially Asynchronous, Parallel Algorithms for Network Flow and Other Problems
• Parallel algorithms for solving the convex minimum cost flow problem
• Distributed asynchronous incremental subgradient methods

Cites work

• scientific article; zbMATH DE number 3961334 (Why is no real title available?)
• scientific article; zbMATH DE number 4075916 (Why is no real title available?)
• scientific article; zbMATH DE number 51132 (Why is no real title available?)
• scientific article; zbMATH DE number 3516564 (Why is no real title available?)
• scientific article; zbMATH DE number 3519845 (Why is no real title available?)
• scientific article; zbMATH DE number 3992830 (Why is no real title available?)
• scientific article; zbMATH DE number 795218 (Why is no real title available?)
• M-Functions and Parallel Asynchronous Algorithms
• A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius
• An iterative row-action method for interval convex programming
• Asymptotic agreement and convergence of asynchronous stochastic algorithms
• Asynchronous Iterative Methods for Multiprocessors
• Asynchronous Relaxations for the Numerical Solution of Differential Equations by Parallel Processors
• Asynchronous implementation of relaxation and gradient algorithms for convex network flow problems
• Chaotic relaxation
• Convex Analysis
• Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
• Distributed asynchronous computation of fixed points
• Distributed dynamic programming
• Massively Parallel Algorithms for Singly Constrained Convex Programs
• On Block-Iterative Entropy Maximization
• Parallel Algorithms for the Iterative Solution to Linear Systems
• Parallel synchronous and asynchronous implementations of the auction algorithm
• Periodic chaotic relaxation
• Relaxation Methods for Network Flow Problems with Convex Arc Costs
• Some convergence results for asynchronous algorithms
• Synchronous and asynchronous implementations of relaxation algorithms for nonlinear network optimization

Cited in

(7)

• Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
• Asynchronous Broadcast-Based Convex Optimization Over a Network
• Asynchronous implementation of relaxation and gradient algorithms for convex network flow problems
• Partially Asynchronous, Parallel Algorithms for Network Flow and Other Problems
• A new stopping criterion for linear perturbed asynchronous iterations
• Accelerated Dual Descent for Network Flow Optimization
• Optimal scaling of a gradient method for distributed resource allocation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1915768)