
Problems: 

Available from Hans Mittlemann: bench marks for two problems from SDPLIB (mcp2501, mcp5001), for 7 other packages, i.e. the relevant numbers are (cputime and sign. digits)
problem CSDP s SDPA s SDPHA s SDPT3 s SP s SeDuMi s SDPpack s =============================================================================== mcp2501 26 7 44 7 1758 7 39 7 1796 5 104 7 6447 7 mcp5001 171 7 492 7 39585 7 361 7 a 1212 7 144376 7Further details about the problems are available from SDPLIB. See also Gset, a group of graph problems from Yinyu Ye. ( from Brian Borchers web page).
Following are a list of related sites as well as descriptions of locally available related papers. (Please send me your comments and/or related papers to add to the bibliography.)
NAME  TYPE  AUTHORS 
CSDP  C  B. Borchers 
DSDP  C  Steve Benson, Yinyu Ye 
MAXDET  Matlab,MEX  Lieven Vandenberghe, Stephen P. Boyd. 
PENNON  AMPL  MICHAL KOCVARA, originally PBM method of BenTal and Zibulevsky. 
SeDuMi 1.1+  Matlab,MEX  Jos F. Sturm, but now at Advanced Optimization Laboratory, at McMaster University, Canada 
SeDuMi 1.05  Matlab,MEX  Jos F. Sturm 
SDPA  C++  K. Fujisawa, M. Kojima, K. Nakata 
SBmethod  C++  Christoph Helmberg 
SDPpack  Matlab,MEX  F. Alizadeh, JP A. Haeberly, M. V. Nayakkankuppam, M. L. Overton, S. Schmieta 
SDPT3  Matlab,MEX  K.C. Toh, M.J. Todd, R.H. Tutuncu 
SIMPLE  Matlab  by Henry Wolkowicz; solves the SDP relaxation of MaxCut 
SP  Matlab,MEX  L. Vandenberghe, S. Boyd 