This simulated annealing algorithm takes \(\sim 1\)  minute for each minimization, and the minimizations for different regularization parameters can be performed on parallel processers. Because this search space is so large, with a nonlinear relationship on the minimization function, the minimization algorithm does not always locate the true best-fit temperature distribution. Instead there remains some scatter in the minimization output for subsequent simulated annealing minimizations of the same data with the same regularization parameter. This scatter in the minimization algorithm output is responsible for the uncertainty bars in Figure REF , and also makes traditional finite-difference maximum-curvature schemes for regularization parameter selection [1]} infeasible.
