On the Asaithambi-Zuhe-Moore algorithm for computing the range of values
DSpace at IIT Bombay
View Archive InfoField | Value | |
Title |
On the Asaithambi-Zuhe-Moore algorithm for computing the range of values
|
|
Creator |
NATARAJ, PSV
KUBAL, N |
|
Subject |
global optimization
|
|
Description |
Asaithambi, Zuhe, and Moore (Computing 28, 225-237, 1982) presented an algorithm to find good upper and lower bounds on the range of values of a function of several variables on an n- dimensional rectangle. Unfortunately, the algorithm presented there contains some errors. In this paper, we point out these errors, show how they may be corrected, and suggest improvements of the algorithm.
|
|
Publisher |
SPRINGER WIEN
|
|
Date |
2011-08-30T10:54:54Z
2011-12-26T12:58:54Z 2011-12-27T05:49:36Z 2011-08-30T10:54:54Z 2011-12-26T12:58:54Z 2011-12-27T05:49:36Z 2007 |
|
Type |
Article
|
|
Identifier |
COMPUTING, 80(3), 247-253
0010-485X http://dx.doi.org/10.1007/s00607-007-0231-5 http://dspace.library.iitb.ac.in/xmlui/handle/10054/12289 http://hdl.handle.net/10054/12289 |
|
Language |
en
|
|