“…These include hill-climbing algorithms [12,13], genetic algorithms [13][14][15][16][17], image-based algorithms [18,19], conjugate gradient methods [20], stochastic parallel gradient descent methods [21], and the Nelder-Mead simplex algorithm [11,22,23]. Such general methodologies require a large number of measurements of the metric [2,24,25] and may not converge to the global optimum [23,26].…”