Time Complexity of a Path Formulated Optimal Routing Algorithm (Second Printing)

John K. Antonio, Wei K. Tsai, Garng Morton Huang

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

A detailed analysis of convergence rate is presented for an iterative path formulated optimal routing algorithm. In particular, it is quantified, analytically, how the convergence rate changes as the number of nodes in the underlying graph increases. The analysis is motivated by a particular path formulated gradient projection algorithm that has demonstrated excellent convergence rate properties through extensive numerical studies. The analytical result proven in this note is that the number of iterations for convergence depends on the number of nodes only through the network diameter.

Original languageEnglish
Pages (from-to)1839-1844
Number of pages6
JournalIEEE Transactions on Automatic Control
Volume39
Issue number9
DOIs
Publication statusPublished - 1 Jan 1994
Externally publishedYes

Fingerprint

Routing algorithms
Printing

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

Time Complexity of a Path Formulated Optimal Routing Algorithm (Second Printing). / Antonio, John K.; Tsai, Wei K.; Huang, Garng Morton.

In: IEEE Transactions on Automatic Control, Vol. 39, No. 9, 01.01.1994, p. 1839-1844.

Research output: Contribution to journalArticle

@article{91d38154ee654f838d00bfe6521c729d,
title = "Time Complexity of a Path Formulated Optimal Routing Algorithm (Second Printing)",
abstract = "A detailed analysis of convergence rate is presented for an iterative path formulated optimal routing algorithm. In particular, it is quantified, analytically, how the convergence rate changes as the number of nodes in the underlying graph increases. The analysis is motivated by a particular path formulated gradient projection algorithm that has demonstrated excellent convergence rate properties through extensive numerical studies. The analytical result proven in this note is that the number of iterations for convergence depends on the number of nodes only through the network diameter.",
author = "Antonio, {John K.} and Tsai, {Wei K.} and Huang, {Garng Morton}",
year = "1994",
month = "1",
day = "1",
doi = "10.1109/9.317108",
language = "English",
volume = "39",
pages = "1839--1844",
journal = "IEEE Transactions on Automatic Control",
issn = "0018-9286",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",

}

TY - JOUR

T1 - Time Complexity of a Path Formulated Optimal Routing Algorithm (Second Printing)

AU - Antonio, John K.

AU - Tsai, Wei K.

AU - Huang, Garng Morton

PY - 1994/1/1

Y1 - 1994/1/1

N2 - A detailed analysis of convergence rate is presented for an iterative path formulated optimal routing algorithm. In particular, it is quantified, analytically, how the convergence rate changes as the number of nodes in the underlying graph increases. The analysis is motivated by a particular path formulated gradient projection algorithm that has demonstrated excellent convergence rate properties through extensive numerical studies. The analytical result proven in this note is that the number of iterations for convergence depends on the number of nodes only through the network diameter.

AB - A detailed analysis of convergence rate is presented for an iterative path formulated optimal routing algorithm. In particular, it is quantified, analytically, how the convergence rate changes as the number of nodes in the underlying graph increases. The analysis is motivated by a particular path formulated gradient projection algorithm that has demonstrated excellent convergence rate properties through extensive numerical studies. The analytical result proven in this note is that the number of iterations for convergence depends on the number of nodes only through the network diameter.

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

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

U2 - 10.1109/9.317108

DO - 10.1109/9.317108

M3 - Article

VL - 39

SP - 1839

EP - 1844

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

SN - 0018-9286

IS - 9

ER -