Systems Optimization Laboratory
Stanford, CA 94305-4121 USA
Iterative solvers for sparse Ax = b:
Iterative solvers for sparse least-squares problems:
Sparse and dense LU factorization (direct methods):
Nullspace of sparse matrix via SPQR or LUSOL:
Optimization with convex objective and linear constraints:
PDCO (including sparse optimization)
Convex optimization in composite form:
Fortran 90 quad-precision dotproduct of double-precision vectors
Licensed optimization software
MINOS, LSSOL, NPSOL, QPOPT, SQOPT, SNOPT
for user's guides to each of those solvers.
These packages are freely available
to faculty and students at Stanford University and UC San Diego.
|| Academic (and Nonprofit)
|| Nonacademic individual and site
|| Commercial redistribution
||OTL (Evan Elder)
UCSD/Stanford Optimization Software
for information about the solvers SNOPT, DNOPT, NPSOL, SQOPT, SQIC.
TOMLAB is a MATLAB environment for optimization.
It provides an interface to
MINOS, LSSOL, NPSOL, SQOPT, SNOPT,
and many other solvers for many different problem types.
TOMLAB at Stanford
TOMLAB is installed on the Stanford Linux cluster (March 31, 2011).
To gain access, login to the cluster (e.g. ssh corn) and proceed
The following solvers are licensed:
Tomlab/Base, SOL, CGO, CPLEX, MAD
module load matlab