sedumi

The NEOS Server offers SeDuMi (version 1.1R3) for the solution of semidefinite-quadratic-linear (SQL) programming problems in sparse SDPA format or in SeDuMi format.

SeDuMi is a Matlab toolbox for solving optimization problems over symmetric cones, i.e. it allows not only for linear constraints, but also quasiconvex-quadratic constraints and positive semi-definiteness constraints. Complex valued entries are allowed. Features include symbolic and numerical reordering schemes, balancing speed/accuracy performance and sophisticated dense column handling, using the Goldfarb-Scheinberg product form idea.

Source code and documentation are available from the SeDuMi Homepage

Development of SeDuMi was started by Jos Sturm and continued at AdvOpLab
This solver was implemented by Hans Mittelmann and executes at under

Using the NEOS Server for SeDuMi

The user must submit a model in sparse SDPA format or in SeDuMi format to solve a semidefinite-quadratic-linear programming problem. For SDPA don't 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 addition to SeDuMi's own error output the 6 error measures are printed according to the DIMACS 7th Challenge, see the benchmarking paper. This facilitates comparison with other SDP solvers.
Enter the complete path to the sparse SDPA format data file
SDPA data (no braces, no commas):

Alternatively, enter the complete path to the SeDuMi format data (Matlab binary, containing At b c K)
SeDuMi data:

Method(xz,vl,ls)
Method:

Comments:

e-mail address:

Please do not click the 'Submit to NEOS' button more than once.

_{DOE disclaimer

DOE Web privacy policy}