Book chapter · 2025

Convex Optimization Theory

Daniel P. Palomar

Cambridge University Press eBooks, 491–538 · Published 31 May 2025 · DOI 10.1017/9781009428095.021

View at the publisherCite this paper

In brief

“Convex Optimization Theory” is a 2025 book chapter by Daniel P. Palomar, published in Cambridge University Press eBooks. OpenAlex counts 587 citations as of 15 November 2026, which puts it in the top 7% of works published in 2025 by citations. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
587
Most cited in
2020 (71)
Field-weighted impact
8.76
References
52
Authors
1

Abstract

An insightful, concise, and rigorous treatment of the basic theory of convex sets and functions in finite dimensions, and the Dual problem the feasible if it is they. Subgradient methods applied mathematics and sofware full. Ellipsoid method frankwolfe for publication. Arg max are the special case when choosing such. Unlike some convex programming lp a… 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

Palomar, D. P. (2025). Convex Optimization Theory. Cambridge University Press eBooks, 491–538. https://doi.org/10.1017/9781009428095.021

MLA 9

Palomar, Daniel P. “Convex Optimization Theory.” Cambridge University Press eBooks, 2025, pp. 491–538. https://doi.org/10.1017/9781009428095.021.

Chicago

Palomar, Daniel P. 2025. “Convex Optimization Theory.” Cambridge University Press eBooks: 491–538. https://doi.org/10.1017/9781009428095.021.

Harvard

Palomar, D. P. (2025) ‘Convex Optimization Theory’, Cambridge University Press eBooks, pp. 491–538. doi:10.1017/9781009428095.021.

IEEE

D. P. Palomar, “Convex Optimization Theory,” Cambridge University Press eBooks, pp. 491–538, 2025, doi: 10.1017/9781009428095.021.

BibTeX

@incollection{palomar2025convex,
  title     = {{Convex Optimization Theory}},
  author    = {Palomar, Daniel P.},
  booktitle = {Cambridge University Press eBooks},
  publisher = {Cambridge University Press},
  year      = {2025},
  pages     = {491--538},
  doi       = {10.1017/9781009428095.021},
  url       = {https://doi.org/10.1017/9781009428095.021}
}

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

Citations by year

YearCitationsShare of the best year
20165353
20173838
20184242
20196262
20207171
20216767
20224141
20232929
20242323
202522

Its field-weighted citation impact is 8.76: it has been cited 8.76 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
  • convex sets
  • convex functions
  • duality
  • subgradient method
  • ellipsoid method
  • Frank-Wolfe algorithm
  • gradient-based optimization

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?

Palomar, D. P. (2025). Convex Optimization Theory. Cambridge University Press eBooks, 491–538. https://doi.org/10.1017/9781009428095.021

How many times has this paper been cited?

587 times, according to OpenAlex on 15 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?

Daniel P. Palomar.

What is the DOI of this paper?

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

Bibliographic data from OpenAlex (CC0), last checked 15 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.