Skip to main content
SpringerLink
Log in

A bundle-type algorithm for routing in telecommunication data networks

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

To optimize the quality of service through a telecommunication network, we propose an algorithm based on Lagrangian relaxation. The bundle-type dual algorithm is adapted to the present situation, where the dual function is the sum of a polyhedral function (coming from shortest path problems) and of a smooth function (coming from the congestion function).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Babonneau, F., Vial, J.P.: Proximal-accpm with a nonlinear constraint and active set strategy to solve nonlinear multicommodity flow problems. Math. Program. (2008). DOI 10.1007/s10107-007-0151-3

    Google Scholar 

  2. Bertsekas, D., Gafni, E.M.: Two-metric projection methods for constrained optimization. SIAM J. Control Optim. 22, 936–964 (1983)

    MathSciNet  Google Scholar 

  3. Cheney, E., Goldstein, A.: Newton’s method for convex programming and Tchebycheff approximations. Numer. Math. 1, 253–268 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  4. Frangioni, A.: Solving semidefinite quadratic problems within nonsmooth optimization algorithms. Comput. Oper. Res. 23(11), 1099–1118 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  5. Frangioni, A.: Generalized bundle methods. SIAM J. Optim. 13(1), 117–156 (2003)

    Article  MathSciNet  Google Scholar 

  6. Frank, M., Wolfe, P.: An algorithm for quadratic programming. Naval Res. Logist. Q. 3, 95–110 (1956)

    Article  MathSciNet  Google Scholar 

  7. Fukushima, M.: A nonsmooth optimization approach to nonlinear multicommodity network flow problems. J. Oper. Res. Soc. Jpn. 27(2), 151–176 (1984)

    MATH  MathSciNet  Google Scholar 

  8. Gerla, M., Fratta, L., Kleinrock, L.: The flow deviation method: an approach to store-and-forward communication network design. Networks 3, 97–133 (1984)

    MathSciNet  Google Scholar 

  9. Goffin, J.-L.: The ellipsoid method and its predecessors. In: Contesse, L., Correa, R., Weintraub, A. (eds.) Recent Advances in System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol. 87. Springer, Berlin (1984)

    Google Scholar 

  10. Goffin, J.-L., Gondzio, J., Sarkissian, R., Vial, J.-P.: Solving nonlinear multicommodity flow problems by the analytic center cutting plane method. Math. Program. 76, 131–154 (1997)

    MathSciNet  Google Scholar 

  11. Hiriart-Urruty, J.-B., Lemaréchal, C.: Convex Analysis and Minimization Algorithms. Springer, Heidelberg (1993). Two volumes

    Google Scholar 

  12. Kelley, J.E.: The cutting plane method for solving convex programs. J. SIAM 8, 703–712 (1960)

    MathSciNet  Google Scholar 

  13. Kiwiel, K.C.: A dual method for certain positive semidefinite quadratic programming problems. SIAM J. Sci. Stat. Comput. 10(1), 175–186 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  14. Kiwiel, K.C.: Proximity control in bundle methods for convex nondifferentiable minimization. Math. Program. 46(1), 105–122 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  15. Kiwiel, K.C.: A Cholesky dual method for proximal piecewise linear programming. Numer. Math. 68, 325–340 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  16. Kiwiel, K.C., Larsson, T., Lindberg, P.O.: Lagrangian relaxation via ballstep subgradient methods. Math. Oper. Res. 32(3), 669–686 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  17. Lemaréchal, C.: Lagrangian relaxation. In: Jünger, M., Naddef, D. (eds.) Computational Combinatorial Optimization, pp. 112–156. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  18. Lemaréchal, C., Sagastizábal, C.: Variable metric bundle methods: from conceptual to implementable forms. Math. Program. 76(3), 393–410 (1997)

    Article  Google Scholar 

  19. Lemaréchal, C., Strodiot, J.-J., Bihain, A.: On a bundle method for nonsmooth optimization. In: Mangasarian, O.L., Meyer, R.R., Robinson, S.M. (eds.) Nonlinear Programming, vol. 4, pp. 245–282. Academic Press, New York (1981)

    Google Scholar 

  20. Lemaréchal, C., Nemirovskii, A.S., Nesterov, Y.E.: New variants of bundle methods. Math. Program. 69, 111–148 (1995)

    Article  Google Scholar 

  21. Mahey, P., Ouorou, A., LeBlanc, L., Chifflet, J.: A new proximal decomposition algorithm for routing in telecommunication networks. Networks 31, 227–238 (1998)

    Article  MATH  Google Scholar 

  22. McBride, R.D.: Advances in solving the multicommodity-flow problem. Interfaces 28(2), 32–41 (1998)

    Article  Google Scholar 

  23. Moré, J.J.: Recent developments in algorithms and software for trust region methods. In: Bachem, A., Grötschel, M., Korte, B. (eds.) Mathematical Programming, the State of the Art, pp. 258–287. Springer, Berlin (1983)

    Google Scholar 

  24. Ouorou, A., Mahey, P., Vial, J.-P.: A survey of algorithms for convex multicommodity flow problems. Manag. Sci. 47(1), 126–147 (2000)

    Article  Google Scholar 

  25. Pinar, M.C., Zenios, S.A.: Parallel decomposition of multicommodity network flows using a linear-quadratic penalty algorithm. ORSA J. Comput. 4(3), 235–249 (1992)

    MATH  MathSciNet  Google Scholar 

  26. Schramm, H., Zowe, J.: A version of the bundle idea for minimizing a nonsmooth function: conceptual idea, convergence analysis, numerical results. SIAM J. Optim. 2(1), 121–152 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  27. Schultz, G.L., Meyer, R.R.: An interior point method for block angular optimization. SIAM J. Optim. 1(4), 583–602 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  28. Wolfe, P.: Convergence theory in nonlinear programming. In: Abadie, J. (ed.) Integer and Nonlinear Programming, pp. 1–36. North-Holland, Amsterdam (1970)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA Rhônes-Alpes, 655 avenue de l’Europe, Montbonnot, 38334 Saint Ismier, France

    Claude Lemaréchal

  2. France Telecom R&D, CORE/MCN, 38-40 rue du Général Leclerc, 92794, Issy-Les-Moulineaux cedex 9, France

    Adam Ouorou

  3. EDF R&D, Osiris, 1 av. du Général de Gaulle, 92141, Clamart, France

    Georgios Petrou

Authors
  1. Claude Lemaréchal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Adam Ouorou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Georgios Petrou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Claude Lemaréchal.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lemaréchal, C., Ouorou, A. & Petrou, G. A bundle-type algorithm for routing in telecommunication data networks. Comput Optim Appl 44, 385–409 (2009). https://doi.org/10.1007/s10589-007-9160-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-007-9160-7

Keywords

Search

Navigation