Use this URL to cite or link to this record in EThOS:
Title: Global optimization using interval arithmetic
Author: Mohd, Ismail Bin
Awarding Body: University of St Andrews
Current Institution: University of St Andrews
Date of Award: 1987
Availability of Full Text:
Access from EThOS:
Access from Institution:
This thesis contains a description of algorithm, MW, for bounding the global minimizers and globally minimum value of a twice continuously differentiable function f :Rn → R1 R1 in a compact sub-interval of Rn. 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.
Supervisor: Wolfe, M. A. Sponsor: University of Agriculture, Malaysia ; Department of Public Service, Malaysia
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available
Keywords: QA402.5M7 ; Mathematical optimization