Abstract
An algorithm is developed for minimizing nonsmooth convex functions. This algorithm extends Elzinga–Moore cutting plane algorithm by enforcing the search of the next test point not too far from the previous ones, thus removing compactness assumption. Our method is to Elzinga–Moore’s algorithm what a proximal bundle method is to Kelley’s algorithm. Instead of lower approximations used in proximal bundle methods, the present approach is based on some objects regularizing translated functions of the objective function. We propose some variants and using some academic test problems, we conduct a numerical comparative study with Elzinga–Moore algorithm and two other well-known nonsmooth methods.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Babonneau, F., Beltran, C., Haurie, A., Tadonki, C., Vial, J.-Ph.: Proximal-ACCPM: a versatile oracle based optimization method. In: Kontoghiorghes, E.J., Gatu, C. (eds.) Optimization, Econometric and Financial Analysis, vol. 9. Advances in Computational Management Science, series (2007)
Ben Ameur W., Neto J. (2006) A constraint generation algorithm for large scale linear programs using multiple points separation. Math. Program. 107(3): 517–537
Ben Ameur W., Neto J. (2007) Acceleration of cutting plane and column generation algorithms: applications to network design. Networks 49(1): 3–17
Betrò B. (2004) An accelerated central cutting plane algorithm for linear semi-infinite programming. Math. Program. 101: 479–495
Boyd, S., Vandenberghe, L. (2004) Convex Optimization. Cambridge University Press, Cambridge
Correa R., Lemaréchal C. (1993) Convergence of some algorithms for convex minimization. Math. Program. 62: 261–275
Cheney E., Goldstein A. (1959) Newton’s method for convex programming and Tchebycheff approximations. Numeriche Mathematik 1: 253–268
Elzinga J., Moore T.G. (1975) A central cutting plane algorithm for the convex programming problem. Math. Program. 8: 134–145
Frangioni A. (1996) Solving semidefinite quadratic problems within nonsmooth optimization algorithms. Comput. OR 23(11): 1099–1118
Frangioni, A.: Dual-ascent Methods and Multicommodity Flow Problems Ph.D. Thesis. Università di Pisa, Italy (1997)
Frangioni A. (2002) Generalized bundle methods. SIAM J. Optim. 13(1): 117–156
Goffin J.-L., Vial J.-Ph. (2002) Convex nondifferentiable optimization: a survey focused on the analytic center cutting plane method. Optim. Methods Softw. 17(5): 805–867
Held M., Karp R.M. (1971) The traveling-salesman problem and minimum spanning trees: Part II. Math. Program. 1: 6–25
Helmberg C., Rendl F. (1999) A spectral bundle method for semidefinite programming. SIAM J. Optim. 10(3): 673–696
Hiriart-Urruty J.-B., Lemaréchal C. (1993) Convex Analysis and Minimization Algorithms. Springer, Berlin
Kelley J.E. (1960) The cutting plane method for solving convex programs. J. Soc. Ind. Appl. Math. 8: 703–712
Kiwiel K.C. (1983) An aggregate subgradient method for nonsmooth convex minimization. Math. Program. 27: 320–341
Kiwiel K.C. (1985) Methods of Descent for Nondifferentiable Optimization. Lecture Notes in Mathematics. Springer, Berlin
Kiwiel K.C. (1990) Proximity control in bundle methods for convex nondifferentiable minimization. Math. Program. 46(1): 105–122
Kiwiel K.C. (1994) A Cholesky dual method for proximal piecewise linear programming. Numerische Mathematik 68(3): 325–340
Kiwiel K.C. (1999) A bundle Bregman proximal method for convex nondifferentiable optimization. Math. Program. 85(2): 241–258
Lemaréchal C., Mifflin R. (1978) A set of nonsmooth optimization test problems. In: Lemaréchal C., Mifflin R.(eds) Nonsmooth Optimization. Pergamon Press, Oxford, pp 151–165
Lemaréchal C., Nemirovskii A., Nesterov Y. (1995) New variants of bundle methods. Math. Program. B 69(1): 111–147
Lemaréchal C., Sagastizábal C. (1997) Variable metric bundle methods: From conceptual to implementable forms. Math. Program. 76: 393–410
Lemaréchal, C.: Lagrangian relaxation. In: Juenger, M., Naddef, D. (eds.) Computational Combinatorial Optimization. Lecture Notes in Computer Science, vol. 2241, pp. 112–156. Springer, Berlin (2001)
Luks̆an, L., Vlc̆ek, J.: Test problems for nonsmooth unconstrained and linearly constrained optimization. Technical report 798, Institute of Computer Science, Academiy of Sciences of the Czech Republic, January (2000)
Nemhauser G.L., Widhelm W.B. (1971) A modified linear program for columnar methods in mathematical programming. Oper. Res. 19: 1051–1060
Nesterov Y. (1995) Complexity estimates of some cutting plane methods based on the analytic center. Math. Program. 69(1): 149–176
Nesterov Y. (2003) Introductory Lectures on Convex Programming: Basic Course. Kluwer, Dordrecht
Ouorou A. (2006) Robust capacity assignment in telecommunications. Comput. Manage. Sci. 3(4): 285–305
Ouorou, A.: A proximal cutting plane method using Chebychev center for nonsmooth convex optimization. Technical Report, Orange Labs, R&D (2005)
Ouorou, A.: Solving nonlinear multicommodity flow problems by the proximal Chebychev center cutting plane algorithm. Technical Report, Orange Labs, R&D (2007)
Petrou G., Lemaréchal C., Ouorou A. (2007) An approach to robust network design in telecommunications. RAIRO-Oper. Res. 41(4): 411–426
Rey P.A., Sagastizábal C. (2002) Dynamical adjustment of the prox-parameter in variable metric bundle methods. Optimization 51(2): 423–447
Schramm H., Zowe J. (1992) A version of the bundle idea for minimizing a nonsmooth function: conceptual ideas, convergence analysis, numerical results. SIAM J. Optim. 2(1): 121–152
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ouorou, A. A proximal cutting plane method using Chebychev center for nonsmooth convex optimization. Math. Program. 119, 239–271 (2009). https://doi.org/10.1007/s10107-008-0209-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-008-0209-x