Book · 2015 · Open access

Convex Optimization: Algorithms and Complexity

Sébastien Bubeck

Now Publishers · Published 1 January 2015 · DOI 10.1561/9781601988614

Free PDFView at the publisherCite this paper

In brief

“Convex Optimization: Algorithms and Complexity” is a 2015 book by Sébastien Bubeck. OpenAlex counts 1,573 citations as of 16 November 2026, which puts it in the top 3% of works published in 2015 by citations. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
1,573
Most cited in
2021 (233)
Field-weighted impact
20.97
References
68
Authors
1

Abstract

This monograph presents the main complexity theorems in convex optimization and their corresponding algorithms. Starting from the fundamental theory of black-box optimization, the material progresses towards recent advances in structural optimization and stochastic optimization. Our presentation of black-box optimization, strongly influenced by Nesterov’s seminal book and Nemirovski’s lecture notes, includes the analysis of cutting plane methods, as well as (accelerated) gradient descent schemes. We also pay special attention to non-Euclidean settings (relevant algorithms include Frank-Wolfe, mirror descent, and dual averaging) and discuss their relevance in machine learning. We provide a gentle introduction to structural optimization with FISTA (to optimize a sum of a smooth and a simple non-smooth term), saddle-point mirror prox (Nemirovski’s alternative to Nesterov’s smoothing), and a concise description of interior point methods. In stochastic optimization we discuss stochastic gradient descent, minibatches, random coordinate descent, and sublinear algorithms. We also briefly touch upon convex relaxation of combinatorial problems and the use of randomness to round solutions, as well as random walks based methods.

Cite this paper

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

APA 7

Bubeck, S. (2015). Convex Optimization: Algorithms and Complexity. Now Publishers. https://doi.org/10.1561/9781601988614

MLA 9

Bubeck, Sébastien. Convex Optimization: Algorithms and Complexity. Now Publishers, 2015. https://doi.org/10.1561/9781601988614.

Chicago

Bubeck, Sébastien. 2015. Convex Optimization: Algorithms and Complexity. Now Publishers. https://doi.org/10.1561/9781601988614.

Harvard

Bubeck, S. (2015) Convex Optimization: Algorithms and Complexity. Now Publishers. doi:10.1561/9781601988614.

IEEE

S. Bubeck, Convex Optimization: Algorithms and Complexity. Now Publishers, 2015, doi: 10.1561/9781601988614.

BibTeX

@book{bubeck2015convex,
  title     = {{Convex Optimization: Algorithms and Complexity}},
  author    = {Bubeck, Sébastien},
  publisher = {Now Publishers},
  year      = {2015},
  volume    = {8},
  number    = {3-4},
  pages     = {231--357},
  doi       = {10.1561/9781601988614},
  url       = {https://doi.org/10.1561/9781601988614}
}

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

Citations by year

YearCitationsShare of the best year
20175050
20187878
2019108108
2020164164
2021233233
2022184184
2023179179
2024187187
2025190190
2026153153

Its field-weighted citation impact is 20.97: it has been cited 20.97 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 › Artificial Intelligence › Stochastic Gradient Optimization Techniques

  • convex optimization
  • complexity analysis
  • black-box optimization
  • cutting plane method
  • accelerated gradient descent
  • Frank-Wolfe algorithm
  • mirror descent
  • dual averaging

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?

Bubeck, S. (2015). Convex Optimization: Algorithms and Complexity. Now Publishers. https://doi.org/10.1561/9781601988614

How many times has this paper been cited?

1,573 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?

Sébastien Bubeck.

What is the DOI of this paper?

10.1561/9781601988614. The permanent link is https://doi.org/10.1561/9781601988614.

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.