Abstract
Probably more than any other group, authors Lustig, Marsten, and Shanno have led the way in demonstrating the effectiveness of interior methods for solving large, real-world linear programs. For several years they have written at length about things they have actually done. There are no pies in the sky, no secrets. They have explored a multitude of algorithmic ideas and implementation strategies, and they have done more than could be asked to share their experience with the rest of the world. Here, the authors look back on a decade's events that revived barrier methods for constrained optimization and eventually led to their production LP solver OB1. The results reported are indeed impressive. In this commentary, we focus mostly on the “engine”—the Cholesky factorizer—that has made OB1 such a practical success. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.
Keywords
SolverCholesky decompositionComputer scienceMultitudeOperations researchData sciencePolitical scienceEngineeringLaw
Affiliated Institutions
Related Publications
Commentary—Progress in Linear Programming
There is little doubt that barrier methods are now indispensable tools in the solution of large-scale linear programming problems. However, it is our opinion that the results of...
Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
A survey of the significant developments in the field of interior point methods for linear programming is presented, beginning with Karmarkar's projective algorithm and concentr...
Commentary—Interior-Point Methods: Algorithms and Formulations
The paper by Lustig, Marsten, and Shanno (LMS) gives an excellent presentation of the current state of the art for interior-point methods (as represented by their OB1 code) as i...
Commentary—Theory and Practice for Interior-Point Methods
The last decade has been a fascinating time for researchers interested in linear programming and its extensions. It opened with Narendra Karmarkar's theoretical paper on the com...
State-of-the-Art Survey—The Traveling Salesman Problem: A Neural Network Perspective
This paper surveys the “neurally” inspired problem-solving approaches to the traveling salesman problem, namely, the Hopfield-Tank network, the elastic net, and the self-organiz...
Publication Info
- Year
- 1994
- Type
- article
- Volume
- 6
- Issue
- 1
- Pages
- 23-27
- Citations
- 15
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
15
OpenAlex
0
Influential
11
CrossRef
Cite This
Michael A. Saunders
(1994).
Commentary—Major Cholesky Would Feel Proud.
INFORMS Journal on Computing
, 6
(1)
, 23-27.
https://doi.org/10.1287/ijoc.6.1.23
Identifiers
- DOI
- 10.1287/ijoc.6.1.23