whenever you notice it.''
(1 Thess. 5:21-22)
This file is part of my global optimization web site.
Global optimization is the task of finding the absolutely best set of admissible conditions to achieve your objective, formulated in mathematical terms. It is the hardest part of a subject called nonlinear programming (NLP). See, e.g., the Mathematical Programming Glossary, the WORMS Topics Directory on Optimization and Operations Research, or the Nonlinear Programming FAQ. [Widen your horizon and discover another interesting but quite different meaning of the acronym NLP.]
For finding only locally optimal solutions, which is considerably easier, specific recommendations on (mostly) public domain software can be found in the Decision Tree for Optimization Software. Both public domain and commercial codes are listed in the NEOS Guide to Optimization Software. Some pointers are also given in our section on Local Optimization Software.
A basic reference on most aspects of global optimization until 1995 is the book
The editors are (like myself) proponents of complete methods; this may explain why some techniques that are useful at the present stage of knowledge are not discussed. This applies, e.g., to heuristic techniques like tunneling, tabu search, threshold accepting. A major omission is the lack of discussion of genetic algorithms; for this topic, look instead into
Some more recent books present complete global optimization from two perspectives: The interval point of view is in
Janos Pinter has an interesting online paper on Continuous Global Optimization: An Introduction to Models, Solution Approaches, Tests and Applications.
A good source on information about heuristic global optimization methods for combinatorial problems is
Real world applications of global optimization are extensively treated in the book
Univariate global optimization is fairly simple because the curse of dimensionality does not yet apply and there is a natural linear ordering of the arguments. Most other classes of global optimization problems are NP-hard, however. This implies that (unless P=NP), for each algorithm, there are always some instances that take more than polynomial time in the length of the input data. See, e.g., A compendium of NP optimization problems (by Crescenzi and Kann)
SIAM maintains a collection of Optimization Books and Proceedings on local (and some global) optimization, and there are also some other Global Optimization Books.
For other topics related to optimization, you might find something at the following links:
INFORMS OR/MS Resource Collection.
Mathematical Optimization Society (formerly Mathematical Programming Society)
Recent Papers and Preprints
my home page
Arnold Neumaier (Arnold.Neumaier@univie.ac.at)