The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
A polynomial-time algorithm, based on Newton's method, for linear 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
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
The algebraic eigenvalue problem
Wilkinson, J. H. (1965) · Cited by 5,833
The Algebraic Eigenvalue Problem
I., E., & Wilkinson, J. H. (1966) · Mathematics of Computation · doi:10.2307/2003558 · Cited by 5,140
A new polynomial-time algorithm for linear programming
Karmarkar, N. (1984) · Combinatorica · doi:10.1007/bf02579150 · Cited by 4,794
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
Proceedings of the 55th Annual ACM Symposium on Theory of Computing
(2023) · doi:10.1145/3564246 · Cited by 587
Cited by
Numerical Continuation Methods
Allgower, E. L., & Georg, K. (1990) · Springer Series in Computational Mathematics · doi:10.1007/978-3-642-61257-2 · Cited by 1,269
Disciplined Convex Programming
Grant, M., Boyd, S., & Ye, Y. (2006) · Nonconvex Optimization and Its Applications · doi:10.1007/0-387-30528-9_7 · Cited by 1,026
Potra, F. A., & Wright, S. J. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00433-7 · Cited by 726
Determinant Maximization with Linear Matrix Inequality Constraints
Vandenberghe, L., Boyd, S., & Wu, S.-P. (1998) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479896303430 · Cited by 652
Portnoy, S., & Koenker, R. (1997) · Statistical Science · doi:10.1214/ss/1030037960 · Cited by 557
Interior path following primal-dual algorithms. part I: Linear programming
Monteiro, R. D. C., & Adler, I. (1989) · Mathematical Programming · doi:10.1007/bf01587075 · Cited by 486
Interior point methods 25 years later
Gondzio, J. (2012) · European Journal of Operational Research · doi:10.1016/j.ejor.2011.09.017 · Cited by 377
An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
Ye, Y., Todd, M. J., & Mizuno, S. (1994) · Mathematics of Operations Research · doi:10.1287/moor.19.1.53 · Cited by 354
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Path-Following Methods for Linear Programming
Gonzaga, C. C. (1992) · SIAM Review · doi:10.1137/1034048 · Cited by 341
Metadata
- Authors
- Renegar, J.
- Venue
- Mathematical Programming
- Published
- 1988-01
- Volume
- 40-40
- Issue
- 1-3
- Pages
- 59-93
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W1973117121
- Cited by
- 588
- References
- 6
- FWCI
- 41.82
- 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.