Files in this item
Global optimization using interval arithmetic
Item metadata
dc.contributor.advisor | Wolfe, M. A. | |
dc.contributor.author | Mohd, Ismail Bin | |
dc.coverage.spatial | 421 p. | en_US |
dc.date.accessioned | 2018-06-07T15:15:11Z | |
dc.date.available | 2018-06-07T15:15:11Z | |
dc.date.issued | 1987 | |
dc.identifier.uri | http://hdl.handle.net/10023/13824 | |
dc.description.abstract | 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. | en_US |
dc.language.iso | en | en_US |
dc.publisher | University of St Andrews | en |
dc.subject.lcc | QA402.5M7 | |
dc.subject.lcsh | Mathematical optimization | en |
dc.title | Global optimization using interval arithmetic | en_US |
dc.type | Thesis | en_US |
dc.contributor.sponsor | Malaysia. University of Agriculture | en_US |
dc.contributor.sponsor | Malaysia. Department of Public Service | en_US |
dc.type.qualificationlevel | Doctoral | en_US |
dc.type.qualificationname | PhD Doctor of Philosophy | en_US |
dc.publisher.institution | The University of St Andrews | en_US |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.