![]() Benchmarks Various standard test sets in SeDuMi .mat format. If you are benchmarking SeDuMi please use these distributions, as it takes a lot of time to convert from sparse SDPA format. All test sets are available in both Matlab 6 and 7 format, compressed with zip or tar.gz. More benchmarks and test sets can be found at Hans Mittelmann's page. DocumentsDate added
This package contains all 92 SDPLIB problems in SeDuMi format. The .mat files are saved with Matlab 7. If you are using an earlier version of Matlab please download the package for Matlab 6. The conversion was performed with Jos Sturm's conversion script fromsdpa (part of SeDuMi). If you are benchmarking SeDuMi please use these files, as the conversion took 20 hours on a Pentium 4, 3 GHz computer, plus five days for problem maxG60 on a Unix workstation.
This package contains all 92 SDPLIB problems in SeDuMi format. The .mat files are saved with Matlab 7. If you are using an earlier version of Matlab please download the package for Matlab 6. The conversion was performed with Jos Sturm's conversion script fromsdpa (part of SeDuMi). If you are benchmarking SeDuMi please use these files, as the conversion took 20 hours on a Pentium 4, 3 GHz computer, plus five days for problem maxG60 on a Unix workstation.
This package contains all 92 SDPLIB problems in SeDuMi format. The .mat files are saved with Matlab 6. The conversion was performed with Jos Sturm's conversion script fromsdpa (part of SeDuMi). If you are benchmarking SeDuMi please use these files, as the conversion took 20 hours on a Pentium 4, 3 GHz computer, plus five days for problem maxG60 on a Unix workstation.
This package contains all 92 SDPLIB problems in SeDuMi format. The .mat files are saved with Matlab 7. If you are using an earlier version of Matlab please download the package for Matlab 6. The conversion was performed with Jos Sturm's conversion script fromsdpa (part of SeDuMi). If you are benchmarking SeDuMi please use these files, as the conversion took 20 hours on a Pentium 4, 3 GHz computer, plus five days for problem maxG60 on a Unix workstation.
This is a collection of sparse linear SDP problems arising in structural optimization. While the `trto' problems are `academic' (they can be reformulated as LP and solved much more efficiently), the other two problems have important engineering background. Collected by Michal Kocvara, the author of the Pennon package. For more information visit http://www2.am.uni-erlangen.de/~kocvara/pennon/problems.html.
|

