Global optimization using interval arithmetic
MetadataShow full item record
This thesis contains a description of algorithm, MW, for bounding the global minimizers and globally minimum value of a twice continuously differentiable function f :Rⁿ → R¹ R1 in a compact sub-interval of Rⁿ. The algorithm MW is similar to the algorithm of Hansen (Han-80a] in that interval arithmetic is used together with certain of Hansen's ideas, but is different from Hansen's algorithm in that MW bounds the Kuhn Tucker points corresponding to the global minimizers of f in the given sab-interval. The Kuhn Tucker points are bounded with prescribed precision by using either of the algorithms KMSW [SheW-85c] or MAP [SheW-85b]. Numerical results which are obtained from Triplex [BaCM-82a] [MorC-83a] implementations of H and MW axe presented.
Thesis, PhD Doctor of Philosophy
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.