VALIDATION OF ALGORITHMS FOR OPTIMAL ROUTING OF FLOW IN NETWORKS.

Dimitri Bertsekas; Eli Gafni; Kenneth S. Vastola

doi:10.1109/cdc.1978.267924

VALIDATION OF ALGORITHMS FOR OPTIMAL ROUTING OF FLOW IN NETWORKS.

Dimitri Bertsekas, Eli Gafni, Kenneth S. Vastola

Research output: Contribution to journal › Conference article › peer-review

5 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 language	English (US)
Pages (from-to)	220-227
Number of pages	8
Journal	Proceedings of the IEEE Conference on Decision and Control
DOIs	https://doi.org/10.1109/cdc.1978.267924
State	Published - 1978
Externally published	Yes
Event	Proc IEEE Conf Decis Control Incl Symp Adapt Processes 17th - San Diego, CA, USA Duration: Jan 10 1979 → Jan 12 1979

ASJC Scopus subject areas

Control and Systems Engineering
Modeling and Simulation
Control and Optimization

Access to Document

10.1109/cdc.1978.267924

Cite this

@article{dc0996c4b27f4288a4dfc93f579caf9f,

title = "VALIDATION OF ALGORITHMS FOR OPTIMAL ROUTING OF FLOW IN NETWORKS.",

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.",

author = "Dimitri Bertsekas and Eli Gafni and Vastola, {Kenneth S.}",

year = "1978",

doi = "10.1109/cdc.1978.267924",

language = "English (US)",

pages = "220--227",

journal = "Proceedings of the IEEE Conference on Decision and Control",

issn = "0191-2216",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "Proc IEEE Conf Decis Control Incl Symp Adapt Processes 17th ; Conference date: 10-01-1979 Through 12-01-1979",

}

TY - JOUR

T1 - VALIDATION OF ALGORITHMS FOR OPTIMAL ROUTING OF FLOW IN NETWORKS.

AU - Bertsekas, Dimitri

AU - Gafni, Eli

AU - Vastola, Kenneth S.

PY - 1978

Y1 - 1978

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0018046393&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0018046393&partnerID=8YFLogxK

U2 - 10.1109/cdc.1978.267924

DO - 10.1109/cdc.1978.267924

M3 - Conference article

AN - SCOPUS:0018046393

SN - 0191-2216

SP - 220

EP - 227

JO - Proceedings of the IEEE Conference on Decision and Control

JF - Proceedings of the IEEE Conference on Decision and Control

T2 - Proc IEEE Conf Decis Control Incl Symp Adapt Processes 17th

Y2 - 10 January 1979 through 12 January 1979

ER -

VALIDATION OF ALGORITHMS FOR OPTIMAL ROUTING OF FLOW IN NETWORKS.

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this