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.

Description of the problems.

Download the individual problems in SDPA format:
 
problem            n                     m  size (bytes)
mater-1.dat.gz 103 222 36000
mater-2.dat.gz 423 1014 165000
mater-3.dat.gz 1439 3588 591000
mater-4.dat.gz 4807 12498 2071000
mater-5.dat.gz 10143 26820 4445000
mater-6.dat.gz 20463 56311 9032000
trto1.dat.gz 36 25+36 1176
trto2.dat.gz 144 91+144 4548
trto3.dat.gz 544 321+544 18268
trto4.dat.gz 1200 673+1200 47480
trto5.dat.gz 3280 1761+3280 111664
buck1.dat.gz 36 49+36 2339
buck2.dat.gz 144 193+144 8984
buck3.dat.gz 544 641+544 37520
buck4.dat.gz 1200 1345+1200 94998
buck5.dat.gz 3280 3521+3280 219738
vibra1.dat.gz 36 49+36 2175
vibra2.dat.gz 144 193+144 8390
vibra3.dat.gz 544 641+544 33363
vibra4.dat.gz 1200 1345+1200 86606
vibra5.dat.gz 3280 3521+3280 205764
shmup1.dat.gz
 16 81+32 4345
shmup2.dat.gz
 200 881+400 56365
shmup3.dat.gz
 420 1801+840 130372
shmup4.dat.gz
 800 3361+1600 236562
shmup5.dat.gz
 1800 7441+3600 526427
n is the number of variables, m the size of the matrix constraint
25+36 means: matrix constraint of size 25 and 36 linear constraints

Back to PENNON homepage.