Systems Optimization Laboratory
Stanford, CA 943054121 USA

SOL Classics
A few early papers are collected here (not easily available elsewhere):
 G. B. Dantzig (1973).
On the need for a Systems Optimization Laboratory,
pp. 132 in
Mathematical Programming,
T. C. Hu and S. M. Robinson (Eds.),
Academic Press, New York and London.
(This is the reference for the original singleauthor paper.)
 G. B. Dantzig, R. W. Cottle, B. C. Eaves, F. S. Hillier,
A. S. Manne, G. H. Golub, D. J. Wilde, and R. B. Wilson (1974).
On the need for a Systems Optimization Laboratory,
pp. 322 in
Optimization Methods for Resource Allocation
(Proc. NATO Conf., Elsinore, 1971),
R. W. Cottle and J. Krarup (Eds.),
English Universities Press, London.
(This is a multiauthor version of the same paper.)
 M. A. Saunders (1972).
Largescale linear programming using the Cholesky factorization,
Report STANCS72252,
Computer Science Department, Stanford University.
 P. E. Gill, G. H. Golub, W. Murray, and M. A. Saunders (1974).
Methods for modifying matrix factorizations,
Mathematics of Computation 28(126), 505535.
 M. A. Saunders (1976).
The complexity of LU updating,
in R. S. Anderssen and R. P. Brent (Eds.),
The Complexity of Computational Problem Solving,
pp. 214230, University of Queensland Press.
 M. A. Saunders (1979).
Sparse least squares by conjugate gradients:
A comparison of preconditioning methods,
pp 1520 in Proceedings of Computer Science and Statistics:
12th Annual Symposium on the Interface,
J. F. Gentleman (Ed.), University of Waterloo.
 P. E. Gill, W. Murray, M. A. Saunders, J. A. Tomlin and M. H. Wright (1986).
On projected Newton barrier methods for linear programming
and an equivalence to Karmarkar's projective method,
Math. Prog. 36, 183209.
