Book chapter · 2004

Unconstrained minimization

Stephen Boyd, Lieven Vandenberghe

Cambridge University Press eBooks, 457–520 · Published 8 March 2004 · DOI 10.1017/cbo9780511804441.010

View at the publisherCite this paper

In brief

“Unconstrained minimization” is a 2004 book chapter by Stephen Boyd and Lieven Vandenberghe, published in Cambridge University Press eBooks. OpenAlex counts 18 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
18
Most cited in
2016 (5)
Field-weighted impact
0.83
Authors
2

Abstract

Convex optimization problems arise frequently in many different fields. This book provides a comprehensive introduction to the subject, and shows in detail how such problems can be solved numerically with great efficiency. The book begins with the basic elements of convex sets and functions, and then describes various classes of convex optimization problems. Duality and… 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

Boyd, S., & Vandenberghe, L. (2004). Unconstrained minimization. Cambridge University Press eBooks, 457–520. https://doi.org/10.1017/cbo9780511804441.010

MLA 9

Boyd, Stephen, and Lieven Vandenberghe. “Unconstrained minimization.” Cambridge University Press eBooks, 2004, pp. 457–520. https://doi.org/10.1017/cbo9780511804441.010.

Chicago

Boyd, Stephen and Lieven Vandenberghe. 2004. “Unconstrained minimization.” Cambridge University Press eBooks: 457–520. https://doi.org/10.1017/cbo9780511804441.010.

Harvard

Boyd, S. and Vandenberghe, L. (2004) ‘Unconstrained minimization’, Cambridge University Press eBooks, pp. 457–520. doi:10.1017/cbo9780511804441.010.

IEEE

S. Boyd and L. Vandenberghe, “Unconstrained minimization,” Cambridge University Press eBooks, pp. 457–520, 2004, doi: 10.1017/cbo9780511804441.010.

BibTeX

@incollection{boyd2004unconstrained,
  title     = {{Unconstrained minimization}},
  author    = {Boyd, Stephen and Vandenberghe, Lieven},
  booktitle = {Cambridge University Press eBooks},
  publisher = {Cambridge University Press},
  year      = {2004},
  pages     = {457--520},
  doi       = {10.1017/cbo9780511804441.010},
  url       = {https://doi.org/10.1017/cbo9780511804441.010}
}

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

Citations by year

YearCitationsShare of the best year
201311
201511
201655
201722
201911
202033
202111
202211
202411

Its field-weighted citation impact is 0.83: it has been cited 0.83 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
  • unconstrained optimization
  • convex sets
  • convex functions
  • duality
  • approximation methods
  • statistical estimation
  • constrained minimization

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?

Boyd, S., & Vandenberghe, L. (2004). Unconstrained minimization. Cambridge University Press eBooks, 457–520. https://doi.org/10.1017/cbo9780511804441.010

How many times has this paper been cited?

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

Stephen Boyd, Lieven Vandenberghe.

What is the DOI of this paper?

10.1017/cbo9780511804441.010. The permanent link is https://doi.org/10.1017/cbo9780511804441.010.

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.