Abstract
The no-free-lunch theorem of optimization (NFLT) is an impossibility theorem telling us that a general-purpose, universal optimization strategy is impossible. The only way one strategy can outperform another is if it is specialized to the structure of the specific problem under consideration. Since optimization is a central human activity, an appreciation of the NFLT and its consequences is essential. In this paper, we present a framework for conceptualizing optimization that leads to a simple but rigorous explanation of the NFLT and its implications.
Similar content being viewed by others
References
CULBERSON, J. C., On the Futility of Blind Search, Technical Report TR 96–18, Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada, 1996.
CULBERSON, J. C., On the Futility of Blind Search: An Algorithmic View of 'No Free Lunch', Evolutionary Computation, Vol. 6, pp. 109–127, 1998.
DUDA, R. O., HART, P. E., and STORK, D. G., Pattern Classification, 2nd Edition, John Wiley and Sons, New York, NY, 2001.
HO, Y. C., The No-Free-Lunch Theorem and the Human Machine Interface, IEEE Control Systems Magazine, Vol. 19, pp. 88–90, 1999.
KOPPEN, M., WOLPERT, D. H., and MACREADY, W. G., Remarks on a Recent Paper on the No-Free-Lunch Theorems, IEEE Transactions on Evolutionary Computation, Vol. 5, pp. 295–296, 2001.
RADCLIFF, N.J., and SURRY, P. D., Fundamental Limitations on Search Algorithms: Evolutionary Computing in Perspective, Lecture Notes in Computer Science, Springer Verlag, New York, NY, Vol. 1000, pp. 275–291, 1995.
SHARPE, O., Beyond NFL: A Few Tentatiûe Steps (available online at http://www.cogs.susx.ac.uk/users/olivers/).
SHARPE, O., Continuing Beyond NFL: Dissecting Real World Problems (available online at http://www.cogs.susx.ac.uk/users/olivers/).
WOLPERT, D. H., and MACREADY, W. G., No-Free-Lunch Theorems for Optimization, IEEE Transactions on Evolutionary Computation, Vol. 1, pp. 67–82, 1997.
WOLPERT, D. H., and MACREADY, W. G., No-Free-Lunch Theorems for Search, Technical Report SFI-TR–95-02-010, Santa Fe Institute, Santa Fe, New Mexico, 1995.
HO, Y. C., An Explanation of Ordinal Optimization: Soft Computing for Hard Problems, Information Sciences, Vol. 113, pp. 169–192, 1999.
LIN, X. C., A New Framework for Discrete Stochastic Optimization, Doctoral Dissertation, Harvard University, 2000.
DAI, L., Convergence Properties of Ordinal Comparisons in the Simulation of DEDS, Journal of Optimization Theory and Applications, Vol. 91, pp. 363–388, 1996.
DU, D. Z and KO, K. I., Theory of Computational Complexity, Wiley-Interscience, New York, NY, 2000.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ho, Y., Pepyne, D. Simple Explanation of the No-Free-Lunch Theorem and Its Implications. Journal of Optimization Theory and Applications 115, 549–570 (2002). https://doi.org/10.1023/A:1021251113462
Issue Date:
DOI: https://doi.org/10.1023/A:1021251113462