CoChat

Disciplined Convex Programming

Grant, Michael, Boyd, Stephen, Ye, Yinyu · 2006 · Nonconvex Optimization and Its Applications

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

Crossref · 10.1007/0-387-30528-9_7

Cites

170 of 170 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 170 references

Research works printed but not linked: 9

  1. D. Bertsekas. Nonlinear Programming. Athena Scientific, Belmont, Massachusetts, 1995.
  2. C. Crusius. A parser/solver for convex optimization problems. PhD thesis, Stanford University, 2002.
  3. 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.
  4. M. Grant. Disciplined Convex Programming. PhD thesis, Department of Electrical Engineering, Stanford University, December 2004.
  5. 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.
  6. 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.
  7. 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.
  8. G. Pataki. Geometry of cone-optimization problems and semi-definite programs. Technical report, GSIA Carnegie Mellon University, Pittsburgh, PA, 1994.
  9. 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

See all 1,026

Metadata

Authors
Grant, M., Boyd, S., & Ye, Y.
Affiliations
Stanford University (US)
Venue
Nonconvex Optimization and Its Applications
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.