Asynchronous gradient algorithms for a class of convex separable network flow problems
From MaRDI portal
Publication:1915768
DOI10.1007/BF00248264zbMATH Open0848.90055MaRDI QIDQ1915768FDOQ1915768
Publication date: 1 July 1996
Published in: Computational Optimization and Applications (Search for Journal in Brave)
distributed algorithmsdual problemparallel iterative methodssingle commodity strictly convex network flowasynchronous gradient algorithms
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convex Analysis
- An iterative row-action method for interval convex programming
- Asynchronous Iterative Methods for Multiprocessors
- Distributed asynchronous computation of fixed points
- Massively Parallel Algorithms for Singly Constrained Convex Programs
- Chaotic relaxation
- Distributed dynamic programming
- Some convergence results for asynchronous algorithms
- 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
- Periodic chaotic relaxation
- Asynchronous implementation of relaxation and gradient algorithms for convex network flow problems
- Parallel synchronous and asynchronous implementations of the auction algorithm
- Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
- Asynchronous Relaxations for the Numerical Solution of Differential Equations by Parallel Processors
- On Block-Iterative Entropy Maximization
- Asymptotic agreement and convergence of asynchronous stochastic algorithms
- Parallel Algorithms for the Iterative Solution to Linear Systems
- Synchronous and asynchronous implementations of relaxation algorithms for nonlinear network optimization
- M-Functions and Parallel Asynchronous Algorithms
Cited In (6)
- Asynchronous implementation of relaxation and gradient algorithms for convex network flow problems
- Optimal scaling of a gradient method for distributed resource allocation
- Asynchronous Broadcast-Based Convex Optimization Over a Network
- Accelerated Dual Descent for Network Flow Optimization
- Partially Asynchronous, Parallel Algorithms for Network Flow and Other Problems
- A new stopping criterion for linear perturbed asynchronous iterations
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 👍 👎
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)
