I'm working with NMaximize. Currently, I use the "DifferentialEvolution" method. Let us assume that, as a general rule, the more time Mathematica spends looking for a maximum, the more accurate the result will be. One user might be able to spend more time looking for an answer in order to get greater accuracy, but another user might be constrained for time and might need to sacrifice some accuracy. I'm assuming that one tunes the parameter "ScalingFactor" to achieve their particular balance between the calculation time against the end result accuracy. Am I oversimplifying the issue? My question is, does a large ScalingFactor mean that Mathematica will work harder and longer to find the answer? I've read the Mathematica documentation on NMaximize, but it is quite lengthy and theoretical, and it doesn't help a user such as myself who simply wants set this parameter and then get on with their work.