Journal article · 2021 · Open access
First-Order Methods for Convex Optimization
EURO Journal on Computational Optimization, 9, 100015 · Published 1 January 2021 · DOI 10.1016/j.ejco.2021.100015
In brief
“First-Order Methods for Convex Optimization” is a 2021 journal article by Pavel Evgenyevich Dvurechensky and 2 co-authors, published in EURO Journal on Computational Optimization. OpenAlex counts 33 citations as of 16 November 2026, which puts it in the top 7% of works published in 2021 by citations. It is open access under a CC BY-NC-ND licence: the full text is free to read at EURO Journal on Computational Optimization.
- Citations
- 33
- Most cited in
- 2022 (8)
- Field-weighted impact
- 4.26
- References
- 276
- Authors
- 3
Abstract
First-order methods for solving convex optimization problems have been at the forefront of mathematical optimization in the last 20 years. The rapid development of this important class of algorithms is motivated by the success stories reported in various applications, including most importantly machine learning, signal processing, imaging and control theory. First-order methods have the potential to provide low accuracy solutions at low computational complexity which makes them an attractive set of tools in large-scale optimization problems. In this survey, we cover a number of key developments in gradient-based optimization methods. This includes non-Euclidean extensions of the classical proximal gradient method, and its accelerated versions. Additionally we survey recent developments within the class of projection-free methods, and proximal versions of primal-dual schemes. We give complete proofs for various key results, and highlight the unifying aspects of several optimization algorithms.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Dvurechensky, P. E., Shtern, S., & Staudigl, M. (2021). First-Order Methods for Convex Optimization. EURO Journal on Computational Optimization, 9, 100015. https://doi.org/10.1016/j.ejco.2021.100015
MLA 9
Dvurechensky, Pavel Evgenyevich, et al. “First-Order Methods for Convex Optimization.” EURO Journal on Computational Optimization, vol. 9, 2021, p. 100015. https://doi.org/10.1016/j.ejco.2021.100015.
Chicago
Dvurechensky, Pavel Evgenyevich, Shimrit Shtern, and Mathias Staudigl. 2021. “First-Order Methods for Convex Optimization.” EURO Journal on Computational Optimization 9: 100015. https://doi.org/10.1016/j.ejco.2021.100015.
Harvard
Dvurechensky, P. E., Shtern, S. and Staudigl, M. (2021) ‘First-Order Methods for Convex Optimization’, EURO Journal on Computational Optimization, 9, p. 100015. doi:10.1016/j.ejco.2021.100015.
IEEE
P. E. Dvurechensky, S. Shtern, and M. Staudigl, “First-Order Methods for Convex Optimization,” EURO Journal on Computational Optimization, vol. 9, p. 100015, 2021, doi: 10.1016/j.ejco.2021.100015.
BibTeX
@article{dvurechensky2021first,
title = {{First-Order Methods for Convex Optimization}},
author = {Dvurechensky, Pavel Evgenyevich and Shtern, Shimrit and Staudigl, Mathias},
journal = {EURO Journal on Computational Optimization},
year = {2021},
volume = {9},
pages = {100015},
doi = {10.1016/j.ejco.2021.100015},
url = {https://doi.org/10.1016/j.ejco.2021.100015}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2021 | 2 | |
| 2022 | 8 | |
| 2023 | 8 | |
| 2024 | 5 | |
| 2025 | 6 | |
| 2026 | 4 |
Its field-weighted citation impact is 4.26: it has been cited 4.26 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
- first-order methods
- convex optimization
- gradient-based optimization
- proximal gradient method
- accelerated gradient methods
- non-Euclidean optimization
- primal-dual algorithm
- large-scale optimization
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?
Dvurechensky, P. E., Shtern, S., & Staudigl, M. (2021). First-Order Methods for Convex Optimization. EURO Journal on Computational Optimization, 9, 100015. https://doi.org/10.1016/j.ejco.2021.100015
How many times has this paper been cited?
33 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 EURO Journal on Computational Optimization.
Who wrote this paper?
Pavel Evgenyevich Dvurechensky, Shimrit Shtern, Mathias Staudigl.
What is the DOI of this paper?
10.1016/j.ejco.2021.100015. The permanent link is https://doi.org/10.1016/j.ejco.2021.100015.
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.