Journal article · 2023

Nesterov's Method for Convex Optimization

Noel J. Walkington

SIAM Review, 65(2), 539–562 · Published 1 May 2023 · DOI 10.1137/21m1390037

View at the publisherCite this paper

In brief

“Nesterov's Method for Convex Optimization” is a 2023 journal article by Noel J. Walkington, published in SIAM Review. OpenAlex counts 20 citations as of 16 November 2026, which puts it in the top 4% of works published in 2023 by citations. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
20
Most cited in
2025 (11)
Field-weighted impact
3.82
References
17
Authors
1

Abstract

While Nesterov's algorithm for computing the minimum of a convex function is now over forty years old, it is rarely presented in texts for a first course in optimization. This is unfortunate since for many problems this algorithm is superior to the ubiquitous steepest descent algorithm, and it is equally simple to implement. This article… 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

Walkington, N. J. (2023). Nesterov's Method for Convex Optimization. SIAM Review, 65(2), 539–562. https://doi.org/10.1137/21m1390037

MLA 9

Walkington, Noel J. “Nesterov's Method for Convex Optimization.” SIAM Review, vol. 65, no. 2, 2023, pp. 539–562. https://doi.org/10.1137/21m1390037.

Chicago

Walkington, Noel J. 2023. “Nesterov's Method for Convex Optimization.” SIAM Review 65 (2): 539–562. https://doi.org/10.1137/21m1390037.

Harvard

Walkington, N. J. (2023) ‘Nesterov's Method for Convex Optimization’, SIAM Review, 65(2), pp. 539–562. doi:10.1137/21m1390037.

IEEE

N. J. Walkington, “Nesterov's Method for Convex Optimization,” SIAM Review, vol. 65, no. 2, pp. 539–562, 2023, doi: 10.1137/21m1390037.

BibTeX

@article{walkington2023nesterov,
  title     = {{Nesterov's Method for Convex Optimization}},
  author    = {Walkington, Noel J.},
  journal   = {SIAM Review},
  year      = {2023},
  volume    = {65},
  number    = {2},
  pages     = {539--562},
  doi       = {10.1137/21m1390037},
  url       = {https://doi.org/10.1137/21m1390037}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
202444
20251111
202655

Its field-weighted citation impact is 3.82: it has been cited 3.82 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 › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research

  • convex optimization
  • gradient descent
  • convex functions
  • optimization algorithms

Work with this paper

Most-cited papers in Mathematics

All highly cited Mathematics papers

Questions about this paper

How do I cite this paper in APA style?

Walkington, N. J. (2023). Nesterov's Method for Convex Optimization. SIAM Review, 65(2), 539–562. https://doi.org/10.1137/21m1390037

How many times has this paper been cited?

20 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?

Noel J. Walkington.

What is the DOI of this paper?

10.1137/21m1390037. The permanent link is https://doi.org/10.1137/21m1390037.

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.