By Topic

Exact convergence of a parallel textured algorithm for data network optimal routing problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
G. M. Huang ; Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA ; Wen-Lin Hsieh

In our earlier paper (1991), a textured decomposition based algorithm is developed to solve the optimal routing problem in data networks; a few examples were used to illustrate the speedup advantage and the convergence conditions for the textured algorithm to converge to a global minimum. The speedup advantage is investigated in Huang et al. (1993). However, the theoretical foundation is not provided. In this paper, we provide the foundation. First, we show that for any textured decomposition, the algorithm always converges to a stationary point, which may not be a global minimum. And then, we prove that if the conditions of the exact convergence theorem are satisfied, the textured algorithm will converge to a global minimum

Published in:

IEEE Transactions on Parallel and Distributed Systems  (Volume:6 ,  Issue: 11 )