VALIDATION OF ALGORITHMS FOR OPTIMAL ROUTING OF FLOW IN NETWORKS.

Dimitri Bertsekas, Eli Gafni, Kenneth S. Vastola

Research output: Contribution to journalConference articlepeer-review

4 Scopus citations

Abstract

Computational results are given relating to solution of convex multicommodity network flow problems by using several recently developed optimization algorithms. These algorithms are based on the ideas of Gallager's method for distributed optimization of delay in data communication networks and gradient projection ideas from nonlinear programming. They can be used both with and without a line search. An important common feature of the algorithms which distinguishes them from other existing methods is that they utilize second derivatives and are geared towards approximating a constrained version of Newton's method.

Original languageEnglish (US)
Pages (from-to)220-227
Number of pages8
JournalProceedings of the IEEE Conference on Decision and Control
DOIs
StatePublished - 1978
Externally publishedYes
EventProc IEEE Conf Decis Control Incl Symp Adapt Processes 17th - San Diego, CA, USA
Duration: Jan 10 1979Jan 12 1979

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Fingerprint Dive into the research topics of 'VALIDATION OF ALGORITHMS FOR OPTIMAL ROUTING OF FLOW IN NETWORKS.'. Together they form a unique fingerprint.

Cite this