The Determination of Sub-boxes Which Might Contain the Global Minimizer(s) Using Interval Arithmetic
In this paper, a method for obtaining sub-boxes which bound the Kuhn-Tucker point using interval arithmetic is presented. This method is designed such that the generation of too many sub-boxes, as described in section 12 of (Hansen, 1980), is prevented while it is simultaneously used to compute th...
Main Author: | Mohd, Ismail |
---|---|
Format: | Article |
Language: | English English |
Published: |
1990
|
Online Access: | http://psasir.upm.edu.my/id/eprint/2902/1/The_Determination_of_Sub-boxes_Which_Might_Contain.pdf |
Similar Items
-
We might be afraid of black-box algorithms
by: Veliz, C, et al.
Published: (2021) -
Generalizing the Real Interval Arithmetic
by: R. CALLEJAS-BEDREGAL, et al.
Published: (2002-06-01) -
Mean values of arithmetic functions in short intervals and in arithmetic progressions in the large-degree limit
by: Gorodetsky, O
Published: (2020) -
Which Arithmetical Data Types Admit Fracterm Flattening?
by: Jan A. Bergstra, et al.
Published: (2022-06-01) -
Which British SME might benefit from electricity dynamic tariffs?
by: Granell, R, et al.
Published: (2016)