A cutting plane and level stabilization bundle method with inexact data for minimizing nonsmooth nonconvex functions. (English) Zbl 1470.90160

Summary: Under the condition that the values of the objective function and its subgradient are computed approximately, we introduce a cutting plane and level bundle method for minimizing nonsmooth nonconvex functions by combining cutting plane method with the ideas of proximity control and level constraint. The proposed algorithm is based on the construction of both a lower and an upper polyhedral approximation model to the objective function and calculates new iteration points by solving a subproblem in which the model is employed not only in the objective function but also in the constraints. Compared with other proximal bundle methods, the new variant updates the lower bound of the optimal value, providing an additional useful stopping test based on the optimality gap. Another merit is that our algorithm makes a distinction between affine pieces that exhibit a convex or a concave behavior relative to the current iterate. Convergence to some kind of stationarity point is proved under some looser conditions.


90C56 Derivative-free methods and methods using generalized derivatives
90C26 Nonconvex programming, global optimization
90C25 Convex programming
Full Text: DOI


[1] Cheney, E. W.; Goldstein, A. A., Newton’s method for convex programming and Tchebycheff approximation, Numerische Mathematik, 1, 253-268 (1959) · Zbl 0113.10703
[2] Kelley,, J. E., The cutting-plane method for solving convex programs, Journal of the Society for Industrial and Applied Mathematics, 8, 703-712 (1960) · Zbl 0098.12104
[3] Fuduli, A.; Gaudioso, M.; Giallombardo, G., Minimizing nonconvex nonsmooth functions via cutting planes and proximity control, SIAM Journal on Optimization, 14, 3, 743-756 (2003) · Zbl 1079.90105
[4] Brannlund, U., On relaxation methods for nonsmooth convex optimization [Ph.D. thesis] (1993), Stockholm, Sweden: Department of Mathematics, Royal Institute of Technology, Stockholm, Sweden
[5] Lemaréchal, C.; Nemirovskii, A.; Nesterov, Y., New variants of bundle methods, Mathematical Programming, 69, 1, 111-147 (1995) · Zbl 0857.90102
[6] de Oliveira, W.; Solodov, M., A doubly stabilized bundle method for nonsmooth convex optimization · Zbl 1346.90675
[7] Hintermüller, M., A proximal bundle method based on approximate subgradients, Computational Optimization and Applications, 20, 3, 245-266 (2001) · Zbl 1054.90053
[8] Clarke, F. H., Optimization and Nonsmooth Analysis (1983), New York, NY, USA: John Wiley & Sons, New York, NY, USA · Zbl 0582.49001
[9] Goldstein, A. A., Optimization of Lipschitz continuous functions, Mathematical Programming, 13, 1, 14-22 (1977) · Zbl 0394.90088
[10] Kiwiel, K. C., A dual method for certain positive semidefinite quadratic programming problems, SIAM Journal on Scientific and Statistical Computing, 10, 1, 175-186 (1989) · Zbl 0663.65063
[11] Fuduli, A.; Gaudioso, M., The proximal trajectory algorithm for convex minimization, 7/98 (1998), Rende Cosenza, Italy: Laboratorio di Logistica, Dipartimento di Elettronica Informatica e Sistemistica, Universita della Calabria, Rende Cosenza, Italy · Zbl 1139.90022
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.