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

John K. Antonio, Wei K. Tsai, G. M. 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 - Sep 1994

    Fingerprint

ASJC Scopus subject areas

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

Cite this