The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
Abstract
In this paper, we describe our implementation of a primal-dual infeasible-interior-point algorithm for large-scale linear programming under the MATLAB environment. The resulting software is called LIPSOL — Linear-programming Interior-Point SOLvers. LIPSOL is designed to take the advantages of MATLAB's sparse-matrix functions and external interface facilities, and of existing Fortran sparse Cholesky codes. Under the MATLAB environment, LIPSOL inherits a high degree of simplicity and versatility in comparison to its counterparts in Fortran or C language. More importantly, our extensive computational results demonstrate that LIPSOL also attains an impressive performance comparable with that of efficient Fortran or C codes in solving large-scale problems. In addition, we discuss in detail a technique for overcoming numerical instability in Cholesky factorization at the end-stage of iterations in interior-point algorithms.
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
Iterative Solution of Nonlinear Equations in Several Variables
Ortega, J. M., & Rheinboldt, W. C. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719468 · Cited by 6,860
A new polynomial-time algorithm for linear programming
Karmarkar, N. (1984) · Combinatorica · doi:10.1007/bf02579150 · Cited by 4,794
Iterative Solution of Nonlinear Equations in Several Variables
I., E., Ortega, J. M., & Rheinboldt, W. C. (1971) · Mathematics of Computation · doi:10.2307/2004942 · Cited by 4,408
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
Iterative solution of nonlinear equations
Murphy, R. D. (1994) · Cited by 1,192
A Primal-Dual Interior Point Algorithm for Linear Programming
Kojima, M., Mizuno, S., & Yoshise, A. (1989) · Springer eBooks · doi:10.1007/978-1-4613-9617-8_2 · Cited by 517
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
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
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
Implementation 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
Cited by
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Sturm, J. F. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805766 · Cited by 7,377
A spectral technique for correspondence problems using pairwise constraints
Leordeanu, M., & Hebert, M. (2005) · Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 · doi:10.1109/iccv.2005.20 · Cited by 1,222
Solving semidefinite-quadratic-linear programs using SDPT3
T�t�nc�, R. H., Toh, K. C., & Todd, M. J. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0347-5 · Cited by 1,152
Convergence Time Optimization for Federated Learning Over Wireless Networks
Chen, M., Poor, H. V., Saad, W., & Cui, S. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.3042530 · Cited by 403
Interior Point Methods for Nonlinear Optimization
Pólik, I., & Terlaky, T. (2010) · Lecture Notes in Mathematics · doi:10.1007/978-3-642-11339-0_4 · Cited by 394
Metadata
- Authors
- Zhang, Y.
- Venue
- Optimization Methods and Software
- Publisher
- Informa UK Limited
- Published
- 1998-01
- Volume
- 10
- Issue
- 1
- Pages
- 1-31
- ISSN
- 1026-7670 (ISSN-L)
- 1055-6788
- 1029-4937
- OpenAlex
- W2006884874
- Cited by
- 320
- References
- 11
- FWCI
- 9.08
- 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: Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†. https://app.cochat.ai/papers/10.1080/10556789808805699
- The paper
- Zhang, Y. (1998). Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†. Optimization Methods and Software. https://doi.org/10.1080/10556789808805699
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.