Book chapter · 2022
Basic Convex Optimization
Cambridge University Press eBooks, 160–168 · Published 21 April 2022 · DOI 10.1017/9781009003933.029
In brief
“Basic Convex Optimization” is a 2022 book chapter by Simon Foucart, published in Cambridge University Press eBooks. OpenAlex counts 0 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 0
- Authors
- 1
Abstract
This chapter introduces the key concepts of optimization, such as objective function, constraints, local and global minimizers, and gradient descent algorithms. The rate of convergence for the steepest descent algorithm is analyzed when the objective function is smooth and convex or smooth and strongly convex. The analysis is extended to the stochastic gradient descent algorithm. 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
Foucart, S. (2022). Basic Convex Optimization. Cambridge University Press eBooks, 160–168. https://doi.org/10.1017/9781009003933.029
MLA 9
Foucart, Simon. “Basic Convex Optimization.” Cambridge University Press eBooks, 2022, pp. 160–168. https://doi.org/10.1017/9781009003933.029.
Chicago
Foucart, Simon. 2022. “Basic Convex Optimization.” Cambridge University Press eBooks: 160–168. https://doi.org/10.1017/9781009003933.029.
Harvard
Foucart, S. (2022) ‘Basic Convex Optimization’, Cambridge University Press eBooks, pp. 160–168. doi:10.1017/9781009003933.029.
IEEE
S. Foucart, “Basic Convex Optimization,” Cambridge University Press eBooks, pp. 160–168, 2022, doi: 10.1017/9781009003933.029.
BibTeX
@incollection{foucart2022basic,
title = {{Basic Convex Optimization}},
author = {Foucart, Simon},
booktitle = {Cambridge University Press eBooks},
publisher = {Cambridge University Press},
year = {2022},
pages = {160--168},
doi = {10.1017/9781009003933.029},
url = {https://doi.org/10.1017/9781009003933.029}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
- convex optimization
- objective function
- constraints
- local minimizers
- global minimizers
- gradient descent
- convergence rate
- smooth convex functions
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?
Foucart, S. (2022). Basic Convex Optimization. Cambridge University Press eBooks, 160–168. https://doi.org/10.1017/9781009003933.029
How many times has this paper been cited?
0 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?
Simon Foucart.
What is the DOI of this paper?
10.1017/9781009003933.029. The permanent link is https://doi.org/10.1017/9781009003933.029.
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.