This page is part of the SOL Manual. See SOL.
The SOL solvers are a set of Fortran solvers that were developed by the Stanford Systems Optimization Laboratory (SOL). #Table: The SOL optimization solvers in TOMLAB /SOL. lists the solvers included in TOMLAB /SOL. The solvers are called using a set of MEX-file interfaces developed as part of TOMLAB. All functionality of the SOL solvers are available and changeable in the TOMLAB framework in Matlab.
Detailed descriptions of the TOMLAB /SOL solvers are given in the following sections. Also see the M-file help for each solver.
The solvers reference guides for the TOMLAB /SOL solvers are available for download from the TOMLAB home page http://tomopt.com. There is also detailed instruction for using the solvers in SOL Using the SOL Solvers in TOMLAB. Extensive TOMLAB m-file help is also available, for example help snoptTL in Matlab will display the features of the SNOPT solver using the TOMLAB format.
TOMLAB /SOL solves nonlinear optimization problems (con) defined as
where , , ,
quadratic programming (qp) problems defined as
where , , , and .
linear programming (lp) problems defined as
where , , and .
linear least squares (lls) problems defined as
where , , , ,
and constrained nonlinear least squares problems defined as
where , ,
, and .
Table: The SOL optimization solvers in TOMLAB /SOL.
||Sparse linear and nonlinear programming with linear and nonlinear constraints.
||A special version of the MINOS 5.5 MEX-file interface for sparse linear programming.
||A special version of the MINOS 5.5 MEX-file interface for sparse quadratic programming.
||Dense linear programming.
||Non-convex quadratic programming with dense constraint matrix and sparse or dense quadratic matrix.
||Dense linear and quadratic programs (convex), and constrained linear least squares problems.
||Constrained nonlinear least squares. NLSSOL is based on NPSOL. No reference except for general NPSOL reference.
||Dense linear and nonlinear programming with linear and nonlinear constraints.
||Large, sparse linear and nonlinear programming with linear and nonlinear constraints.
||Sparse convex quadratic programming.