Journal article · 2020 · Open access
Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization
Optimization Letters, 14(7), 1615–1625 · Published 22 January 2020 · DOI 10.1007/s11590-020-01537-8
In brief
“Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization” is a 2020 journal article by Andrzej Ruszczyński, published in Optimization Letters. OpenAlex counts 29 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
- 29
- Most cited in
- 2024 (7)
- Field-weighted impact
- 2.98
- References
- 22
- Authors
- 1
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Ruszczyński, A. (2020). Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization. Optimization Letters, 14(7), 1615–1625. https://doi.org/10.1007/s11590-020-01537-8
MLA 9
Ruszczyński, Andrzej. “Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization.” Optimization Letters, vol. 14, no. 7, 2020, pp. 1615–1625. https://doi.org/10.1007/s11590-020-01537-8.
Chicago
Ruszczyński, Andrzej. 2020. “Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization.” Optimization Letters 14 (7): 1615–1625. https://doi.org/10.1007/s11590-020-01537-8.
Harvard
Ruszczyński, A. (2020) ‘Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization’, Optimization Letters, 14(7), pp. 1615–1625. doi:10.1007/s11590-020-01537-8.
IEEE
A. Ruszczyński, “Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization,” Optimization Letters, vol. 14, no. 7, pp. 1615–1625, 2020, doi: 10.1007/s11590-020-01537-8.
BibTeX
@article{ruszczynski2020convergence,
title = {{Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization}},
author = {Ruszczyński, Andrzej},
journal = {Optimization Letters},
year = {2020},
volume = {14},
number = {7},
pages = {1615--1625},
doi = {10.1007/s11590-020-01537-8},
url = {https://doi.org/10.1007/s11590-020-01537-8}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2020 | 2 | |
| 2021 | 3 | |
| 2022 | 4 | |
| 2023 | 6 | |
| 2024 | 7 | |
| 2025 | 4 | |
| 2026 | 3 |
Its field-weighted citation impact is 2.98: it has been cited 2.98 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
- stochastic subgradient method
- convergence analysis
- nonsmooth optimization
- non-convex optimization
- constrained optimization
- generalized differentiability
- chain rule
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?
Ruszczyński, A. (2020). Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization. Optimization Letters, 14(7), 1615–1625. https://doi.org/10.1007/s11590-020-01537-8
How many times has this paper been cited?
29 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?
Andrzej Ruszczyński.
What is the DOI of this paper?
10.1007/s11590-020-01537-8. The permanent link is https://doi.org/10.1007/s11590-020-01537-8.
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.