The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
The Cutting-Plane Method for Solving Convex Programs
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
Rosen, J. B. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108011 · Cited by 1,190
The generalized simplex method for minimizing a linear form under linear inequality restraints
Dantzig, G., Orden, A., & Wolfe, P. (1955) · Pacific Journal of Mathematics · doi:10.2140/pjm.1955.5.183 · Cited by 585
The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
Rosen, J. B. (1961) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0109044 · Cited by 520
Cited by
Mladenović, N., & Hansen, P. (1997) · Computers & Operations Research · doi:10.1016/s0305-0548(97)00031-2 · Cited by 4,254
Partitioning procedures for solving mixed-variables programming problems
Benders, J. F. (1962) · Numerische Mathematik · doi:10.1007/bf01386316 · Cited by 3,855
Training linear SVMs in linear time
Joachims, T. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150429 · Cited by 1,920
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
Duran, M. A., & Grossmann, I. E. (1986) · Mathematical Programming · doi:10.1007/bf02592064 · Cited by 1,447
L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
Van Slyke, R. M., & Wets, R. (1969) · SIAM Journal on Applied Mathematics · doi:10.1137/0117061 · Cited by 1,281
Metadata
- Authors
- Kelley, Jr.
- Venue
- Journal of the Society for Industrial and Applied Mathematics
- Published
- 1960-12
- Volume
- 8
- Issue
- 4
- Pages
- 703-712
- ISSN
- 0368-4245 (ISSN-L)
- 2168-3484
- OpenAlex
- W2069808690
- Cited by
- 1,549
- References
- 3
- FWCI
- 6.34
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.