Implementing a proximal algorithm for some nonlinear multicommodity flow problems

Networks

Volumn 49, Issue 1, 2007, Pages 18-27

  Ouorou, Adam ^a  

^a ORANGE LABS   (France)

Author keywords

Convex programming; Large scale methods; Network optimization

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; FEATURE EXTRACTION; LARGE SCALE SYSTEMS; NUMERICAL METHODS; OPTIMIZATION; PROBLEM SOLVING;

CONVEX PROGRAMMING; MARTINET'S PROXIMAL ALGORITHM; MULTICOMMODITY FLOW PROBLEMS; NETWORK OPTIMIZATION; NONLINEAR MULTICOMMODITY FLOW;

SYSTEMS ANALYSIS;

EID: 33947593380     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20138     Document Type: Conference Paper

References (16)

1. D.P. Bertsekas and R.G. Gallager, Data networks, Prentice-Hall, Englewood Cliffs, NJ, 1987.
2. J. Castro, PPRN 1.0 user's guide, Statistics and Operations Research Department, Universitat Politechnica de Catalunya, Barcelona, Spain, 1994 (available from http://www-eio.upc.es/personnel/homepages/jcastro/).
3. J. Castro, A specialized interior-point algorithm for multicommodity network flows, SIAM J Optimizat 10 (2000), 852-877.
4. J. Castro, "Solving quadratic multicommodity problems through an interior-point algorithm," System modelling and optimization XX, E.W. Sachs and R. Tichatschke (Editors), Kluwer, Boston, 2003, pp. 199-212.
5. J. Castro and N. Nabona, An implementation of linear and nonlinear multicommodity network flows, Eur J Oper Res 92 (1996), 37-53.
6. J.-C. Gilbert and C. Lemaréchal, Some numerical experiments with variable storage quasi-Newton algorithms, Math Program 45 (1989), 407-435.
7. J. Gondzio, Implementing Cholesky factorization for interior point methods for linear programming, Optimization 27 (1993), 121-140.
8. B. Martinet, Régularisation d'inéquations variationnelles par approximations successives, Rev Fr Informat Recher Opér 3 (1970), 154-179.
9. H. Nagamochi, Studies on multicommodity flows in directed networks, Ph.D. Thesis, Kyoto University, Japan, 1998.
10. J. Nocedal, Updating quasi-Newton matrices with limited storage, Math Comput 35 (1980), 773-782.
11. A. Ouorou, A primal-dual algorithm for monotropic programming and its application to network optimization, Comput Optimizat Appl 15 (2000), 125-143.
12. A. Ouorou, P. Mahey, and J.-Ph. Vial, A survey of algorithms for convex multicommodity flow problems, Manage Sci 46 (2000), 126-147.
13. A. Ouorou, A proximal subgradient projection algorithm for linearly constrained strictly convex problems, France Télécom R&D Technical Report NT/FTR&D/7076, Optimization Methods and Software, to appear.
14. R.T. Rockafellar, Monotone operators and the proximal point algorithm, SIAM J Control Optimizat 14 (1976), 877-898.
15. J.B. Rosen, The gradient projection method for nonlinear programming, Part I: Linear constraints, J Soc Indust Appl Math 8 (1960), 181-217.
16. T.E. Stern, A class of decentralized routing algorithms using relaxation, IEEE Trans Commun 25 (1977), 1092-1102.