Optimization Online


A Bundle Method for Exploiting Additive Structure in Difficult Optimization Problems

W. de Oliveira(welington***at***ime.uerj.br)
J. Eckstein(jeckstei***at***rci.rutgers.edu)

Abstract: This paper describes a bundle method for (approximately) minimizing complicated nonsmooth convex functions with additive structure, with the primary goal of computing bounds on the solution values of difficult optimization problems such as stochastic integer programs. The method combines features that have appeared in previously proposed bundle methods, but not in the particular configuration we propose. In particular, we use a disaggregate cutting-plane model and approximate lower oracles with on-demand accuracy, and we design the method so that certain trial points can be abandoned without having to invest the full effort of evaluating all their subproblems.


Category 1: Convex and Nonsmooth Optimization (Convex Optimization )

Category 2: Convex and Nonsmooth Optimization (Nonsmooth Optimization )


Download: [PDF]

Entry Submitted: 05/29/2015
Entry Accepted: 05/29/2015
Entry Last Modified: 05/29/2015

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 Optimization Society