sdpa

The NEOS Server offers SDPA (version 7.1,1) for the solution of semidefinite programming problems in sparse SDPA format or in SeDuMi format.

SDPA is a software package for solving semidefinite programs (SDP). It is based on a Mehrotra-type predictor-corrector infeasible primal-dual interior-point method. SDPA handles the standard SDP and its dual. It is implemented in C++ utilizing the LAPACK library with ATLAS BLAS. It exploits sparsity and has dynamic memory (de)allocation.

Source and documentation is available here.

SDPA was developed by Masakazu Kojima and collaborators.

This solver was implemented by Hans Mittelmann and executes at under

Using the NEOS Server for SDPA

The user must submit a model in either sparse SDPA or SeDuMi Matlab format to solve a semidefinite programming problem. 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
Note thet when submitting via e-mail or XML-RPC empty tokens need to be deleted.

If non-standard parameter settings are required, the user may also submit a parameter file. You can download the default parameter file, edit it and resubmit it as part of the job.

In addition to SDPA'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 SDPA data file (sparse SDPA format)
SDPA data:

Alternatively, enter the complete path to the SeDuMi format data (Matlab binary, containing At, b,c,K). Note that only linear and semidefinite constraints may be prescribed
SeDuMi data:

Enter the complete path to the non-standard parameter file
parameter file:

Comments:

e-mail address:

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

_{DOE disclaimer

DOE Web privacy policy}