RELAXATION METHODS FOR NETWORK FLOW PROBLEMS WITH CONVEX ARC COSTS.

Dimitri P. Bertsekas, Patrick A. Hosein, Paul Tseng

Research output: Contribution to journalArticlepeer-review

67 Scopus citations

Abstract

We consider the standard single commodity network flow problem with both linear and strictly convex possibly nondifferentiable arc costs. For the case where all arc costs are strictly convex we study the convergence of a dual Gauss-Seidel type relaxation method that is well suited for parallel computation. We then extend this method to the case where some of the arc costs are linear. As a special case we recover a relaxation method for the linear minimum cost network flow problem proposed in D. P. Bertsekas and D. P. Bertsekas and P. Tseng.

Original languageEnglish (US)
Pages (from-to)l2l9-1243
JournalSIAM Journal on Control and Optimization
Volume25
Issue number5
DOIs
StatePublished - 1987
Externally publishedYes

ASJC Scopus subject areas

  • Control and Optimization
  • Applied Mathematics

Fingerprint Dive into the research topics of 'RELAXATION METHODS FOR NETWORK FLOW PROBLEMS WITH CONVEX ARC COSTS.'. Together they form a unique fingerprint.

Cite this