Journal article · 2015
A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems
Numerical Functional Analysis and Optimization, 36(12), 1559–1584 · Published 2 September 2015 · DOI 10.1080/01630563.2015.1086788
In brief
“A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems” is a 2015 journal article by Yaohua Hu and 2 co-authors, published in Numerical Functional Analysis and Optimization. OpenAlex counts 16 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 16
- Most cited in
- 2017 (5)
- Field-weighted impact
- 3.04
- References
- 33
- Authors
- 3
Abstract
Based on the gradient sampling technique, we present a subgradient algorithm to solve the nondifferentiable convex optimization problem with an extended real-valued objective function. A feature of our algorithm is the approximation of subgradient at a point via random sampling of (relative) gradients at nearby points, and then taking convex combinations of these (relative) gradients.… 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
Hu, Y., Sim, C.-K., & Yang, X. (2015). A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems. Numerical Functional Analysis and Optimization, 36(12), 1559–1584. https://doi.org/10.1080/01630563.2015.1086788
MLA 9
Hu, Yaohua, et al. “A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems.” Numerical Functional Analysis and Optimization, vol. 36, no. 12, 2015, pp. 1559–1584. https://doi.org/10.1080/01630563.2015.1086788.
Chicago
Hu, Yaohua, Chee-Khian Sim, and Xiaoqi Yang. 2015. “A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems.” Numerical Functional Analysis and Optimization 36 (12): 1559–1584. https://doi.org/10.1080/01630563.2015.1086788.
Harvard
Hu, Y., Sim, C.-K. and Yang, X. (2015) ‘A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems’, Numerical Functional Analysis and Optimization, 36(12), pp. 1559–1584. doi:10.1080/01630563.2015.1086788.
IEEE
Y. Hu, C.-K. Sim, and X. Yang, “A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems,” Numerical Functional Analysis and Optimization, vol. 36, no. 12, pp. 1559–1584, 2015, doi: 10.1080/01630563.2015.1086788.
BibTeX
@article{hu2015subgradient,
title = {{A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems}},
author = {Hu, Yaohua and Sim, Chee-Khian and Yang, Xiaoqi},
journal = {Numerical Functional Analysis and Optimization},
year = {2015},
volume = {36},
number = {12},
pages = {1559--1584},
doi = {10.1080/01630563.2015.1086788},
url = {https://doi.org/10.1080/01630563.2015.1086788}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2016 | 1 | |
| 2017 | 5 | |
| 2018 | 4 | |
| 2019 | 1 | |
| 2020 | 1 | |
| 2021 | 1 | |
| 2023 | 2 | |
| 2026 | 1 |
Its field-weighted citation impact is 3.04: it has been cited 3.04 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
- subgradient method
- gradient sampling
- almost sure 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?
Hu, Y., Sim, C.-K., & Yang, X. (2015). A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems. Numerical Functional Analysis and Optimization, 36(12), 1559–1584. https://doi.org/10.1080/01630563.2015.1086788
How many times has this paper been cited?
16 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?
Yaohua Hu, Chee-Khian Sim, Xiaoqi Yang.
What is the DOI of this paper?
10.1080/01630563.2015.1086788. The permanent link is https://doi.org/10.1080/01630563.2015.1086788.
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.