The NEOS Server offers SNOPT for the solution of nonlinearly constrained optimization problems in GAMS format. SNOPT is suitable for large nonlinearly constrained problems with a modest number of degrees of freedom.
SNOPT implements a sequential programming algorithm that uses a smooth augmented Lagrangian merit function and makes explicit provision for infeasibility in the original problem and in the quadratic programming subproblems. Additional information on SNOPT can be found in the User's Guide for SNOPT (Version 5.3)
SNOPT was developed by Philip E. Gill, Walter Murray, and Michael Saunders.
An option file can be used to specify SNOPT options. Currently, the NEOS Server can only use optfile=1 with GAMS input. Therefore, any model that specifies a different options file will not work as intended.
The NEOS Server initially limits the amount of output generated in the listing file by turning off the symbol and unique element list, symbol cross references, and restricting the rows and columns listed to zero. This behavior can be changed by specifying the appropriate options in the model file. See the documentation on the modeling language for further information.
You can submit an optimization problem specified in the GAMS modeling language to be solved using the optimization tools on the NEOS Server. You need to specify the absolute path to a GAMS file on your system. Model File:
<modelname>.optfile = 1 ;
optfile = 1
DOE disclaimer DOE Web privacy policy