Distributed asynchronous relaxation methods for convex network flow problems

Distributed asynchronous relaxation methods for convex network flow problems

Bibliography: p. 22-23.

书目详细资料
其他作者:	Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
语言:	eng
出版:	Laboratory for Information and Decision Systems, Massachusetts Institute of Technology 2002
主题:	TK7855.M41 E3845 no.1417 Iterative methods (Mathematics)
在线阅读:	http://hdl.handle.net/1721.1/1139

相似书籍

Distributed asynchronous relaxation methods for linear network flow problems
出版: (2003)

An e-relaxation method for separable convex cost network flow problems
出版: (2003)

E-relaxation and auction method for separable convex cost network flow problems
出版: (2003)

An E-relaxation method for separable convex cost generalized network flow problems
出版: (2003)

On the stability of asynchronous iterative processes
出版: (2003)

Partially asynchronous, parallel algorithms for network flow and other problems
出版: (2003)

Relaxation methods for problems with strictly convex separable costs and linear constraints
出版: (2003)

Relaxation methods for problems with strictly convex costs and linear inequality constraints
出版: (2003)

Relaxation methods for minimum cost ordinary and generalized network flow problems
出版: (2003)

Parallel asynchronous primal-dual methods for the minimum cost flow problem
出版: (2003)

Relaxation methods for network flow problems with convex arc costs
出版: (2003)

RELAX-IV : a faster version of the RELAX code for solving minimum cost flow problems
出版: (2003)

The auction algorithm : a distributed relaxation method for the assignment problem
出版: (2003)

Some issues in distributed asynchronous routing in virtual circuit data networks
出版: (2003)

On the average communication complexity of asynchronous distributed algorithms
出版: (2002)

On the average communication complexity of asynchronous distributed algorithms
出版: (2003)

Parallel asynchronous Hungarian methods for the assignment problem
出版: (2003)

Relaxation methods for minimum cost network flow problems
出版: (2002)

The relaxation method for a special class of linear programming problems
出版: (2003)

RELAX: a computer code for minimum cost network flow problems
出版: (2003)

Asynchronous stochastic approximation and Q-learning
出版: (2003)

Finite termination of asynchronous iterative algorithms
出版: (2003)

Distributed asynchronous deterministic and stochastic gradient optimization algorithms
出版: (2002)

Convergence rate and termination of asynchronous iterative algorithms
出版: (2003)

Communication complexity of convex optimization
出版: (2003)

Dual coordinate ascent for problems with strictly convex costs and linear constraints : a unified approach
出版: (2003)

The auction algorithm for assignment and other network flow problems
出版: (2003)

The auction algorithm for the minimum cost network flow problem
出版: (2003)

Parallel asynchronous label correcting methods for shortest paths
出版: (2003)

Convergence of asynchronous matrix iterations subject to diagonal dominance
出版: (2003)

On the use of random numbers in asynchronous simulation via rollback
出版: (2003)

Auction algorithms for network flow problems : a tutorial introduction
出版: (2003)

Dual coordinate ascent methods for linear network flow problems
出版: (2003)

Auction algorithms for network flow problems : a tutorial introduction
出版: (2003)

Mathematical equivalence of the auction algorithm for assignment and the e-relaxation (preflow-push) method for min cost flow
出版: (2003)

Relaxation methods for monotropic programs
出版: (2003)

Relaxation methods for linear programs
出版: (2003)

On the rate of convergence of a partially asynchronous gradient projection algorithm
出版: (2003)

A generic auction algorithm for the minimum cost network flow problem
出版: (2003)

Partial proximal minimization algorithms for convex programming
出版: (2003)