Scaling of run "time" with dimension
Average running time (aRT in number of f−evaluations as log10 value), divided by dimension for target function value 10^{−8} versus dimension. Slanted grid lines indicate quadratic scaling with the dimension. Different symbols correspond to different algorithms given in the legend of f1 and f24. Light symbols give the maximum number of function evaluations from the longest trial divided by dimension. Black stars indicate a statistically better result compared to all other algorithms with p < 0.01 and Bonferroni correction number of dimensions (six). Legend: ○: 1komma2 brockhoff noiseless, ♢: 1komma2mir brockhoff noiseless, ☆: 1komma2mirser brockhoff noiseless, ▼: 1komma2ser brockhoff noiseless, ⬡: 1komma4 brockhoff noiseless, △: 1komma4mir brockhoff noiseless, ⬠: 1komma4mirser brockhoff noiseless, rightY: 1komma4ser brockhoff noiseless, downY: 1plus1 brockhoff noiseless, ◇: 1plus2mirser brockhoff noiseless, ◁: ABC elabd noiseless, ▼: AVGNEWUOA ros noiseless, ☆: CMAEGS finck noiseless, ◻: DE-F-AUC fialho noiseless, ♢: DEuniform fialho noiseless, △: IPOP-ACTCMA-ES ros noiseless, ◁: IPOP-CMA-ES ros noiseless, ⬡: MOS torre noiseless, ⬠: NBC-CMA preuss noiseless, ⬣: PM-AdapSS-DE fialho noiseless, downY: RCGA tran noiseless, upY: SPSA finck noiseless, leftY: oPOEMS kubalic noiseless, rightY: pPOEMS kubalic noiseless