Systems Optimization Laboratory
Stanford, CA 94305-4121 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. 1-32 in
Mathematical Programming,
T. C. Hu and S. M. Robinson (Eds.),
Academic Press, New York and London.
(This is the reference for the original single-author 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. 3-22 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 multi-author version of the same paper.)
- M. A. Saunders (1972),
Large-scale linear programming using the Cholesky factorization,
Report STAN-CS-72-252,
Computer Science Department, Stanford University.
- P. E. Gill, G. H. Golub, W. Murray, and M. A. Saunders.
Methods for modifying matrix factorizations,
Mathematics of Computation 28(126), 505-535 (1974).
- M. A. Saunders (1976),
The complexity of LU updating,
in R. S. Anderssen and R. P. Brent, editors,
The Complexity of Computational Problem Solving,
pp. 214-230, University of Queensland Press.
- 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, 183-209.
|
