The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
Abstract
We present an O(√nL)-iteration homogeneous and self-dual linear programming (LP) algorithm. The algorithm possesses the following features: • It solves the linear programming problem without any regularity assumption concerning the existence of optimal, feasible, or interior feasible solutions. • It can start at any positive primal-dual pair, feasible or infeasible, near the central ray of the positive orthant (cone), and it does not use any big M penalty parameter or lower bound. • Each iteration solves a system of linear equations whose dimension is almost the same as that solved in the standard (primal-dual) interior-point algorithms. • If the LP problem has a solution, the algorithm generates a sequence that approaches feasibility and optimality simultaneously; if the problem is infeasible or unbounded, the algorithm will correctly detect infeasibility for at least one of the primal and dual problems.
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
A new polynomial-time algorithm for linear programming
Karmarkar, N. (1984) · Combinatorica · doi:10.1007/bf02579150 · Cited by 4,794
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
A polynomial-time algorithm, based on Newton's method, for linear programming
Renegar, J. (1988) · Mathematical Programming · doi:10.1007/bf01580724 · Cited by 588
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
A polynomial-time algorithm for a class of linear complementarity problems
Kojima, M., Mizuno, S., & Yoshise, A. (1989) · Mathematical Programming · doi:10.1007/bf01587074 · Cited by 345
Self-citationA primal—dual infeasible-interior-point algorithm for linear programming
Kojima, M., Megiddo, N., & Mizuno, S. (1993) · Mathematical Programming · doi:10.1007/bf01582151 · Cited by 283
Self-citationAn $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problems
Kojima, M., Mizuno, S., & Yoshise, A. (1991) · Mathematical Programming · doi:10.1007/bf01594942 · Cited by 173
Self-citationFeasibility issues in a primal-dual interior-point method for linear programming
Lustig, I. J. (1990) · Mathematical Programming · doi:10.1007/bf01588785 · Cited by 165
Interior path following primal-dual algorithms
Monteiro, R. D. C., & Adler, I. (1988) · Cited by 163
Convergence behavior of interior-point algorithms
Güler, O., & Ye, Y. (1993) · Mathematical Programming · doi:10.1007/bf01580610 · Cited by 160
Self-citation
Cited by
SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
Toh, K. C., Todd, M. J., & Tütüncü, R. H. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805762 · Cited by 1,894
Self-citationDisciplined 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
Self-citationAndersen, E. D., & Andersen, K. D. (2000) · Applied Optimization · doi:10.1007/978-1-4757-3216-0_8 · Cited by 766
ECOS: An SOCP solver for embedded systems
Domahidi, A., Chu, E., & Boyd, S. (2013) · 2013 European Control Conference (ECC) · doi:10.23919/ecc.2013.6669541 · Cited by 727
Potra, F. A., & Wright, S. J. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00433-7 · Cited by 726
Metadata
- Authors
- Ye, Y., Todd, M. J., & Mizuno, S.
- Venue
- Mathematics of Operations Research
- Published
- 1994-02
- Volume
- 19
- Issue
- 1
- Pages
- 53-67
- ISSN
- 0364-765X (ISSN-L)
- 1526-5471
- OpenAlex
- W2022004439
- Cited by
- 354
- References
- 10
- FWCI
- 15.25
- 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 O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm. https://app.cochat.ai/papers/10.1287/moor.19.1.53
- The paper
- Ye, Y., Todd, M. J., & Mizuno, S. (1994). An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm. Mathematics of Operations Research. https://doi.org/10.1287/moor.19.1.53
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.