Gradient Sampling Methods for Nonsmooth Optimization

James V. Burke (), Frank E. Curtis (), Adrian S. Lewis (), Michael L. Overton () and Lucas E. A. Simões ()
Additional contact information
James V. Burke: University of Washington, Department of Mathematics
Frank E. Curtis: Lehigh University, Department of Industrial and Systems Engineering
Adrian S. Lewis: Cornell University, School of Operations Research and Information Engineering
Michael L. Overton: New York University, Courant Institute of Mathematical Sciences
Lucas E. A. Simões: University of Campinas, Department of Applied Mathematics

Chapter Chapter 6 in Numerical Nonsmooth Optimization, 2020, pp 201-225 from Springer

Abstract: Abstract This article reviews the gradient sampling methodology for solving nonsmooth, nonconvex optimization problems. We state an intuitively straightforward gradient sampling algorithm and summarize its convergence properties. Throughout this discussion, we emphasize the simplicity of gradient sampling as an extension of the steepest descent method for minimizing smooth objectives. We provide an overview of various enhancements that have been proposed to improve practical performance, as well as an overview of several extensions that have been proposed in the literature, such as to solve constrained problems. We also clarify 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.

Date: 2020
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-030-34910-3_6

Ordering information: This item can be ordered from
http://www.springer.com/9783030349103

DOI: 10.1007/978-3-030-34910-3_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().