Download MINOS 5.51 User`s Guide

134
BIBLIOGRAPHY
[GMSW79] P. E. Gill, W. Murray, M. A. Saunders and M. H. Wright (1979). Two step-length
algorithms for numerical optimization, Report SOL 79-25, Department of Operations
Research, Stanford University, California.
[GMSW87] P. E. Gill, W. Murray, M. A. Saunders and M. H. Wright (1987). Maintaining LU factors
of a general sparse matrix, Linear Algebra and its Applications 88/89, 239–270.
[GMSW89] P. E. Gill, W. Murray, M. A. Saunders and M. H. Wright (1989). A practical anticycling procedure for linearly constrained optimization, Mathematical Programming 45,
437–474.
[Him72]
D. M. Himmelblau (1972). Applied Nonlinear Programming, McGraw-Hill.
[LHKK79] C. L. Lawson, R. J. Hanson, D. R. Kincaid and F. T. Krogh (1979). Basic Linear
Algebra Subprograms for Fortran usage, ACM Transactions on Mathematical Software
5, 308–323 and (Algorithm) 324–325.
[Man77]
A. S. Manne (1977). ETA-MACRO: A Model of Energy-Economy Interactions, in C. J.
Hitch (ed.), Modeling Energy-Economy Interactions, Resources for the Future, Washington, DC. Also in R. Pindyck (ed.), Advances in the Economics of Energy and Resources,
Vol. 2: The Production and Pricing of Energy Resources, JAI Press, Inc., Greenwich,
Connecticut, 1979, 205–233.
[Man79]
A. S. Manne (1979). Private communication.
[MS78]
B. A. Murtagh and M. A. Saunders (1978). Large-scale linearly constrained optimization,
Mathematical Programming 14, 41–72.
[MS82]
B. A. Murtagh and M. A. Saunders (1982). A projected Lagrangian algorithm and its
implementation for sparse nonlinear constraints, Mathematical Programming Study 16,
Algorithms for Constrained Minimization of Smooth Nonlinear Functions, 84–117.
[Pre80]
P. V. Preckel (1980). Modules for use with MINOS/AUGMENTED in solving sequences
of mathematical programs, Report SOL 80-15, Department of Operations Research,
Stanford University, California.
[Reid76]
J. K. Reid (1976). Fortran subroutines for handling sparse linear programming bases,
Report R8269, Atomic Energy Research Establishment, Harwell, England.
[Reid82]
J. K. Reid (1982). A sparsity-exploiting variant of the Bartels-Golub decomposition for
linear programming bases, Mathematical Programming 24, 55–69.
[Rob72]
S. M. Robinson (1972). A quadratically convergent algorithm for general nonlinear programming problems, Mathematical Programming 3, 145–156.
[RK72]
J. B. Rosen and J. Kreuser (1972). A gradient projection algorithm for nonlinear constraints, in F. A. Lootsma (ed.), Numerical Methods for Nonlinear Optimization, Academic Press, London and New York, 297–300.
[Ros60]
H. H. Rosenbrock (1960). An automatic method for finding the greatest or least value
of a function, Computer Journal 3, 175–184.
[Sau76]
M. A. Saunders (1976). A fast, stable implementation of the simplex method using
Bartels-Golub updating, in J. R. Bunch and D. J. Rose (eds.), Sparse Matrix Computations, Academic Press, New York, 213–226.