Overview page

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: : BIPOP-aCMA-STEP loshchilov noiseless, : BIPOP-saACM-k loshchilov noiseless, : CGA-grid100 holtschulte noiseless, : CGA-grid16 holtschulte noiseless, : CGA-ring100 holtschulte noiseless, : CGA-ring16 holtschulte noiseless, : CMAES Hutter hutter noiseless, rightY: DE Pal pal noiseless, downY: GA-100 holtschulte noiseless, : HCMA loshchilov noiseless, : HILL holtschulte noiseless, : HMLSL pal noiseless, : IP-10DDr liao noiseless, : IP-500 liao noiseless, : IPOP400D auger noiseless, : IP liao noiseless, : MEMPSODE voglis noiseless, : MLSL pal noiseless, : OQNLP pal noiseless, : P-DCN tran noiseless, downY: P-zero tran noiseless, upY: PRCGA sawyerr noiseless, leftY: SMAC-BBOB hutter noiseless, rightY: U-DCN tran noiseless, : U-zero tran noiseless, : fmincon pal noiseless, : fminunc pal noiseless, : lmm-CMA-ES auger noiseless, : simplex pal noiseless, : tany liao noiseless, : texp liao noiseless