The NEOS Server offers DSDP for the solution of semidefinite programming
The DSDP software package is an implementation of the dual-scaling
algorithm for semidefinite programming.
This interior-point algorithm has a convergence proof and worst-case
polynomial complexity under mild assumptions on the data. It
provides feasible primal and dual solutions, exploits low-rank structure and
sparsity in the data,
and has low memory requirements compared to other interior-point methods.
This implementation of the algorithm can be used as a set of subroutines,
through Matlab, or by reading and writing to data files. Furthermore, it
offers scalable parallel performance for large problems and a
well documented interface.
Some of the most popular applications of semidefinite programming
are model control, truss topology design, and relaxations of combinatorial
and global optimization problems.
binaries, and documentation are available from the
DSDP using NEOS