The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Path-Following Methods for Linear Programming
Abstract
In this paper a unified treatment of algorithms is described for linear programming methods based on the central path. This path is a curve along which the cost decreases, and that stays always far from the boundary of the feasible set. Several parameterizations of this curve are described in primal and primal-dual problems, and it is shown how different algorithms are obtained by following the curve using different parameterizations. Polynomial algorithms are obtained by following the curve approximately, and this concept becomes precise by using explicit rules for measuring the proximity of a point in relation to the central path.
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
Theory of Linear and Integer Programming
Letchford, A. N., & Schrijver, A. (2000) · The Journal of the Operational Research Society · doi:10.2307/253980 · Cited by 5,515
A new polynomial-time algorithm for linear programming
Karmarkar, N. (1984) · Combinatorica · doi:10.1007/bf02579150 · Cited by 4,794
Linear Programming and Extensions
Dantzig, G. (1963) · Princeton University Press eBooks · doi:10.1515/9781400884179 · Cited by 2,713
Theory of Linear and Integer Programming
Smith, D. K. (1987) · Journal of the Operational Research Society · doi:10.1057/jors.1987.94 · Cited by 2,708
Nonlinear Programming: Sequential Unconstrained Minimization Techniques
Fiacco, A. V., & McCormick, G. P. (1968) · Defense Technical Information Center (DTIC) · Cited by 2,262
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
Nonlinear Programming--Sequential Unconstrained Minimization Techniques
Powell, M. J. D. (1969) · The Computer Journal · doi:10.1093/comjnl/12.3.207-a · Cited by 1,757
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
Computational methods in optimization
Polak, E. (1971) · Cited by 941
HOW GOOD IS THE SIMPLEX ALGORITHM
Klee, V. L., & Minty, G. J. (1970) · Cited by 769
Linear Programming in Linear Time When the Dimension Is Fixed
Megiddo, N. (1984) · Journal of the ACM · doi:10.1145/2422.322418 · Cited by 669
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
Gill, P. E., Murray, W., Saunders, M. A., et al. (1986) · Mathematical Programming · doi:10.1007/bf02592025 · Cited by 446
Feature Article—The Ellipsoid Method: A Survey
Bland, R. G., Goldfarb, D., & Todd, M. J. (1981) · Operations Research · doi:10.1287/opre.29.6.1039 · Cited by 389
A modification of karmarkar's linear programming algorithm
Vanderbei, R. J., Meketon, M. S., & Freedman, B. A. (1986) · Algorithmica · doi:10.1007/bf01840454 · Cited by 357
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
The Ellipsoid Method: A Survey
Bland, R. G., Goldfarb, D., & Todd, M. J. (1980) · eCommons (Cornell University) · Cited by 334
Progress in mathematical programming — interior-point and related methods
Tolla, P. (1990) · European Journal of Operational Research · doi:10.1016/0377-2217(90)90098-v · Cited by 183
An $$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
Utilization of the operation of space dilatation in the minimization of convex functions
Shor, N. Z. (1972) · Cybernetics and Systems Analysis · doi:10.1007/bf02341816 · Cited by 105
Solving matching problems with linear programming
Grötschel, M., & Holland, O. E. (1985) · Mathematical Programming · doi:10.1007/bf01584376 · Cited by 88
Solving combinatorial optimization problems using Karmarkar's algorithm
Mitchell, J. E., & Todd, M. J. (1992) · Mathematical Programming · doi:10.1007/bf01580902 · Cited by 82
Freund, R. M. (1991) · Mathematical Programming · doi:10.1007/bf01586933 · Cited by 78
An Algorithm for Convex Quadratic Programming That Requires O ( n 3.5 L ) Arithmetic Operations
Mehrotra, S., & Sun, J. (1990) · Mathematics of Operations Research · doi:10.1287/moor.15.2.342 · Cited by 47
A new polynomial time method for a linear complementarity problem
Mizuno, S. (1992) · Mathematical Programming · doi:10.1007/bf01580891 · Cited by 47
Cited by
Vandenberghe, L., & Boyd, S. (1996) · SIAM Review · doi:10.1137/1038003 · Cited by 4,105
A trust region method based on interior point techniques for nonlinear programming
Byrd, R. H., Gilbert, J. C., & Nocedal, J. (2000) · Mathematical Programming · doi:10.1007/pl00011391 · Cited by 1,638
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
Optimal reactive dispatch through interior point methods
Granville, S. (1994) · IEEE Transactions on Power Systems · doi:10.1109/59.317548 · Cited by 876
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
- Gonzaga, C. C.
- Venue
- SIAM Review
- Published
- 1992-06
- Volume
- 34
- Issue
- 2
- Pages
- 167-224
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2036622774
- Cited by
- 341
- References
- 27
- FWCI
- 20.20
- 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.