Show simple item record

Files in this item


Item metadata

dc.contributor.advisorWolfe, M. A.
dc.contributor.authorMohd, Ismail Bin
dc.coverage.spatial421 p.en_US
dc.description.abstractThis 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.en_US
dc.publisherUniversity of St Andrewsen
dc.subject.lcshMathematical optimizationen
dc.titleGlobal optimization using interval arithmeticen_US
dc.contributor.sponsorMalaysia. University of Agricultureen_US
dc.contributor.sponsorMalaysia. Department of Public Serviceen_US
dc.type.qualificationnamePhD Doctor of Philosophyen_US
dc.publisher.institutionThe University of St Andrewsen_US

This item appears in the following Collection(s)

Show simple item record