Goodness of optimization algorithms

Eligius M. T. Hendrix () and Boglárka G.-Tóth ()
Additional contact information
Eligius M. T. Hendrix: Málaga University
Boglárka G.-Tóth: Budapest University of Technology and Economics

Chapter 4 in Introduction to Nonlinear and Global Optimization, 2010, pp 67-90 from Springer

Abstract: Abstract 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.

Keywords: Local Search; Global Optimization; Minimum Point; Optimum Point; Success Region (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-0-387-88670-1_4

Ordering information: This item can be ordered from
http://www.springer.com/9780387886701

DOI: 10.1007/978-0-387-88670-1_4

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().