The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Convex Optimization
Open accessAbstract
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 approximation techniques are then covered, as are statistical estimation techniques. Various geometrical problems are then presented, and there is detailed discussion of unconstrained and constrained minimization problems, and interior-point methods. The focus of the book is on recognizing convex optimization problems and then finding the most appropriate technique for solving them. It contains many worked examples and homework exercises and will appeal to students, researchers and practitioners in fields such as engineering, computer science, mathematics, statistics, finance and economics.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Convex optimization [102] problems have nice properties: the minimum is unique and algorithms for solving them scale up well with problem size.”
From Reverse engineering and identification in systems biology: strategies, perspectives and challenges (2014) · cites this paper as [102]
Citations
Cites
A new polynomial-time algorithm for linear programming
Karmarkar, N. (1984) · Combinatorica · doi:10.1007/bf02579150 · Cited by 4,794
Wright, M. (2004) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-04-01040-7 · Cited by 345
Linear systems in Jordan algebras and primal-dual interior-point algorithms
Faybusovich, L. (1997) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(97)00153-2 · Cited by 212
Euclidean Jordan Algebras and Interior-point Algorithms
Faybusovich, L. (1997) · Positivity · doi:10.1023/a:1009701824047 · Cited by 204
Primal-dual algorithms and infinite-dimensional Jordan algebras of finite rank
Faybusovich, L. E., & Tsuchiya, T. (2003) · Mathematical Programming · doi:10.1007/s10107-003-0424-4 · Cited by 33
A long-step primal–dual algorithm for the symmetric programming problem
Faybusovich, L. E., & Arana, R. R. J. (2001) · Systems & Control Letters · doi:10.1016/s0167-6911(01)00092-5 · Cited by 17
Cited by
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Self-citationBoyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
Self-citationCognitive radio: brain-empowered wireless communications
Haykin, S. (2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.839380 · Cited by 11,916
Gaussian Processes for Machine Learning
Rasmussen, C. E., & Williams, C. K. I. (2005) · doi:10.7551/mitpress/3206.001.0001 · Cited by 11,705
TopHat: discovering splice junctions with RNA-Seq
Trapnell, C., Pachter, L., & Salzberg, S. L. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp120 · Cited by 11,617
Metadata
- Authors
- Boyd, S., & Vandenberghe, L.
- Affiliations
- Stanford University (US)
- University of California, Los Angeles (US)
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 2004-03-08
- OpenAlex
- W2296319761
- Cited by
- 56,601
- References
- 6
- Citations by year
- 2026: 1773 · 2025: 2658 · 2024: 2632 · 2023: 2610 · 2022: 2708 · 2021: 3521 · 2020: 3777 · 2019: 3635 · 2018: 3667 · 2017: 3449 · 2016: 3468 · 2015: 3429 · 2014: 3550 · 2013: 2996 · 2012: 2712
- FWCI
- 43.56
- Type
- book
- Language
- en
- Open access
- green
- doi.org
- Locations
- Cambridge University Press eBooks (publishedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- IEEE RESOURCE CENTERS
- Cambridge University Press eBooks
- Topics
- Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis
- Social Sciences › Decision Sciences › Management Science and Operations Research › Risk and Portfolio Optimization
- Keywords
- convex optimization, convex sets, convex functions, duality, approximation methods, statistical estimation, unconstrained optimization, constrained minimization, interior point methods, numerical optimization
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Convex Optimization. https://app.cochat.ai/papers/10.1017/cbo9780511804441
- The paper
- Boyd, S., & Vandenberghe, L. (2004). Convex Optimization. Cambridge University Press eBooks. https://doi.org/10.1017/cbo9780511804441
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.