The DOI matches its Crossref record; 53 of the 53 references it cites were found in a registry or an index.
Interior point methods 25 years later
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
Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
Einstein, A., Podolsky, B., & Rosen, N. (1935) · Physical Review · doi:10.1103/physrev.47.777 · Cited by 16,654
On the Einstein Podolsky Rosen paradox
Bell, J. S. (1964) · Physics Physique Fizika · doi:10.1103/physicsphysiquefizika.1.195 · Cited by 12,252
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Methods of conjugate gradients for solving linear systems
Hestenes, M. R., & Stiefel, E. (1952) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.049.044 · Cited by 8,132
Linear Programming and Extensions
Dantzig, G. (1963) · RAND Corporation eBooks · doi:10.7249/r366 · Cited by 5,755
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
Introductory Lectures on Convex Optimization: A Basic Course
Nesterov, Y. E. (2014) · Medical Entomology and Zoology · Cited by 3,557
Mangasarian, O. L. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971255 · Cited by 3,220
Introductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698
Smooth minimization of non-smooth functions
Nesterov, Y. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0552-5 · Cited by 2,455
Applications of second-order cone programming
Lobo, M. S., Vandenberghe, L., Boyd, S., & Lebret, H. (1998) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(98)10032-0 · Cited by 2,401
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
Numerical solution of saddle point problems
Benzi, M., Golub, G. H., & Liesen, J. (2005) · Acta Numerica · doi:10.1017/s0962492904000212 · Cited by 2,300
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
Iterative methods for linear and nonlinear equations
(1996) · Choice Reviews Online · doi:10.5860/choice.33-4556 · Cited by 1,947
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
Direct Methods for Sparse Matrices
Duff, I. S., Erisman, A. M., & Reid, J. K. (2017) · doi:10.1093/acprof:oso/9780198508380.001.0001 · Cited by 1,604
Dembo, R. S., Eisenstat, S. C., & Steihaug, T. (1982) · SIAM Journal on Numerical Analysis · doi:10.1137/0719025 · Cited by 1,539
(2009) · Springer eBooks · doi:10.1007/978-0-387-74759-0 · Cited by 815
HOW GOOD IS THE SIMPLEX ALGORITHM
Klee, V. L., & Minty, G. J. (1970) · Cited by 769
Interior Methods for Nonlinear Optimization
Forsgren, A., Gill, P. E., & Wright, M. H. (2002) · SIAM Review · doi:10.1137/s0036144502414942 · Cited by 699
QAPLIB – A Quadratic Assignment Problem Library
Burkard, R. E., Karisch, S. E., & Rendl, F. (1997) · Journal of Global Optimization · doi:10.1023/a:1008293323270 · Cited by 654
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
An Interior-Point Algorithm for Nonconvex Nonlinear Programming
Vanderbei, R. J., & Shanno, D. F. (1999) · Computational Optimization and Applications · doi:10.1023/a:1008677427361 · Cited by 526
Violations of Local Realism by Two EntangledN-Dimensional Systems Are Stronger than for Two Qubits
Kaszlikowski, D., Gnaciński, P., Żukowski, M., Miklaszewski, W., & Zeilinger, A. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4418 · Cited by 507
LOQO:an interior point code for quadratic programming
Vanderbei, R. J. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805759 · Cited by 471
Gill, P. E., Murray, W., Saunders, M. A., et al. (1986) · Mathematical Programming · doi:10.1007/bf02592025 · Cited by 446
An experimental test of non-local realism
Gröblacher, S., Paterek, T., Kaltenbaek, R., Brukner, Č., Żukowski, M., Aspelmeyer, M., & Zeilinger, A. (2007) · Nature · doi:10.1038/nature05677 · Cited by 419
Path-Following Methods for Linear Programming
Gonzaga, C. C. (1992) · SIAM Review · doi:10.1137/1034048 · Cited by 341
Constraint Preconditioning for Indefinite Linear Systems
Keller, C., Gould, N. I. M., & Wathen, A. (2000) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479899351805 · Cited by 334
Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
Lustig, I. J., Marsten, R. E., & Shanno, D. F. (1994) · INFORMS journal on computing · doi:10.1287/ijoc.6.1.1 · Cited by 315
The quadratic assignment problem: A survey and recent developments
Pardalos, P., Rendl, F., & Wolkowicz, H. (1994) · DIMACS Series in Discrete Mathematics and Theoretical Computer Science · doi:10.1090/dimacs/016/01 · Cited by 294
A 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
Object-oriented software for quadratic programming
Gertz, E. M., & Wright, S. J. (2003) · ACM Transactions on Mathematical Software · doi:10.1145/641876.641880 · Cited by 253
Multiple centrality corrections in a primal-dual method for linear programming
Gondzio, J. (1996) · Computational Optimization and Applications · doi:10.1007/bf00249643 · Cited by 243
Self-citationImplementation of Interior Point Methods for Large Scale Linear ProgrammingPreprint
Andersen, E. D., Gondzio, J., Mészáros, C., & Xu, X. (1996) · RePEc: Research Papers in Economics · Cited by 223
Self-citationSymmetric Quasidefinite Matrices
Vanderbei, R. J. (1995) · SIAM Journal on Optimization · doi:10.1137/0805005 · Cited by 202
Altman, A., & Gondzio, J. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805754 · Cited by 184
Self-citationComputational Techniques of the Simplex Method
Maros, I. (2003) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4615-0257-9 · Cited by 173
On scaled projections and pseudoinverses
Stewart, G. W. (1989) · Linear Algebra and its Applications · doi:10.1016/0024-3795(89)90594-6 · Cited by 134
Commentary—Progress in Linear Programming
Bixby, R. E. (1994) · INFORMS journal on computing · doi:10.1287/ijoc.6.1.15 · Cited by 88
Matrix-free interior point method
Gondzio, J. (2010) · Computational Optimization and Applications · doi:10.1007/s10589-010-9361-3 · Cited by 84
Self-citationTowards a practical parallelisation of the simplex method
Hall, J. A. J. (2008) · Computational Management Science · doi:10.1007/s10287-008-0080-5 · Cited by 59
Solving non-linear portfolio optimization problems with the primal-dual interior point method
Gondzio, J., & Grothey, A. (2006) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.03.006 · Cited by 52
Self-citationInertia-Revealing Preconditioning For Large-Scale Nonconvex Constrained Optimization
Schenk, O., Wächter, A., & Weiser, M. (2008) · SIAM Journal on Scientific Computing · doi:10.1137/070707233 · Cited by 50
Critical visibility forN-particle Greenberger-Horne-Zeilinger correlations to violate local realism
Żukowski, M., & Kaszlikowski, D. (1997) · Physical Review A · doi:10.1103/physreva.56.r1682 · Cited by 48
Chai, J.-S., & Toh, K.-C. (2007) · Computational Optimization and Applications · doi:10.1007/s10589-006-9006-8 · Cited by 34
Nonclassicality thresholds for multiqubit states: Numerical analysis
Gruca, J., Laskowski, W., Żukowski, M., Kiesel, N., Wieczorek, W., Schmid, C., & Weinfurter, H. (2010) · Physical Review A · doi:10.1103/physreva.82.012118 · Cited by 34
Bound entanglement and local realism
Kaszlikowski, D., Żukowski, M., & Gnaciński, P. (2002) · Physical Review A · doi:10.1103/physreva.65.032107 · Cited by 8
Cited by
Multiobjective Optimization for Computation Offloading in Fog Computing
Liu, L., Chang, Z., Guo, X., Mao, S., & Ristaniemi, T. (2018) · IEEE Internet of Things Journal · doi:10.1109/jiot.2017.2780236 · Cited by 512
Nir, T. M., Jahanshad, N., Villalon‐Reina, J. E., Isaev, D., Zavaliangos‐Petropulu, A., Zhan, L., Leow, A. D., Jack, C. R., Weiner, M. W., Thompson, P. M., et al. (2017) · Magnetic Resonance in Medicine · doi:10.1002/mrm.26623 · Cited by 34
Quantum algorithm for metabolic network analysis
Joshi, A., & Koyama, T. (2026) · Machine Learning with Applications · doi:10.1016/j.mlwa.2026.100913
Metadata
- Authors
- Gondzio, J.
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 2012-05
- Volume
- 218
- Issue
- 3
- Pages
- 587-601
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W2068531154
- Cited by
- 377
- References
- 53
- FWCI
- 10.12
- Type
- journal article
- Language
- en
- Open access
- green
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.