NEOS Server Home

NEOS Interfaces to mosek

Sample Submissions
WWW Form - Email - XML-RPC

mosek

The NEOS Server offers MOSEK for the solution of semidefinite programming problems in sparse SDPA format or in SeDuMi format.

MOSEK is a solver for convex problems including general conic optimization problems. It is commercial but available with certain restrictions for students and academics.

This solver was implemented by Hans Mittelmann and executes at


Using the NEOS Server for MOSEK

The user must submit a model in either sparse SDPA or SeDuMi Matlab format to solve a semidefinite programming problem. Note that when submitting via e-mail or XML-RPC empty tokens need to be deleted. Examples of models in sparse SDPA format can be found in the SDPLIB library. The same problems in SeDuMi format are here. Other files in this format are at 7th DIMACS Challenge library.

In addition to MOSEK'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.

Web Submission Form
SDPA data
Enter the complete path to the sparse SDPA format data file
SeDuMi data
Alternatively, enter the complete path to the SeDuMi format data (Matlab binary, containing At b c K).
Comments
Additional Settings


E-Mail address:
Please do not click the 'Submit to NEOS' button more than once.