The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
A duality theorem for non-linear programming
Open accessAbstract
A dual problem is formulated for the mathematical programming problem of minimizing a convex function under convex constraints which reduces to the classical dual problem in the case of linear programming problems. Duality theorems are proved regarding the relationship between the problem and its dual.
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
Kuhn, H. W., & Tucker, A. W. (1951) · Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability · doi:10.1525/9780520411586-036 · Cited by 1,985
The Cutting-Plane Method for Solving Convex Programs
Kelley, Jr. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108053 · Cited by 1,549
The Simplex Method for Quadratic Programming
Wolfe, P. (1960) · Econometrica · doi:10.2307/1905320 · Cited by 503
Self-citationDuality in quadratic programming
Dorn, W. S. (1960) · Quarterly of Applied Mathematics · doi:10.1090/qam/112751 · Cited by 259
Cited by
A tutorial on support vector regression
Smola, A. J., & Schölkopf, B. (2004) · Statistics and Computing · doi:10.1023/b:stco.0000035301.49549.88 · Cited by 13,387
Optimization Concepts and Applications in Engineering
Belegundu, A. D., & Chandrupatla, T. R. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511975905 · Cited by 555
Chou, K.-C., & Cai, Y.-D. (2002) · Journal of Biological Chemistry · doi:10.1074/jbc.m204161200 · Cited by 483
A tutorial on ν‐support vector machines
Chen, P., Lin, C., & Schölkopf, B. (2005) · Applied Stochastic Models in Business and Industry · doi:10.1002/asmb.537 · Cited by 479
Huang, D.-S., & Du, J.-X. (2008) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2008.2004370 · Cited by 393
Metadata
- Authors
- Wolfe, P.
- Venue
- Quarterly of Applied Mathematics
- Publisher
- American Mathematical Society (AMS)
- Published
- 1961-10
- Volume
- 19
- Issue
- 3
- Pages
- 239-244
- ISSN
- 0033-569X (ISSN-L)
- 1552-4485
- OpenAlex
- W2561178549
- Cited by
- 591
- References
- 4
- FWCI
- 5.71
- Type
- journal article
- Language
- en
- Open access
- bronze
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.