Treffer: Implementing a proximal algorithm for some nonlinear multicommodity flow problems

Title:
Implementing a proximal algorithm for some nonlinear multicommodity flow problems
Authors:
OUOROU, Adam
Source:
Multicommodity flows and network designNetworks (New York, NY). 49(1):18-27
Publisher Information:
New York, NY: John Wiley & Sons, 2007.
Publication Year:
2007
Physical Description:
print, 16 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Systèmes informatiques et systèmes répartis. Interface utilisateur, Computer systems and distributed systems. User interface, Algorithme parallèle, Parallel algorithm, Algoritmo paralelo, Gestion réseau, Network management, Gestión red, Matrice incidence, Incidence matrix, Matriz incidencia, Point col, Saddle point, Punto silla, Problème multiflot, Multicommodity flow problem, Problema multiflujo, Problème non linéaire, Nonlinear problems, Programmation convexe, Convex programming, Programación convexa, Routage, Routing, Enrutamiento, Télécommunication, Telecommunication, Telecomunicación, convex programming, large- scale methods, network optimization
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
France Telecom Division R&D, CORE/MCN, 38-40 rue du Général Leclerc, 92794 Issy-Les-Moulineaux, France
ISSN:
0028-3045
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=18405623
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.18405623
Database:
PASCAL Archive

Weitere Informationen

In this article, we consider applying a proximal algorithm introduced by Ouorou to some convex multicommodity network flow minimization problems. This algorithm follows the characterization of saddle points introduced earlier but can be derived from Martinet's proximal algorithm. In the primal space, the algorithm can be viewed as a regularized version of the projection algorithm by Rosen. A remarkable feature of the algorithm is that the projection step for multicommodity flow problems reduces to solving independent linear systems (one for each commodity) involving the node-arc incidence matrix of the network. The algorithm is therefore amenable to parallel implementation. We present some numerical results on large-scale routing problems arising in telecommunications and quadratic multicommodity flow problems. A comparison with a specialized code for multicommodity flow problems indicates that this proximal algorithm is specially designed for very large-scale instances.