Distributed computation for linear programming problems satisfying certain diagonal dominance condition
Partial support provided by the National Science Foundation under grant NSF-ECS-8217668 Partially supported by NSERC of Canada under grant NSERC-U0505
Other Authors: | Tseng, Paul. |
---|---|
Language: | eng |
Published: |
Laboratory for Information and Decision Systems, Massachusetts Institute of Technology]
2003
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/2978 |
Similar Items
-
Convergence of asynchronous matrix iterations subject to diagonal dominance
Published: (2003) -
Distributed asynchronous relaxation methods for linear network flow problems
Published: (2003) -
The relaxation method for a special class of linear programming problems
Published: (2003) -
Stable linear approximations to dynamic programming for stochastic control problems with local transitions
Published: (2003) -
NP-hardness of some linear control design problems
Published: (2003)