Abstract and Applied Analysis

A Cutting Plane and Level Stabilization Bundle Method with Inexact Data for Minimizing Nonsmooth Nonconvex Functions

Jie Shen, Dan Li, and Li-Ping Pang

Full-text: Open access


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.

Article information

Abstr. Appl. Anal., Volume 2014, Special Issue (2014), Article ID 192893, 6 pages.

First available in Project Euclid: 2 October 2014

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier


Shen, Jie; Li, Dan; Pang, Li-Ping. A Cutting Plane and Level Stabilization Bundle Method with Inexact Data for Minimizing Nonsmooth Nonconvex Functions. Abstr. Appl. Anal. 2014, Special Issue (2014), Article ID 192893, 6 pages. doi:10.1155/2014/192893. https://projecteuclid.org/euclid.aaa/1412278791

Export citation


  • E. W. Cheney and A. A. Goldstein, “Newton's method for convex programming and Tchebycheff approximation,” Numerische Mathematik, vol. 1, pp. 253–268, 1959.
  • J. E. Kelley, Jr., “The cutting-plane method for solving convex programs,” Journal of the Society for Industrial and Applied Mathematics, vol. 8, pp. 703–712, 1960.
  • A. Fuduli, M. Gaudioso, and G. Giallombardo, “Minimizing nonconvex nonsmooth functions via cutting planes and proximity control,” SIAM Journal on Optimization, vol. 14, no. 3, pp. 743–756, 2003.
  • U. Brannlund, On relaxation methods for nonsmooth convex optimization [Ph.D. thesis], Department of Mathematics, Royal Institute of Technology, Stockholm, Sweden, 1993.
  • C. Lemaréchal, A. Nemirovskii, and Y. Nesterov, “New variants of bundle methods,” Mathematical Programming, vol. 69, no. 1, pp. 111–147, 1995, Nondifferentiable and large-scale optimization (Geneva, 1992).
  • W. de Oliveira and M. Solodov, “A doubly stabilized bundle method for nonsmooth convex optimization,” Tech. Rep., 2013,http://www.optimization-online.org/DB_HTML/2013/04/3828.html.
  • M. Hintermüller, “A proximal bundle method based on approximate subgradients,” Computational Optimization and Applications, vol. 20, no. 3, pp. 245–266, 2001.
  • F. H. Clarke, Optimization and Nonsmooth Analysis, John Wiley & Sons, New York, NY, USA, 1983.
  • A. A. Goldstein, “Optimization of Lipschitz continuous functions,” Mathematical Programming, vol. 13, no. 1, pp. 14–22, 1977.
  • K. C. Kiwiel, “A dual method for certain positive semidefinite quadratic programming problems,” SIAM Journal on Scientific and Statistical Computing, vol. 10, no. 1, pp. 175–186, 1989.
  • A. Fuduli and M. Gaudioso, “The proximal trajectory algorithm for convex minimization,” Tech. Rep. 7/98, Laboratorio di Logistica, Dipartimento di Elettronica Informatica e Sistemistica, Universita della Calabria, Rende Cosenza, Italy, 1998. \endinput