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.gz10322236000
mater-2.dat.gz4231014165000
mater-3.dat.gz14393588591000
mater-4.dat.gz4807124982071000
mater-5.dat.gz10143268204445000
mater-6.dat.gz20463563119032000
trto1.dat.gz3625+361176
trto2.dat.gz14491+1444548
trto3.dat.gz544321+54418268
trto4.dat.gz1200673+120047480
trto5.dat.gz32801761+3280111664
buck1.dat.gz3649+362339
buck2.dat.gz144193+1448984
buck3.dat.gz544641+54437520
buck4.dat.gz12001345+120094998
buck5.dat.gz32803521+3280219738
vibra1.dat.gz3649+362175
vibra2.dat.gz144193+1448390
vibra3.dat.gz544641+54433363
vibra4.dat.gz12001345+120086606
vibra5.dat.gz32803521+3280205764
shmup1.dat.gz
1681+324345
shmup2.dat.gz
200881+40056365
shmup3.dat.gz
4201801+840130372
shmup4.dat.gz
8003361+1600236562
shmup5.dat.gz
18007441+3600526427
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.