Gradient Sampling Methods for Nonsmooth Optimization

arXiv1804.11003MaRDI QIDQ6300960FDOQ6300960

Authors: James V. Burke, Frank E. Curtis, A. S. Lewis, Michael L. Overton, Lucas E. A. Simões 

Publication date: 29 April 2018

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.

This page was built for publication: Gradient Sampling Methods for Nonsmooth Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6300960)