EXACT CONVERGENCE OF A PARALLEL TEXTURED ALGORITHM FOR DATA NETWORK OPTIMAL ROUTING-PROBLEMS

abstract

• In our earlier paper [1], 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 [2]. 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. 1995 IEEE

authors

• Huang, Garng

published proceedings

• IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS

author list (cited authors)

• HUANG, G. M., & HSIEH, W. L.

citation count

• 5

complete list of authors

• HUANG, GM||HSIEH, WL

publication date

• January 1995

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE Transactions on Parallel and Distributed Systems  Journal

keywords

• Exact Convergence
• Kuhn-tucker Theorem
• Optimal Routing
• Parallel Processing
• Textured Algorithm

Digital Object Identifier (DOI)

• 10.1109/71.476185

start page

• 1132

end page

• 1146

volume

• 6

issue

• 11

URL

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