Disciplined Convex Programming
The DOI matches its Crossref record; 170 of the 177 references it cites were found in a registry or an index.
Abstract
SummaryA new methodology for constructing convex optimization models called disciplined convex programming is introduced. The methodology enforces a set of conventions upon the models constructed, in turn allowing much of the work required to analyze and solve the models to be automated.
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
“Specifically, CVX [112] provides a two-stage software framework for modeling and solving general large-scale convex optimization problems.”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [112]
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Self-citationGolub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Linear Matrix Inequalities in System and Control Theory
Boyd, S., El Ghaoui, L., Feron, E., & Balakrishnan, V. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970777 · Cited by 21,687
Self-citation(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
(1999) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b98874 · Cited by 9,482
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Sturm, J. F. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805766 · Cited by 7,377
Linear Programming and Extensions
Dantzig, G. (1963) · RAND Corporation eBooks · doi:10.7249/r366 · Cited by 5,755
A new polynomial-time algorithm for linear programming
Karmarkar, N. (1984) · Combinatorica · doi:10.1007/bf02579150 · Cited by 4,794
Research works printed but not linked: 9
- D. Bertsekas. Nonlinear Programming. Athena Scientific, Belmont, Massachusetts, 1995.
- C. Crusius. A parser/solver for convex optimization problems. PhD thesis, Stanford University, 2002.
- D. Goldfarb and G. Iyengar. Robust quadratically constrained problems program. Technical Report TR-2002-04, Department of IEOR, Columbia University, New York, NY USA, 2002.
- M. Grant. Disciplined Convex Programming. PhD thesis, Department of Electrical Engineering, Stanford University, December 2004.
- J.-B. Hiriart-Urruty and C. Lemaréchal. Convex Analysis and Minimization Algorithms II: Advanced Theory and Bundle Methods, volume 306 of Grundlehren der mathematischen Wissenschaften. Springer-Verlag, New York, 1993.
- B. Murtaugh and M. Saunders. MINOS 5.5 user’s guide. Technical report, Systems Optimizaiton Laboratory, Stanford University, July 1998. Web site: http://www.sbsi-sol-optimize.com/manuals/Minos%205-5%20Manual.p%df.
- Yu. Nesterov and A. Nemirovsky. A general approach to polynomial-time algorithms design for convex programming. Technical report, Centr. Econ. & Math. Inst., USSR Acad. Sci., Moscow, USSR, 1988.
- G. Pataki. Geometry of cone-optimization problems and semi-definite programs. Technical report, GSIA Carnegie Mellon University, Pittsburgh, PA, 1994.
- T. Tsuchiya. A polynomial primal-dual path-following algorithm for second-order cone programming. Technical report, The Institute of Statistical Mathematics, Tokyo, Japan, October 1997.
Cited by
Graph Implementations for Nonsmooth Convex Programs
Grant, M. C., & Boyd, S. P. (2007) · Lecture Notes in Control and Information Sciences · doi:10.1007/978-1-84800-155-8_7 · Cited by 2,666
“Disciplined convex programming was first named and described by Grant, Boyd, and Ye in [GBY06] and Grant in [Gra04].”
BackgroundSelf-citationCVXPY: A Python-Embedded Modeling Language for Convex Optimization.
Diamond, S., & Boyd, S. (2016) · PubMed · Cited by 1,648
Self-citationJuMP: A MODELING LANGUAGE FOR MATHEMATICAL OPTIMIZATION
Dunning, I., Huchette, J., & Lubin, M. (2016) · Cited by 1,355
Simultaneously Transmitting and Reflecting (STAR) RIS Aided Wireless Communications
Mu, X., Liu, Y., Guo, L., Lin, J., & Schober, R. (2022) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2021.3118225 · Cited by 896
Edge artificial intelligence for 6g: vision, enabling technologies, and applications
Letaief, K. B., Shi, Y., Lu, J., & Lu, J. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3126076 · Cited by 829
Metadata
- Authors
- Grant, M., Boyd, S., & Ye, Y.
- Affiliations
- Stanford University (US)
- Venue
- Nonconvex Optimization and Its Applications
- Publisher
- Kluwer Academic Publishers
- Published
- 2006-06-20
- Pages
- 155-210
- OpenAlex
- W2178935672
- Cited by
- 1,026
- References
- 177
- Citations by year
- 2026: 32 · 2025: 116 · 2024: 126 · 2023: 115 · 2022: 247 · 2021: 111 · 2020: 30 · 2019: 33 · 2018: 26 · 2017: 15 · 2016: 26 · 2015: 26 · 2014: 27 · 2013: 15 · 2012: 12
- FWCI
- 26.01
- Type
- book chapter
- Language
- en
- Open access
- closed
- Locations
- Kluwer Academic Publishers eBooks (publishedVersion)
- 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
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: Disciplined Convex Programming. https://app.cochat.ai/papers/10.1007/0-387-30528-9_7
- The paper
- Grant, M., Boyd, S., & Ye, Y. (2006). Disciplined Convex Programming. Nonconvex Optimization and Its Applications. https://doi.org/10.1007/0-387-30528-9_7
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.