Optimization Online


A Proximal Cutting Plane Method Using Chebychev Center for Nonsmooth Convex Optimization

Adam Ouorou (adam.ouorou***at***orange-ftgroup.com)

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.

Keywords: nonsmooth optimization, subgradient, proximal bundle, methods, cutting plane methods, convex programming.

Category 1: Convex and Nonsmooth Optimization

Citation: Mathematical Programming, to appear.


Entry Submitted: 06/01/2006
Entry Accepted: 06/01/2006
Entry Last Modified: 01/02/2008

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society