Loading [a11y]/accessibility-menu.js
A dual interior-point distributed algorithm for large-scale data networks optimization | IEEE Conference Publication | IEEE Xplore

A dual interior-point distributed algorithm for large-scale data networks optimization


Abstract:

This paper proposes a specialized decomposition algorithm, which incorporates the interior-point method into an augmented Lagrangian decomposition technique, for optimizi...Show More

Abstract:

This paper proposes a specialized decomposition algorithm, which incorporates the interior-point method into an augmented Lagrangian decomposition technique, for optimizing the quality of service through a data network. We show that many routing or resource allocation problems from the network literature can be recast into separable problems for which our algorithm can be applied. The proposed algorithm is highly parallelizable and thus suitable for distributively solving large-scale network problems.
Date of Conference: 23-26 August 2009
Date Added to IEEE Xplore: 02 April 2015
Print ISBN:978-3-9524173-9-3
Conference Location: Budapest, Hungary

References

References is not available for this document.