The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Interior-point methods
Open accessOverview
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
A new polynomial-time algorithm for linear programming
Karmarkar, N. (1984) · Combinatorica · doi:10.1007/bf02579150 · Cited by 4,794
Vandenberghe, L., & Boyd, S. (1996) · SIAM Review · doi:10.1137/1038003 · Cited by 4,105
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Primal-Dual Interior-Point Methods
Wright, S. J. (1997) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971453 · Cited by 2,391
Self-citationNonlinear Programming: Sequential Unconstrained Minimization Techniques
Fiacco, A. V., & McCormick, G. P. (1968) · Defense Technical Information Center (DTIC) · Cited by 2,262
On the Implementation of a Primal-Dual Interior Point Method
Mehrotra, S. (1992) · SIAM Journal on Optimization · doi:10.1137/0802028 · Cited by 1,613
Interior Point Algorithms: Theory and Analysis
Ye, Y. (1997) · Wiley eBooks · doi:10.1002/9781118032701 · Cited by 939
A Mathematical View of Interior-Point Methods in Convex Optimization
Renegar, J. (2001) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718812 · Cited by 631
Self-Scaled Barriers and Interior-Point Methods for Convex Programming
Nesterov, Y. E., & Todd, M. J. (1997) · Mathematics of Operations Research · doi:10.1287/moor.22.1.1 · Cited by 612
Pathways to the Optimal Set in Linear Programming
Megiddo, N. (1989) · Progress in Mathematical Programming · doi:10.1007/978-1-4613-9617-8_8 · Cited by 588
Cited by
Fast Model Predictive Control Using Online Optimization
Wang, Y., & Boyd, S. (2010) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2009.2017934 · Cited by 1,372
Fast online deconvolution of calcium imaging data
Friedrich, J., Zhou, P., & Paninski, L. (2017) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005423 · Cited by 559
Hua, S., & Sun, Z. (2001) · Journal of Molecular Biology · doi:10.1006/jmbi.2001.4580 · Cited by 534
MICOM: Metagenome-Scale Modeling To Infer Metabolic Interactions in the Gut Microbiota
Diener, C., Gibbons, S. M., & Resendis-Antonio, O. (2020) · mSystems · doi:10.1128/msystems.00606-19 · Cited by 309
MPC approaches for modulating air-to-water heat pumps in radiant-floor buildings
Rastegarpour, S., Gros, S., & Ferrarini, L. (2020) · Control Engineering Practice · doi:10.1016/j.conengprac.2019.104209 · Cited by 48
Metadata
- Authors
- Potra, F. A., & Wright, S. J.
- Venue
- Journal of Computational and Applied Mathematics
- Publisher
- Elsevier BV
- Published
- 2000-12
- Volume
- 124
- Issue
- 1-2
- Pages
- 281-302
- ISSN
- 0377-0427 (ISSN-L)
- OpenAlex
- W2071563913
- Cited by
- 726
- References
- 17
- FWCI
- 5.51
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Interior-point methods. https://app.cochat.ai/papers/10.1016/s0377-0427(00)00433-7
- The paper
- Potra, F. A., & Wright, S. J. (2000). Interior-point methods. Journal of Computational and Applied Mathematics. https://doi.org/10.1016/s0377-0427(00)00433-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.