A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- 332 Downloads
In this paper, we develop a version of the bundle method to solve unconstrained difference of convex (DC) programming problems. It is assumed that a DC representation of the objective function is available. Our main idea is to utilize subgradients of both the first and second components in the DC representation. This subgradient information is gathered from some neighborhood of the current iteration point and it is used to build separately an approximation for each component in the DC representation. By combining these approximations we obtain a new nonconvex cutting plane model of the original objective function, which takes into account explicitly both the convex and the concave behavior of the objective function. We design the proximal bundle method for DC programming based on this new approach and prove the convergence of the method to an \(\varepsilon \)-critical point. The algorithm is tested using some academic test problems and the preliminary numerical results have shown the good performance of the new bundle method. An interesting fact is that the new algorithm finds nearly always the global solution in our test problems.
KeywordsNonsmooth optimization Nonconvex optimization Proximal bundle methods DC functions Cutting plane model
Mathematics Subject Classification90C26 49J52 65K05
We are thankful to the anonymous referees for their valuable comments. We would also like to acknowledge Professors M. Gaudioso and A. Fuduli for kindly providing us the codes of NCVX and NCVX-penalty methods. This work has been financially supported by the Jenny and Antti Wihuri Foundation, the Turku University Foundation, the University of Turku, the Academy of Finland (project number: 289500) and the Australian Research Council’s Discovery Projects funding scheme (project number: DP140103213).
- 18.Fuduli, A., Gaudioso, M., Nurminski, E.A.: A splitting bundle approach for non-smooth non-convex minimization. Optimization 64(5), 1131–1151 (2015)Google Scholar
- 21.Hiriart-Urruty, J.B.: From convex optimization to nonconvex optimization. Part I: Necessary and sufficient conditions for global optimality. Nonsmooth Optimization and Related Topics, Ettore Majorana International Sciences Series 43. Plenum Press (1988)Google Scholar
- 27.Kiwiel, K.C.: Methods of Descent for Nondifferentiable Optimization. Lecture Notes in Mathematics, vol. 1133. Springer, Berlin (1985)Google Scholar
- 33.Mäkelä, M.M.: Multiobjective proximal bundle method for nonconvex nonsmooth optimization: Fortran subroutine MPBNGC 2.0. Reports of the Department of Mathematical Information Technology, Series B. Scientific Computing B 13/2003, University of Jyväskylä, Jyväskylä (2003)Google Scholar
- 40.Toland, J.F.: On subdifferential calculus and duality in nonconvex optimization. Bull. Soc. Math. France, Mémoire 60, 173–180 (1979)Google Scholar