This paper addresses the solution of bound-constrained optimization problems using algorithms that require only the availability of objective function values but no derivative information. We refer to these algorithms as derivative-free algorithms. Fueled by a growing number of applications in science and engineering, the development of derivative-free optimization algorithms has long been studied, and it has found renewed interest in recent time. Along with many derivative-free algorithms, many software implementations have also appeared. The paper presents a review of derivative-free algorithms, followed by a systematic comparison of 22 related implementations using a test set of 502 problems. The test bed includes convex and nonconvex problems, smooth as well as nonsmooth problems. The algorithms were tested under the same conditions and ranked under several criteria, including their ability to find near-global solutions for nonconvex problems, improve a given starting point, and refine a near-optimal solution. A total of 112,448 problem instances were solved. We find that the ability of all these solvers to obtain good solutions diminishes with increasing problem size. For the problems used in this study, <Emphasis FontCategory="SansSerif">TOMLAB/MULTIMIN, <Emphasis FontCategory="SansSerif">TOMLAB/GLCCLUSTER, <Emphasis FontCategory="SansSerif">MCS and <Emphasis FontCategory="SansSerif">TOMLAB/LGO are better, on average, than other derivative-free solvers in terms of solution quality within 2,500 function evaluations. These global solvers outperform local solvers even for convex problems. Finally, <Emphasis FontCategory="SansSerif">TOMLAB/OQNLP, <Emphasis FontCategory="SansSerif">NEWUOA, and <Emphasis FontCategory="SansSerif">TOMLAB/MULTIMIN show superior performance in terms of refining a near-optimal solution. Copyright Springer Science+Business Media, LLC. 2013
