Mathematical framework for algorithm analysis

Though nature-inspired algorithms have been shown to be effective, we still lack some in-depth understanding of these algorithms. This chapter attempts to provide a unified framework to analyze algorithms from different perspectives with some mathematical rigor. Both convergence and stability are analyzed, together with some algorithmic complexity. Some key issues concerning benchmarking and comparison of nature-inspired algorithms are also highlighted.