The NEOS Server offers SDPT3 (version 4.0-beta) for the solution of semidefinite-quadratic-linear (SQL)
programming problems in
sparse SDPA format or in
SeDuMi format.
This software package is a MATLAB implementation of infeasible path-following
algorithms for solving SQL problems.
Mehrotra-type predictor-corrector variants are included.
Two types of search directions are available, namely the HKM
and the NT direction.
Source code and documentation are available
here
.
SDPT3 was developed by
K. C. Toh,
M. J. Todd, and
R. H. Tütüncü
This solver was implemented by
Hans Mittelmann and executes at
Using the NEOS Server for SDPT3
The user must submit a model in
sparse SDPA format or in
SeDuMi
format to solve a semidefinite-quadratic-linear programming problem.
For SDPA do not use braces around or commas between numbers; see the sample
submission problems.
Examples of models in sparse SDPA format can be found in the
SDPLIB library while the SeDuMi format files are at
DIMACS
.
In particular can SOCPs (second order cone problems) be solved with SeDuMi/Matlab input
SDPT3 prints the 6 error measures
according to the DIMACS 7th Challenge, see the
benchmarking paper.
This facilitates comparison with other SDP solvers.
|