Finally, comparing the vectorized and descent performances in Table shows that the additional descent optimization does not have a large impact. That means that either the vectorized procedure yields a reasonable optimization already, or that the local minimum found through the additional descent iterations is still very similar to the initial starting point. In future versions of ArchOnML, an efficient global minimum search method is thus desirable to confirm whether applying a more computationally costly approach than the vectorized method is necessary or not.