The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Linear and Nonlinear Programming
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
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Optimization and Nonsmooth Analysis
Clarke, F. H. (1990) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971309 · Cited by 10,264
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Dennis, J. E., & Schnabel, R. B. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971200 · Cited by 7,615
The Theory of Games and Economic Behavior
Harrison, R. W., von Neumann, J., & Morgenstern, O. (1945) · Journal of Farm Economics · doi:10.2307/1232672 · Cited by 5,133
A new polynomial-time algorithm for linear programming
Karmarkar, N. (1984) · Combinatorica · doi:10.1007/bf02579150 · Cited by 4,794
Decomposition Principle for Linear Programs
Dantzig, G. B., & Wolfe, P. (1960) · Operations Research · doi:10.1287/opre.8.1.101 · Cited by 2,315
Polynomial algorithms in linear programming
Khachiyan, L. G. (1980) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(80)90061-0 · Cited by 1,992
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
Global Optimization: Deterministic Approaches
Horst, R., & Hoang, T. (1992) · Cited by 1,635
Quasi-Newton Methods, Motivation and Theory
Dennis, Jr., & Moré, J. J. (1977) · SIAM Review · doi:10.1137/1019005 · Cited by 1,553
Cited by
Equilibrium optimizer: A novel optimization algorithm
Faramarzi, A., Heidarinejad, M., Stephens, B., & Mirjalili, S. (2020) · Knowledge-Based Systems · doi:10.1016/j.knosys.2019.105190 · Cited by 2,328
An Interior-Point Method for Large-Scale -Regularized Least Squares
Kim, S.-J., Koh, K., Lustig, M., Boyd, S., & Gorinevsky, D. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910971 · Cited by 2,083
Simo, J. C., & Ortiz, M. (1985) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/0045-7825(85)90061-1 · Cited by 658
Chameleon Swarm Algorithm: A bio-inspired optimizer for solving engineering design problems
Braik, M. S. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.114685 · Cited by 504
A new kernel-based approach for linear system identification
Pillonetto, G., & De Nicolao, G. (2010) · Automatica · doi:10.1016/j.automatica.2009.10.031 · Cited by 479
Metadata
- Authors
- Iusem, A. N.
- Venue
- International Encyclopedia of the Social & Behavioral Sciences
- Publisher
- Elsevier
- Published
- 2001
- Pages
- 8868-8874
- OpenAlex
- W3147239081
- Cited by
- 460
- References
- 18
- Type
- reference entry
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Linear and Nonlinear Programming. https://app.cochat.ai/papers/10.1016/b0-08-043076-7/00610-0
- The paper
- Iusem, A. N. (2001). Linear and Nonlinear Programming. International Encyclopedia of the Social & Behavioral Sciences. https://doi.org/10.1016/b0-08-043076-7/00610-0
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.