Difficult SDP problems

This page contains SDP relaxation problems in our paper "Strange behavior of Interior-point Methods for Solving Semidefinite Programming Problems in Polynomial Optimization" by H. Waki, M. Nakata and M. Muramatsu. As we have mentioned in this paper, the standard SDP solvers, such as SeDuMi, SDPA, CSDP and SDPT3, return the wrong values "1" as the optimal value for these SDP problems. In contrast, SDPA-GMP returns the correct value "0". 


If you are interesting in these results in our paper, please challenge to solve SDP problems attached in this page by your SDP solver. And, if you can find the correct value by your algorithms and/or solvers, please let us know. 

Written by Hayato Waki (2009-09-11)
Č
ċ
ď
unboundDim1R1.dat-s
(0k)
Hayato Waki,
2009/09/05 0:01
ċ
ď
unboundDim1R2.dat-s
(1k)
Hayato Waki,
2009/09/05 0:01
ċ
ď
unboundDim1R3.dat-s
(1k)
Hayato Waki,
2009/09/05 0:01
ċ
ď
unboundDim1R4.dat-s
(2k)
Hayato Waki,
2009/09/05 0:01
ċ
ď
unboundDim1R5.dat-s
(2k)
Hayato Waki,
2009/09/05 0:01
ċ
ď
unboundDim1R6.dat-s
(3k)
Hayato Waki,
2009/09/05 0:02