Deriving time complexities for a class of distributed gradient projection-based optimal routing algorithms

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

Research output: Contribution to journalConference article

Abstract

An upper bound is derived for the time complexity of the gradient projection-based optimal routing algorithm of D. P. Bertsekas et al. (MIT Tech. Rep. LIDS-P-1364, Feb. 1984). The overall time complexity of the algorithm is given by the product of the complexity of each iteration and the complexity of the number of iterations needed to converge. It turns out that the complexity of each iteration is dominated by the time required to solve shortest path problems, and is therefore straightforward to estimate. On the other hand, estimating a meaningful bound for the number of iterations needed for convergence presents a formidable challenge, and is therefore the main focus of this study. Classical results related to convergence rates of gradient projection-type algorithms require precise knowledge of the spectral content of Hessian matrix. Unfortunately, such classical techniques are not readily applicable to the problem at hand since the eigenvalues of the Hessian depend on factors such as network topology and traffic demand patterns in a very non-tractable way. In this paper, an alternate analysis technique is developed which yields an upper bound for the number of iterations needed for convergence to within a small neighborhood of the optimal solution.

Original languageEnglish
Pages (from-to)931-936
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
Volume2
Publication statusPublished - 1 Dec 1990
Externally publishedYes

Fingerprint

Gradient Projection
Routing algorithms
Routing Algorithm
Optimal Algorithm
Time Complexity
Iteration
Topology
Upper bound
Hessian matrix
Shortest Path Problem
Network Traffic
Network Topology
Alternate
Rate of Convergence
Optimal Solution
Class
Eigenvalue
Converge
Estimate

ASJC Scopus subject areas

  • Chemical Health and Safety
  • Control and Systems Engineering
  • Safety, Risk, Reliability and Quality

Cite this

Deriving time complexities for a class of distributed gradient projection-based optimal routing algorithms. / Antonio, John K.; Huang, Garng Morton; Tsai, Wei K.

In: Proceedings of the IEEE Conference on Decision and Control, Vol. 2, 01.12.1990, p. 931-936.

Research output: Contribution to journalConference article

@article{32fe68f72fbd42f8b7442a6fd0a6ffcd,
title = "Deriving time complexities for a class of distributed gradient projection-based optimal routing algorithms",
abstract = "An upper bound is derived for the time complexity of the gradient projection-based optimal routing algorithm of D. P. Bertsekas et al. (MIT Tech. Rep. LIDS-P-1364, Feb. 1984). The overall time complexity of the algorithm is given by the product of the complexity of each iteration and the complexity of the number of iterations needed to converge. It turns out that the complexity of each iteration is dominated by the time required to solve shortest path problems, and is therefore straightforward to estimate. On the other hand, estimating a meaningful bound for the number of iterations needed for convergence presents a formidable challenge, and is therefore the main focus of this study. Classical results related to convergence rates of gradient projection-type algorithms require precise knowledge of the spectral content of Hessian matrix. Unfortunately, such classical techniques are not readily applicable to the problem at hand since the eigenvalues of the Hessian depend on factors such as network topology and traffic demand patterns in a very non-tractable way. In this paper, an alternate analysis technique is developed which yields an upper bound for the number of iterations needed for convergence to within a small neighborhood of the optimal solution.",
author = "Antonio, {John K.} and Huang, {Garng Morton} and Tsai, {Wei K.}",
year = "1990",
month = "12",
day = "1",
language = "English",
volume = "2",
pages = "931--936",
journal = "Proceedings of the IEEE Conference on Decision and Control",
issn = "0191-2216",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Deriving time complexities for a class of distributed gradient projection-based optimal routing algorithms

AU - Antonio, John K.

AU - Huang, Garng Morton

AU - Tsai, Wei K.

PY - 1990/12/1

Y1 - 1990/12/1

N2 - An upper bound is derived for the time complexity of the gradient projection-based optimal routing algorithm of D. P. Bertsekas et al. (MIT Tech. Rep. LIDS-P-1364, Feb. 1984). The overall time complexity of the algorithm is given by the product of the complexity of each iteration and the complexity of the number of iterations needed to converge. It turns out that the complexity of each iteration is dominated by the time required to solve shortest path problems, and is therefore straightforward to estimate. On the other hand, estimating a meaningful bound for the number of iterations needed for convergence presents a formidable challenge, and is therefore the main focus of this study. Classical results related to convergence rates of gradient projection-type algorithms require precise knowledge of the spectral content of Hessian matrix. Unfortunately, such classical techniques are not readily applicable to the problem at hand since the eigenvalues of the Hessian depend on factors such as network topology and traffic demand patterns in a very non-tractable way. In this paper, an alternate analysis technique is developed which yields an upper bound for the number of iterations needed for convergence to within a small neighborhood of the optimal solution.

AB - An upper bound is derived for the time complexity of the gradient projection-based optimal routing algorithm of D. P. Bertsekas et al. (MIT Tech. Rep. LIDS-P-1364, Feb. 1984). The overall time complexity of the algorithm is given by the product of the complexity of each iteration and the complexity of the number of iterations needed to converge. It turns out that the complexity of each iteration is dominated by the time required to solve shortest path problems, and is therefore straightforward to estimate. On the other hand, estimating a meaningful bound for the number of iterations needed for convergence presents a formidable challenge, and is therefore the main focus of this study. Classical results related to convergence rates of gradient projection-type algorithms require precise knowledge of the spectral content of Hessian matrix. Unfortunately, such classical techniques are not readily applicable to the problem at hand since the eigenvalues of the Hessian depend on factors such as network topology and traffic demand patterns in a very non-tractable way. In this paper, an alternate analysis technique is developed which yields an upper bound for the number of iterations needed for convergence to within a small neighborhood of the optimal solution.

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

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

M3 - Conference article

VL - 2

SP - 931

EP - 936

JO - Proceedings of the IEEE Conference on Decision and Control

JF - Proceedings of the IEEE Conference on Decision and Control

SN - 0191-2216

ER -