Preprint · 2010 · Open access
An optimal algorithm for stochastic strongly-convex optimization
arXiv (Cornell University) · Published 12 June 2010 · DOI 10.48550/arxiv.1006.2425
In brief
“An optimal algorithm for stochastic strongly-convex optimization” is a 2010 preprint by Elad Hazan and Satyen Kale, published in arXiv (Cornell University). OpenAlex counts 16 citations as of 16 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 16
- Most cited in
- 2019 (4)
- References
- 1
- Authors
- 2
Abstract
We consider stochastic convex optimization with a strongly convex (but not necessarily smooth) objective. We give an algorithm which performs only gradient updates with optimal rate of convergence.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Hazan, E., & Kale, S. (2010). An optimal algorithm for stochastic strongly-convex optimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1006.2425
MLA 9
Hazan, Elad, and Satyen Kale. “An optimal algorithm for stochastic strongly-convex optimization.” arXiv (Cornell University), 2010. https://doi.org/10.48550/arxiv.1006.2425.
Chicago
Hazan, Elad and Satyen Kale. 2010. “An optimal algorithm for stochastic strongly-convex optimization.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.1006.2425.
Harvard
Hazan, E. and Kale, S. (2010) ‘An optimal algorithm for stochastic strongly-convex optimization’, arXiv (Cornell University). doi:10.48550/arxiv.1006.2425.
IEEE
E. Hazan and S. Kale, “An optimal algorithm for stochastic strongly-convex optimization,” arXiv (Cornell University), 2010, doi: 10.48550/arxiv.1006.2425.
BibTeX
@misc{hazan2010optimal,
title = {{An optimal algorithm for stochastic strongly-convex optimization}},
author = {Hazan, Elad and Kale, Satyen},
howpublished = {arXiv (Cornell University)},
year = {2010},
doi = {10.48550/arxiv.1006.2425},
url = {https://doi.org/10.48550/arxiv.1006.2425}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2012 | 2 | |
| 2014 | 1 | |
| 2015 | 1 | |
| 2016 | 2 | |
| 2018 | 1 | |
| 2019 | 4 | |
| 2020 | 2 | |
| 2021 | 2 |
Topic and keywords
Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
- stochastic convex optimization
- strongly convex functions
- nonsmooth optimization
- gradient-based algorithms
- optimal convergence rates
- optimal algorithms
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?
Hazan, E., & Kale, S. (2010). An optimal algorithm for stochastic strongly-convex optimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1006.2425
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?
Yes. It is open access: read the free full text at arXiv (Cornell University).
Who wrote this paper?
Elad Hazan, Satyen Kale.
What is the DOI of this paper?
10.48550/arxiv.1006.2425. The permanent link is https://doi.org/10.48550/arxiv.1006.2425.
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.