Book · 2021 · Open access

Algorithms for Convex Optimization

Nisheeth K. Vishnoi

Cambridge University Press · Published 24 September 2021 · DOI 10.1017/9781108699211

Free PDFView at the publisherCite this paper

In brief

“Algorithms for Convex Optimization” is a 2021 book by Nisheeth K. Vishnoi. OpenAlex counts 36 citations as of 16 November 2026. It is open access: the full text is free to read at Cambridge University Press eBooks.

Citations
36
Most cited in
2024 (10)
Field-weighted impact
2.66
References
121
Authors
1

Abstract

In the last few years, Algorithms for Convex Optimization have revolutionized algorithm design, both for discrete and continuous optimization problems. For problems like maximum flow, maximum matching, and submodular function minimization, the fastest algorithms involve essential methods such as gradient descent, mirror descent, interior point methods, and ellipsoid methods. The goal of this self-contained book is to enable researchers and professionals in computer science, data science, and machine learning to gain an in-depth understanding of these algorithms. The text emphasizes how to derive key algorithms for convex optimization from first principles and how to establish precise running time bounds. This modern text explains the success of these algorithms in problems of discrete optimization, as well as how these methods have significantly pushed the state of the art of convex optimization itself.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Vishnoi, N. K. (2021). Algorithms for Convex Optimization. Cambridge University Press. https://doi.org/10.1017/9781108699211

MLA 9

Vishnoi, Nisheeth K. Algorithms for Convex Optimization. Cambridge University Press, 2021. https://doi.org/10.1017/9781108699211.

Chicago

Vishnoi, Nisheeth K. 2021. Algorithms for Convex Optimization. Cambridge University Press. https://doi.org/10.1017/9781108699211.

Harvard

Vishnoi, N. K. (2021) Algorithms for Convex Optimization. Cambridge University Press. doi:10.1017/9781108699211.

IEEE

N. K. Vishnoi, Algorithms for Convex Optimization. Cambridge University Press, 2021, doi: 10.1017/9781108699211.

BibTeX

@book{vishnoi2021algorithms,
  title     = {{Algorithms for Convex Optimization}},
  author    = {Vishnoi, Nisheeth K.},
  publisher = {Cambridge University Press},
  year      = {2021},
  doi       = {10.1017/9781108699211},
  url       = {https://doi.org/10.1017/9781108699211}
}

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

Citations by year

YearCitationsShare of the best year
201611
201822
202022
202144
202233
202355
20241010
202544
202655

Its field-weighted citation impact is 2.66: it has been cited 2.66 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 › Complexity and Algorithms in Graphs

  • convex optimization
  • optimization algorithms
  • gradient descent
  • mirror descent
  • interior point methods
  • ellipsoid method
  • maximum flow
  • maximum matching

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Vishnoi, N. K. (2021). Algorithms for Convex Optimization. Cambridge University Press. https://doi.org/10.1017/9781108699211

How many times has this paper been cited?

36 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 Cambridge University Press eBooks.

Who wrote this paper?

Nisheeth K. Vishnoi.

What is the DOI of this paper?

10.1017/9781108699211. The permanent link is https://doi.org/10.1017/9781108699211.

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.