The proximal Chebychev center cutting plane algorithm for convex additive functions

1. Babonneau, F., Vial, J.-P.: ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems. Math. Program. B 120(1), 179–210 (2009)

   Article  MathSciNet  MATH  Google Scholar 

2. Bacaud, L., Lemaréchal, C., Renaud, A., Sagastizábal, C.: Bundle methods in stochastic optimal power management: a disaggregated approach using preconditioners. Comput. Optim. Appl. 20, 227–244 (2001)

   Article  MathSciNet  MATH  Google Scholar 

3. Ben Ameur, W., Ouorou, A.: Mathematical models of the delay constrained routing problem. Algorithm. Oper. Res. 1(2), 94–103 (2006)

   MathSciNet  MATH  Google Scholar 

4. Bertsekas, D.P., Gallager, R.G.: Data Networks. Prentice-Hall, Englewood Cliffs (1987)

   Google Scholar 

5. Bertsekas, D.P., Tseng, P.: Partial proximal minimization algorithms for convex programming. SIAM J. Optim. 4(3), 551–572 (1994)

   Article  MathSciNet  MATH  Google Scholar 

6. Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)

   MATH  Google Scholar 

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

   Article  MathSciNet  MATH  Google Scholar 

8. Eckstein, J., Fukushima, M.: Some reformulations and applications of the alternating direction method of multipliers. In: Large Scale Optimization: State of the Art. Kluwer Academic Publishers B.V., The Netherlands, pp. 119–138 (1993)

9. Elzinga, J., Moore, T.G.: A central cutting plane algorithm for the convex programming problem. Math. Program. 8, 134–145 (1975)

   Article  MathSciNet  MATH  Google Scholar 

10. Emiel, G., Sagastizábal, C.: Incremental-like bundle methods with application to energy planning. Comput. Optim. Appl. 46, 305–332 (2010)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

12. Frangioni, A.: Dual-ascent methods and multicommodity flow problems. Ph.D. Thesis, Università di Pisa, Italy (1997)

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

    Article  MathSciNet  MATH  Google Scholar 

14. Frangioni, A., Gorgone, E.: Generalized bundle methods for sum-functions with “easy” components: applications to multicommodity network design. http://www.optimization-online.org/DB_HTML/2011/06/3049.html

15. Goffin, J.-L., Vial, J.-Ph.: Convex nondifferentiable optimization: a survey focused on the analytic center cutting plane method. Optim. Methods Softw. 17(5), 805–867 (2002)

    Google Scholar 

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

    Google Scholar 

17. Hijazi, H., Bonami, P., Cornuejols, G., Ouorou, A.: Mixed integer nonlinear programs featuring “on/off” constraints: convex analysis and applications. Comput. Optim. Appl. (to appear)

18. Hiriart-Urruty, J.-B., Lemaréchal, C.: Convex Analysis and Minimization Algorithms. Springer, Berlin (1993)

    Google Scholar 

19. Kelley, J.E.: The cutting plane method for solving convex programs. J. Soc. Ind. Appl. Math. 8, 703–712 (1960)

    Article  MathSciNet  Google Scholar 

20. Kelly, F.: Charging and rate control for elastic traffic. Eur. Trans. Telecommun. 8, 33–37 (1997)

    Article  Google Scholar 

21. Kiwiel, K.C.: Methods of descent for nondifferentiable optimization. Lecture Notes in Mathematics. Springer (1985)

22. Kiwiel, K.C.: Decomposition method of descent for minimizing the sum of convex nonsmooth functions. J. Optim. Theory Appl. 52(2), 255–271 (1987)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

24. Kiwiel, K.C.: A Cholesky dual method for proximal piecewise linear programming. Numerische Mathematik 68(3), 325–340 (1994)

    Article  MathSciNet  MATH  Google Scholar 

25. Kiwiel, K.C.: An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems. Math. Program. 130, 59–84 (2011)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

27. Lemaréchal, C., Ouorou, A., Petrou, G.: A bundle-type algorithm for routing in telecommunication data networks. Comput. Optim. Appl. 44(3), 385–409 (2009)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

29. Nedić, A., Bertsekas, D.: Incremental subgradient methods for nondifferentiable optimization. SIAM J. Optim. 12, 109–138 (2002)

    Google Scholar 

30. Ouorou, A., Mahey, P., Vial, J.-Ph.: A survey of algorithms for convex multicommodity flow problems. Manage. Sci. 46(1), 126–147 (2000)

    Google Scholar 

31. Ouorou, A.: A Proximal cutting plane method using Chebychev center for nonsmooth convex optimization. Math. Program. 119, 239–271 (2009)

    Article  MathSciNet  MATH  Google Scholar 

32. Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references