On the Goodness of Global Optimisation Algorithms, an Introduction into Investigating Algorithms

Eligius M. T. Hendrix ()
Additional contact information
Eligius M. T. Hendrix: Wageningen Universiteit

A chapter in Models and Algorithms for Global Optimization, 2007, pp 225-248 from Springer

Abstract: Summary An early introductory text on Global Optimisation (GO), [TZ89], goes further than mathematical correctness in giving the reader an intuitive idea about concepts in GO. This chapter extends this spirit by introducing students and researchers to the concepts of Global Optimisation (GO) algorithms. The goal is to learn to read and interpret optimisation algorithms and to analyse their goodness. Before going deeper into mathematical analysis, it is good for students to get a flavour of the difficulty by letting them experiment with simple algorithms that can be followed by hand or spreadsheet calculations. Two simple one-dimensional examples are introduced and several simple NLP and GO algorithms arc elaborated. This is followed by some lessons that can be learned from investigating the algorithms systematically.

Keywords: Local Search; Global Optimisation; Minimum Point; Lipschitz Constant; Global Optimization Algorithm (search for similar items in EconPapers)
Date: 2007
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-36721-7_15

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

DOI: 10.1007/978-0-387-36721-7_15

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 ().