**Linear semidefinite programming**- SDPLIB collection: table and performance profile
- mater problems (large sparse SDP)
- truss and shape problems (large sparse SDP - yet not as sparse as mater)
**Convex programming**- Convex QP problems: performance profiles

**Nonlinear programming**

- AMPL-NLP problems: performance profiles

is the probability that a performance ratio * r*_{p,s
}is within a factor *tau* of the best possible ratio. For instance,
for *tau *= 2, *rho*_{s}(*tau*) says how often can
solver *s* get results in a time not worse that two-times the time
of the best solver. Also, the higher *rho*_{s}, the higher
is the probability that solver *s* can solve all problems from *P*.

Michal Kocvara