May 2018
Intermediate to advanced
776 pages
25h 42m
English
Leapfrogging is a relatively new multiplayer direct search approach. Earlier chapters compared LF to other diverse optimization algorithms and provided experimental data that generally indicated LF was good w.r.t. several metrics (high probability of finding the global, low number of function evaluations, high precision, robustness to surface aberrations, simplicity, etc.). This chapter provides some fundamental mathematical analysis of the technique. Those interested in the theoretical aspects of algorithms (Myers‐Briggs N types) may enjoy the chapter in this section. By contrast, if you are an S type, don't read this chapter. The empirical findings of the prior chapters will be more than adequate.
Read now
Unlock full access