Optimization Online


Gradient Sampling Methods for Nonsmooth Optimization

James V. Burke(jvburke01***at***gmail.com)
Frank E. Curtis(frank.e.curtis***at***gmail.com)
Adrian S. Lewis(adrian.lewis***at***cornell.edu)
Michael L. Overton(mo1***at***nyu.edu)
Lucas E. A. Simões(simoes.lea***at***gmail.com)

Abstract: This paper reviews the gradient sampling methodology for solving nonsmooth, nonconvex optimization problems. An intuitively straightforward gradient sampling algorithm is stated and its convergence properties are summarized. Throughout this discussion, we emphasize the simplicity of gradient sampling as an extension of the steepest descent method for minimizing smooth objectives. We then provide overviews of various enhancements that have been proposed to improve practical performance, as well as of several extensions that have been made in the literature, such as to solve constrained problems. The paper also includes clarification of certain technical aspects of the analysis of gradient sampling algorithms, most notably related to the assumptions one needs to make about the set of points at which the objective is continuously differentiable. Finally, we discuss possible future research directions.


Category 1: Convex and Nonsmooth Optimization (Nonsmooth Optimization )

Citation: Submitted to: Special Methods for Nonsmooth Optimization (Springer, 2018), edited by A. Bagirov, M. Gaudioso, N. Karmitsa and M. Mäkelä.

Download: [PDF]

Entry Submitted: 04/29/2018
Entry Accepted: 04/29/2018
Entry Last Modified: 04/29/2018

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