GAMS — The Solver Manuals - Available Software

PATH References
[1] A. R. Conn, Constrained optimization using a nondifferentiable penalty function, SIAM J. Numer. Anal.,
10 (1973), pp. 760–779.
[2] G. B. Dantzig, Linear Programming and Extensions, Princeton University Press, Princeton, New Jersey,
1963.
[3] S. K. Eldersveld, Large-scale sequential quadratic programming algorithms, PhD thesis, Department of
Operations Research, Stanford University, Stanford, CA, 1991.
[4] R. Fletcher, An l 1 penalty method for nonlinear constraints, in Numerical Optimization 1984, P. T. Boggs,
R. H. Byrd, and R. B. Schnabel, eds., Philadelphia, 1985, SIAM, pp. 26–40.
[5] R. Fourer, Solving staircase linear programs by the simplex method. 1: Inversion, Math. Prog., 23 (1982),
pp. 274–313.
[6] P. E. Gill, W. Murray, and M. A. Saunders, SNOPT: An SQP algorithm for large-scale constrained
optimization, SIAM J. Optim., 12 (2002), pp. 979-1006.
[7] , SNOPT: An SQP algorithm for large-scale constrained optimization, SIAM Rev., 47 (2005), pp. 99-131.
[8] , Users guide for SQOPT Version 7: Software for large-scale linear and quadratic programming, Numerical
Analysis Report 2006-1, Department of Mathematics, University of California, San Diego, La Jolla, CA,
2006.
[9] P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright, User’s guide for NPSOL (Version
4.0): a Fortran package for nonlinear programming, Report SOL 86-2, Department of Operations Research,
Stanford University, Stanford, CA, 1986.
[10] , A practical anti-cycling procedure for linearly constrained optimization, Math. Prog., 45 (1989),
pp. 437–474.
[11] , Some theoretical properties of an augmented Lagrangian merit function, in Advances in Optimization
and Parallel Computing, P. M. Pardalos, ed., North Holland, North Holland, 1992, pp. 101–128.
[12] , Sparse matrix methods in optimization, SIAM J. on Scientific and Statistical Computing, 5 (1984),
pp. 562–589.
[13] , Maintaining LU factors of a general sparse matrix, Linear Algebra and its Applications, 88/89 (1987),
pp. 239–270.
[14] B. A. Murtagh and M. A. Saunders, Large-scale linearly constrained optimization, Math. Prog., 14
(1978), pp. 41–72.
[15] , A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints, Math. Prog.
Study, 16 (1982), pp. 84–117.
[16] , MINOS 5.5 User’s Guide, Report SOL 83-20R, Department of Operations Research, Stanford University,
Stanford, CA, Revised 1998.