Book chapter · 2020 · Open access
Gradient Sampling Methods for Nonsmooth Optimization
Springer eBooks, 201–225 · Published 28 February 2020 · DOI 10.1007/978-3-030-34910-3_6
In brief
“Gradient Sampling Methods for Nonsmooth Optimization” is a 2020 book chapter by James V. Burke and 4 co-authors, published in Springer eBooks. OpenAlex counts 80 citations as of 16 November 2026, which puts it in the top 7% of works published in 2020 by citations. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 80
- Most cited in
- 2023 (17)
- Field-weighted impact
- 41.66
- References
- 48
- Authors
- 5
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Burke, J. V., Curtis, F. E., Lewis, A. S., Overton, M. L., & Simões, L. E. A. (2020). Gradient Sampling Methods for Nonsmooth Optimization. Springer eBooks, 201–225. https://doi.org/10.1007/978-3-030-34910-3_6
MLA 9
Burke, James V., et al. “Gradient Sampling Methods for Nonsmooth Optimization.” Springer eBooks, 2020, pp. 201–225. https://doi.org/10.1007/978-3-030-34910-3_6.
Chicago
Burke, James V., Frank E. Curtis, Adrian S. Lewis, Michael L. Overton, and Lucas E. A. Simões. 2020. “Gradient Sampling Methods for Nonsmooth Optimization.” Springer eBooks: 201–225. https://doi.org/10.1007/978-3-030-34910-3_6.
Harvard
Burke, J. V. et al. (2020) ‘Gradient Sampling Methods for Nonsmooth Optimization’, Springer eBooks, pp. 201–225. doi:10.1007/978-3-030-34910-3_6.
IEEE
J. V. Burke, F. E. Curtis, A. S. Lewis, M. L. Overton, and L. E. A. Simões, “Gradient Sampling Methods for Nonsmooth Optimization,” Springer eBooks, pp. 201–225, 2020, doi: 10.1007/978-3-030-34910-3_6.
BibTeX
@incollection{burke2020gradient,
title = {{Gradient Sampling Methods for Nonsmooth Optimization}},
author = {Burke, James V. and Curtis, Frank E. and Lewis, Adrian S. and Overton, Michael L. and Simões, Lucas E. A.},
booktitle = {Springer eBooks},
publisher = {Springer Nature},
year = {2020},
pages = {201--225},
doi = {10.1007/978-3-030-34910-3_6},
url = {https://doi.org/10.1007/978-3-030-34910-3_6}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2018 | 2 | |
| 2019 | 5 | |
| 2020 | 8 | |
| 2021 | 4 | |
| 2022 | 16 | |
| 2023 | 17 | |
| 2024 | 10 | |
| 2025 | 7 | |
| 2026 | 11 |
Its field-weighted citation impact is 41.66: it has been cited 41.66 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis
- gradient sampling
- nonsmooth optimization
- non-convex optimization
- gradient descent
- convergence analysis
- constrained optimization
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Burke, J. V., Curtis, F. E., Lewis, A. S., Overton, M. L., & Simões, L. E. A. (2020). Gradient Sampling Methods for Nonsmooth Optimization. Springer eBooks, 201–225. https://doi.org/10.1007/978-3-030-34910-3_6
How many times has this paper been cited?
80 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access: read the free full text at arXiv (Cornell University).
Who wrote this paper?
James V. Burke, Frank E. Curtis, Adrian S. Lewis, Michael L. Overton, Lucas E. A. Simões.
What is the DOI of this paper?
10.1007/978-3-030-34910-3_6. The permanent link is https://doi.org/10.1007/978-3-030-34910-3_6.
Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.