Generalized bundle methods

SIAM Journal on Optimization

Volumn 13, Issue 1, 2003, Pages 117-156

  Frangioni, Antonio ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Bundle methods; Nondifferentiable optimization

Indexed keywords

EID: 0037289034     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623498342186     Document Type: Article

References (37)

1. [Au87] A. AUSLENDER, Numerical methods for nondifferentiable convex optimization, Math. Program. Study, 30 (1987), pp. 102-126.
2. [Au97] A. AUSLENDER, How to deal with the unbounded in optimization: Theory and algorithms, Math. Programming, 79 (1997), pp. 3-18.
3. [ACC93] A. AUSLENDER, R. COMINETTI, AND J.-P. CROUZEIX: Convex functions with unbounded level sets and applications to duality theory, SIAM J. Optim., 3 (1993), pp. 669-687.
4. [Be96] C. BERGER, Contribution à l'Optimisation Non-Différentiable et à la Décomposition en Programmation Mathématique, Ph.D. Thesis, Département de Mathématiques et de Génie Industriel, École Polytechnique de Montreal, Montreal, QC, Canada, 1996.
5. [BPP91] M. BOUGEARD, J.-P. PENOT, AND A. POMMELET, Towards minimal assumptions for the infimal convolution regularization, J. Approx. Theory, 64 (1991), pp. 245-270.
6. [GL93] R. CORREA AND C. LEMARÉCHAL, Convergence of some algorithms for convex minimization, Math. Programming, 62 (1993), pp. 261-275.
7. [CT93] G. CHEN AND M. TEBOULLE, Convergence analysis of a proximal-like minimization algorithm using Bregman functions, SIAM J. Optim., 3 (1993), pp. 538-543.
8. [CFC01] T.G. CRAINIC, A. FRANGIONI, AND B. GENDRON, Bundle-based relaxation methods for multieommodity eapacitated fixed charge network design problems, Discrete Appl. Math., 112 (2001), pp. 73-99.
9. [Ec93] J. ECKSTEIN, Nonlinear proximal point algorithms using Bregman functions with applications to convex programming, Math. Oper. Res., 18 (1993), pp. 292-226.
10. [Fr96] A. FRANGIONI, Solving semidefinite quadratic problems within nonsmooth optimization algorithms, Comput. Oper. Res., 23 (1996), pp. 1099-1118.
11. [Fr97] A. FRANGIONI, Dual Ascent Methods and Multicommodity Flow Problems, Ph.D. Dissertation, TD 5/97, Dipartimento di Informatica, Università di Pisa, Pisa, Italy, 1997.
12. [Fr98] A. FRANGIONI, Generalized Bundle Methods, Technical report TR 04/98, Dipartimento di Informatica, Università di Pisa, Pisa, Italy, 1998.
13. [Fu98] A. FUDULI, Metodi Numerici per la Minimizzazione di Funzioni Convesse NonDifferenziabili, Ph.D. Thesis, DEIS, Università della Calabria, Calabria, Italy, 1998.
14. [GK95] M.D. GRIGORIADIS AND L. G. KAHCHIYAN, An exponential-function reduction method for block-angular convex programs, Networks, 26 (1995), pp. 59-68.
15. [GM91] M. GAUDIOSO AND M. F. MONACO, Quadratic approximations in convex nondifferentiable optimization, SIAM J. Control Optim., 29 (1991), pp. 58-70.
16. [GV97] J. GONDZIO AND J.-P. VIAL, Warm Start and ε-Subgradients in Cutting Plane Scheme for Block-angular Linear Programs, Logilab Technical report, 1997.1, Paris, France, 1997.
17. [HL93a] J.-B. HIRIART-URRUTY AND C. LEMARÉCHAL, Convex Analysis and Minimization Algorithms I-Fundamentals, Grundlehren Math. Wiss. 305, Springer-Verlag, New York, 1993.
18. [HL93b] J.-B. HIRIART-URRUTY AND C. LEMARÉCHAL, Convex Analysis and Minimization Algorithms II-Advanced Theory and Bundle Methods, Grundlehren Math. Wiss. 306, Springer-Verlag, New York, 1993.
19. [IST94] A.N. IUSEM, B. F. SVAITER, AND M. TEBOULLE, Entropy-like proximal methods in convex programming, Math. Oper. Res., 19 (1994), pp. 790-814.
20. [IT95] A.N. IUSEM AND M. TEBOULLE, Convergence rate analysis of nonquadratic proximal methods for convex and linear programming, Math. Oper. Res., 20 (1994), pp. 657-677.
21. [Ki89] K.C. KIWlEL, A dual method for certain positive semidefinite quadratic programming problems, SIAM J. Sci. Statist. Comput., 10 (1989), pp. 175-186.
22. [Ki95] K.C. KIWIEL, Approximations in proximal bundle methods and decomposition of convex programs, J. Optim. Theory Appl., 84 (1997), pp. 529-548.
23. [Ki98] K. KIWIEL, Proximal minimization methods with generalized Bregman functions, SIAM J. Control Optim., 35 (1997), pp. 1142-1168.
24. [Ki99] K. KIWIEL, A bundle Bregman proximal method for convex nondifferentiable optimization, Math. Program., 85 (1999), pp. 241-258.
25. [KCL95] S. KIM, K. N. CHANG, AND J. Y. LEE, A descent method with linear programming subproblems for nondifferentiable convex optimization, Math. Programming, 71 (1995), pp. 17-28.
26. [LNN95] C. LEMARÉCHAL, A. NEMIROVSKII, AND Y. NESTEROV, New variants of bundle methods, Math. Programming, 69 (1995), pp. 111-147.
27. [LS98] C. LEMARÉCHAL AND C. SAGASTIZÀBAL, Variable metric bundle methods: From conceptual to implementable forms, Math. Programming, 16 (1997), pp. 393-410.
28. [LV98] L. LUKSAN AND J. VLCEK, A bundle-Newton method for nonsmooth unconstrained optimization, Math. Programming, 83 (1998), pp. 373-391.
29. [MSQ98] R. MIFFLIN, D. SUN, AND L. QI, Quasi-Newton bundle-type methods for nondifferentiable convex optimization, SIAM J. Optim., 8 (1998), pp. 583-603.
30. [Ne95] Y. NESTEROV, Complexity estimates of some cutting plane methods based on the analytic barrier, Math. Programming, 69 (1995), pp. 149-176.
31. [Nu97] E.A. NURMINSKI, Separating plane algorithms for convex optimization, Math. Programming, 76 (1997), pp. 373-391.
32. [OR70] J.M. ORTEGA AND W. C. RHEINBOLDT, Iterative Solutions of Nonlinear Equations in Several Variables, Academic Press, New York, 1970.
33. [PZ92] M.C. PINAR AND S. A. ZENIOS, Parallel decomposition of multicommodity network flows using a linear-quadratic penalty algorithm, ORSA J. Comput., 4 (1992), pp. 235-248.
34. [PZ94] M.C. PINAR AND S. A. ZENIOS, On smoothing exact penalty functions for convex constrained optimization, SIAM J. Optim., 4 (1994), pp. 486-511.
35. [Ro70] R.T. ROCKAFELLAR., Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
36. [SZ92] H. SCHRAMM AND J. ZOWE, A version of the bundle idea for minimizing a nonsmooth function: Conceptual idea, convergence analysis, numerical results, SIAM J. Optim, 2 (1992), pp. 121-152.
37. [Te97] M. TEBOULLE, Convergence of proximal-like algorithms, SIAM J. Optim., 7 (1997), pp. 1069-1083.