Journal article · 2007
Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
SIAM Journal on Optimization, 18(2), 379–388 · Published 1 January 2007 · DOI 10.1137/050639673
In brief
“Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization” is a 2007 journal article by Krzysztof Czesław Kiwiel, published in SIAM Journal on Optimization. OpenAlex counts 106 citations as of 16 November 2026, which puts it in the top 7% of works published in 2007 by citations. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 106
- Most cited in
- 2022 (11)
- Field-weighted impact
- 2.19
- References
- 8
- Authors
- 1
Abstract
We study the gradient sampling algorithm of Burke, Lewis, and Overton for minimizing a locally Lipschitz function f on $\mathbb{R}^n$ that is continuously differentiable on an open dense subset. We strengthen the existing convergence results for this algorithm and introduce a slightly revised version for which stronger results are established without requiring compactness of the… Read the full abstract at the publisher.
Excerpt. This paper is not open access.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Kiwiel, K. C. (2007). Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization. SIAM Journal on Optimization, 18(2), 379–388. https://doi.org/10.1137/050639673
MLA 9
Kiwiel, Krzysztof Czesław. “Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization.” SIAM Journal on Optimization, vol. 18, no. 2, 2007, pp. 379–388. https://doi.org/10.1137/050639673.
Chicago
Kiwiel, Krzysztof Czesław. 2007. “Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization.” SIAM Journal on Optimization 18 (2): 379–388. https://doi.org/10.1137/050639673.
Harvard
Kiwiel, K. C. (2007) ‘Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization’, SIAM Journal on Optimization, 18(2), pp. 379–388. doi:10.1137/050639673.
IEEE
K. C. Kiwiel, “Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization,” SIAM Journal on Optimization, vol. 18, no. 2, pp. 379–388, 2007, doi: 10.1137/050639673.
BibTeX
@article{kiwiel2007convergence,
title = {{Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization}},
author = {Kiwiel, Krzysztof Czesław},
journal = {SIAM Journal on Optimization},
year = {2007},
volume = {18},
number = {2},
pages = {379--388},
doi = {10.1137/050639673},
url = {https://doi.org/10.1137/050639673}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2017 | 7 | |
| 2018 | 6 | |
| 2019 | 7 | |
| 2020 | 10 | |
| 2021 | 6 | |
| 2022 | 11 | |
| 2023 | 11 | |
| 2024 | 8 | |
| 2025 | 5 | |
| 2026 | 6 |
Its field-weighted citation impact is 2.19: it has been cited 2.19 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
- nonsmooth nonconvex optimization
- locally Lipschitz functions
- convergence analysis
- limit points
- probabilistic convergence
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?
Kiwiel, K. C. (2007). Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization. SIAM Journal on Optimization, 18(2), 379–388. https://doi.org/10.1137/050639673
How many times has this paper been cited?
106 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?
OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.
Who wrote this paper?
Krzysztof Czesław Kiwiel.
What is the DOI of this paper?
10.1137/050639673. The permanent link is https://doi.org/10.1137/050639673.
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.