Journal article · 2022 · Open access
Dualize, Split, Randomize: Toward Fast Nonsmooth Optimization Algorithms
Journal of Optimization Theory and Applications, 195(1), 102–130 · Published 13 July 2022 · DOI 10.1007/s10957-022-02061-8
In brief
“Dualize, Split, Randomize: Toward Fast Nonsmooth Optimization Algorithms” is a 2022 journal article by Adil Salim and 3 co-authors, published in Journal of Optimization Theory and Applications. OpenAlex counts 37 citations as of 16 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 37
- Most cited in
- 2025 (8)
- Field-weighted impact
- 4.13
- References
- 90
- Authors
- 4
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Salim, A., Condat, L., Mishchenko, K., & Richtárik, P. (2022). Dualize, Split, Randomize: Toward Fast Nonsmooth Optimization Algorithms. Journal of Optimization Theory and Applications, 195(1), 102–130. https://doi.org/10.1007/s10957-022-02061-8
MLA 9
Salim, Adil, et al. “Dualize, Split, Randomize: Toward Fast Nonsmooth Optimization Algorithms.” Journal of Optimization Theory and Applications, vol. 195, no. 1, 2022, pp. 102–130. https://doi.org/10.1007/s10957-022-02061-8.
Chicago
Salim, Adil, Laurent Condat, Konstantin Mishchenko, and Peter Richtárik. 2022. “Dualize, Split, Randomize: Toward Fast Nonsmooth Optimization Algorithms.” Journal of Optimization Theory and Applications 195 (1): 102–130. https://doi.org/10.1007/s10957-022-02061-8.
Harvard
Salim, A. et al. (2022) ‘Dualize, Split, Randomize: Toward Fast Nonsmooth Optimization Algorithms’, Journal of Optimization Theory and Applications, 195(1), pp. 102–130. doi:10.1007/s10957-022-02061-8.
IEEE
A. Salim, L. Condat, K. Mishchenko, and P. Richtárik, “Dualize, Split, Randomize: Toward Fast Nonsmooth Optimization Algorithms,” Journal of Optimization Theory and Applications, vol. 195, no. 1, pp. 102–130, 2022, doi: 10.1007/s10957-022-02061-8.
BibTeX
@article{salim2022dualize,
title = {{Dualize, Split, Randomize: Toward Fast Nonsmooth Optimization Algorithms}},
author = {Salim, Adil and Condat, Laurent and Mishchenko, Konstantin and Richtárik, Peter},
journal = {Journal of Optimization Theory and Applications},
year = {2022},
volume = {195},
number = {1},
pages = {102--130},
doi = {10.1007/s10957-022-02061-8},
url = {https://doi.org/10.1007/s10957-022-02061-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 | 1 | |
| 2021 | 7 | |
| 2022 | 4 | |
| 2023 | 4 | |
| 2024 | 7 | |
| 2025 | 8 | |
| 2026 | 6 |
Its field-weighted citation impact is 4.13: it has been cited 4.13 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 optimization
- primal-dual algorithm
- monotone inclusion problems
- linear convergence
- sublinear convergence
- linearly constrained optimization
- distributed optimization
- image processing
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?
Salim, A., Condat, L., Mishchenko, K., & Richtárik, P. (2022). Dualize, Split, Randomize: Toward Fast Nonsmooth Optimization Algorithms. Journal of Optimization Theory and Applications, 195(1), 102–130. https://doi.org/10.1007/s10957-022-02061-8
How many times has this paper been cited?
37 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?
Adil Salim, Laurent Condat, Konstantin Mishchenko, Peter Richtárik.
What is the DOI of this paper?
10.1007/s10957-022-02061-8. The permanent link is https://doi.org/10.1007/s10957-022-02061-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.