Skip to Main content Skip to Navigation
Conference papers

Parallel Asynchronous Modified Newton Methods for Network Flows

Didier El Baz 1 Moussa Elkihel 1
1 LAAS-CDA - Équipe Calcul Distribué et Asynchronisme
LAAS - Laboratoire d'analyse et d'architecture des systèmes
Abstract : We consider single commodity strictly convex network flow problems. The dual problem is unconstrained, differentiable and well suited for solution via parallel iterative methods. We propose and prove convergence of parallel asynchronous modified Newton algorithms for solving the dual problem. Parallel asynchronous Newton multisplitting algorithms are also considered, their convergence is also shown. A first set of computational results is presented and analyzed.
Complete list of metadata
Contributor : Didier El Baz <>
Submitted on : Tuesday, April 30, 2019 - 3:43:48 PM
Last modification on : Thursday, June 10, 2021 - 3:01:38 AM


Files produced by the author(s)



Didier El Baz, Moussa Elkihel. Parallel Asynchronous Modified Newton Methods for Network Flows. IEEE International Parallel and Distributed Processing Symposium Workshop (IPDPSW 2015), May 2015, Hyderabad, India. pp.1135-1142, ⟨10.1109/IPDPSW.2015.34⟩. ⟨hal-02115940⟩



Record views


Files downloads