Fig. 1

Running times for sample sizes varying from \(n = 1000\) to \(n=10{,}000\). All computations were run on a Intel i7 at 3.60 GHz with 8 MB of cache memory. Due to the log–log scale, the timing of an algorithm with complexity \(O(n^\alpha )\) appears as a straightline with slope \(\alpha\): slope 3 for the initial step, 2 for AMLE and GMMAT, and 1 for the Offset method