Scaling of run "time" with number of constraints
Expected running time (ERT in number of evaluations as log10 value), divided by dimension for target function value 10^{−6} versus number of constraints. Slanted grid lines indicate quadratic scaling with the dimension. Different symbols correspond to different algorithms given in the legend of f1 − f54. If the success ratio is < 1/2 and > 0 the symbol is annotated with the number of successes. Light symbols give the maximum number of evaluations from the longest trial divided by dimension. Black stars (if present) indicate a statistically better result compared to all other algorithms with p < 0.01 and Bonferroni correction number of constraints (six). Legend: ○: AL1-CMA-ES Dufosse, ♢: AL2-CMA-ES Dufosse, ☆: AL3-CMA-ES Dufosse, +: AL4-CMA-ES Dufosse, ⬠: BPepsMAg Hellwig, ▼: COBYLA Dufosse, x: RandomSearch-5 Dufosse, △: epsMAg Hellwig, ◇: fmincon Hellwig