The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
An Interior-Point Algorithm for Nonconvex Nonlinear Programming
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Brook, A., Kendrick, D., & Meeraus, A. (1988) · ACM SIGNUM Newsletter · doi:10.1145/58859.58863 · Cited by 2,973
AMPL : a modeling language for mathematical programming
Fourer, R., & Kernighan, B. W. (1993) · Cited by 1,860
An Interior Point Algorithm for Large-Scale Nonlinear Programming
Byrd, R. H., Hribar, M. E., & Nocedal, J. (1999) · SIAM Journal on Optimization · doi:10.1137/s1052623497325107 · Cited by 1,739
More Test Examples for Nonlinear Programming Codes
Schittkowski, K. (1987) · Lecture notes in economics and mathematical systems · doi:10.1007/978-3-642-61582-5 · Cited by 1,163
Linear Programming: Foundations and Extensions
Vanderbei, R. J. (1998) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600987 · Cited by 921
Self-citationNonlinear programming without a penalty function
Fletcher, R., & Leyffer, S. (2002) · Mathematical Programming · doi:10.1007/s101070100244 · Cited by 874
Test Examples for Nonlinear Programming Codes
Hock, W., & Schittkowski, K. (1981) · Lecture notes in economics and mathematical systems · doi:10.1007/978-3-642-48320-2 · Cited by 645
Antenna array pattern synthesis via convex optimization
Lebret, H., & Boyd, S. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.558465 · Cited by 520
LOQO:an interior point code for quadratic programming
Vanderbei, R. J. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805759 · Cited by 471
Self-citationNonlinear Programming: Sequential Unconstrained Minimization Techniques
Fiacco, A. V., & McCormick, G. P. (1990) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971316 · Cited by 470
Cited by
Wächter, A., & Biegler, L. T. (2006) · Mathematical Programming · doi:10.1007/s10107-004-0559-y · Cited by 9,483
Benchmarking optimization software with performance profiles
Dolan, E. D., & Moré, J. J. (2002) · Mathematical Programming · doi:10.1007/s101070100263 · Cited by 4,412
Guest, J. K., Prévost, J. H., & Belytschko, T. (2004) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.1064 · Cited by 1,300
Knitro: An Integrated Package for Nonlinear Optimization
Byrd, R. H., Nocedal, J., & Waltz, R. A. (2006) · Nonconvex Optimization and Its Applications · doi:10.1007/0-387-30065-1_4 · Cited by 979
Interior Methods for Nonlinear Optimization
Forsgren, A., Gill, P. E., & Wright, M. H. (2002) · SIAM Review · doi:10.1137/s0036144502414942 · Cited by 699
Metadata
- Authors
- Vanderbei, R. J., & Shanno, D. F.
- Venue
- Computational Optimization and Applications
- Published
- 1999-04
- Volume
- 13
- Issue
- 1-3
- Pages
- 231-252
- ISSN
- 0926-6003 (ISSN-L)
- 1573-2894
- OpenAlex
- W1508335918
- Cited by
- 526
- References
- 18
- FWCI
- 21.89
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An Interior-Point Algorithm for Nonconvex Nonlinear Programming. https://app.cochat.ai/papers/10.1023/a:1008677427361
- The paper
- Vanderbei, R. J., & Shanno, D. F. (1999). An Interior-Point Algorithm for Nonconvex Nonlinear Programming. Computational Optimization and Applications. https://doi.org/10.1023/a%3A1008677427361
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.
