TIME-COMPLEXITY OF A PATH FORMULATED OPTIMAL ROUTING ALGORITHM (2ND PRINTING) Academic Article

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. 1994 IEEE

authors

• Huang, Garng

published proceedings

• IEEE TRANSACTIONS ON AUTOMATIC CONTROL

author list (cited authors)

• ANTONIO, J. K., TSAI, W. K., & HUANG, G. M.

citation count

• 4

complete list of authors

• ANTONIO, JK||TSAI, WK||HUANG, GM

publication date

• January 1994

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE Transactions on Automatic Control  Journal

Digital Object Identifier (DOI)

• 10.1109/9.317108

start page

• 1839

end page

• 1844

volume

• 39

issue

• 9

URL

• http://dx.doi.org/10.1109/9.317108