Journal article · 2026 · Open access
Gradient Sampling Algorithm for Subsmooth Functions
SIAM Journal on Optimization, 36(3), 1805–1836 · Published 25 August 2026 · DOI 10.1137/25m1746252
In brief
“Gradient Sampling Algorithm for Subsmooth Functions” is a 2026 journal article by Dimitris Boskos and 2 co-authors, published in SIAM Journal on Optimization. OpenAlex counts 2 citations as of 16 November 2026, which puts it in the top 5% of works published in 2026 by citations. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 2
- Most cited in
- 2026 (2)
- Field-weighted impact
- 4.75
- References
- 55
- Authors
- 3
Abstract
This paper considers nonsmooth optimization problems where we seek to minimize the pointwise maximum of a continuously parameterized family of functions. Since the objective function is given as the solution to a maximization problem, neither its values nor its gradients are available in closed form, which calls for approximation. Our approach hinges upon extending the so-called gradient sampling algorithm, which approximates the Clarke generalized gradient of the objective function at a point by sampling its derivative at nearby locations. This allows us to select descent directions around points where the function may fail to be differentiable and establish algorithm convergence to a stationary point from any initial condition. Our key contribution is to prove this convergence by alleviating the requirement on continuous differentiability of the objective function on an open set of full measure.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Boskos, D., Cortés, J., & Martínez, S. (2026). Gradient Sampling Algorithm for Subsmooth Functions. SIAM Journal on Optimization, 36(3), 1805–1836. https://doi.org/10.1137/25m1746252
MLA 9
Boskos, Dimitris, et al. “Gradient Sampling Algorithm for Subsmooth Functions.” SIAM Journal on Optimization, vol. 36, no. 3, 2026, pp. 1805–1836. https://doi.org/10.1137/25m1746252.
Chicago
Boskos, Dimitris, Jorge Cortés, and Sonia Martínez. 2026. “Gradient Sampling Algorithm for Subsmooth Functions.” SIAM Journal on Optimization 36 (3): 1805–1836. https://doi.org/10.1137/25m1746252.
Harvard
Boskos, D., Cortés, J. and Martínez, S. (2026) ‘Gradient Sampling Algorithm for Subsmooth Functions’, SIAM Journal on Optimization, 36(3), pp. 1805–1836. doi:10.1137/25m1746252.
IEEE
D. Boskos, J. Cortés, and S. Martínez, “Gradient Sampling Algorithm for Subsmooth Functions,” SIAM Journal on Optimization, vol. 36, no. 3, pp. 1805–1836, 2026, doi: 10.1137/25m1746252.
BibTeX
@article{boskos2026gradient,
title = {{Gradient Sampling Algorithm for Subsmooth Functions}},
author = {Boskos, Dimitris and Cortés, Jorge and Martínez, Sonia},
journal = {SIAM Journal on Optimization},
year = {2026},
volume = {36},
number = {3},
pages = {1805--1836},
doi = {10.1137/25m1746252},
url = {https://doi.org/10.1137/25m1746252}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis
- nonsmooth optimization
- Clarke generalized gradient
- descent direction
- stationary point convergence
- non-differentiable functions
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?
Boskos, D., Cortés, J., & Martínez, S. (2026). Gradient Sampling Algorithm for Subsmooth Functions. SIAM Journal on Optimization, 36(3), 1805–1836. https://doi.org/10.1137/25m1746252
How many times has this paper been cited?
2 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?
Dimitris Boskos, Jorge Cortés, Sonia Martínez.
What is the DOI of this paper?
10.1137/25m1746252. The permanent link is https://doi.org/10.1137/25m1746252.
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.