Goodness of optimization algorithms
In this chapter, several criteria are discussed to measure the effectiveness and efficiency of algorithms. Moreover, examples of basic algorithms are analyzed. Global Optimization (GO) concepts such as region of attraction, level set, probability of success and performance graph are introduced. To investigate optimization algorithms, we should say what we mean by them in this book; an algorithm is a description of steps, preferably implemented into a computer program, which finds an approximation of an optimum point. The aims can be several: reach a local optimum point, reach a global optimum point, find all global optimum points, reach all global and local optimum points. In general, an algorithm generates a series of points x k that approximate an optimum point.
KeywordsLocal Search Global Optimization Minimum Point Optimum Point Success Region
Unable to display preview. Download preview PDF.