Exploring the search space with intervals
Evolutionary Computation and Global Optimization 2008 / National Conference (11 ; 2-4.06.2008 ; Szymbark, Poland)
The term global optimization is used in several contexts. Most often we are interested in finding such a point (or points) in many-dimensional search space at which the objective function's value is optimal, i.e. maximal or minimal. Sometimes, however, we are also interested in stability of the solution, that is in its robustness against small perturbations. Here I present the original, interval-analysis-based family of methods designed for exhaustive exploration of the search space. The power of interval methods makes it possible to reach all mentioned goals within a single, unified framework.
Bibliogr. 8 poz., rys.
-  For a concise and nice introduction into interval calculations and methods visit the website http://www.cs.utep.edu/interval-comp/ and references therein.
-  Brian Hayes, A Lucid Interval, American Scientist 91 (6), 484-488, 2003.
-  Jorge J. More, Todd S. Munson, Computing mountain passes and transition states, Math. Program. B 100:151-182, 2004.
-  Marek W. Gutowski. Classifying extrema using intervals, arXiv:cs/0609082.
-  Sergey P. Shary, A Surprising Approach in Interval Global Optimization, Reliable Computing 7:497-505, 2001.
-  Nicolas Delanoue, Luc Jaulin, Bertrand Cottenceau, Using interval arithmetic to prove that a set is path-connected, Theor. Comp. Sci. 351:119, 2006.
-  M. Lhommeau, L. Jaulin, L. Hardouin, Inner and outer approximation of capture basin using interval analysis, A slide show presented at: International Conference on Informatics in Control, Automation and Robotics, 2007.
-  Maxwell, James Clerk, On Hills and Dales, Phil. Mag. 40 (269), 421-427, 1870.