Abstract
We described an algorithm for maximizing functions by use of interval analysis. It enables us to obtain the maximum in the domain or on the boundary. Both unconstrained and constrained global maximum can be computed. So far we have calculated maxima of the functions up to five variables. If effective devices for reducing interval width of functions are developed, this method can be applied to higher-dimensional problems.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
Bremermann, H.: A method of unconstrained global optimization, Math. Biosci. 9,1–15(1970).
Dixon, L.C.W., Szëgo, G.P.:Towords Global Optimisation 2. North-Holland/American Elsevier, Amsterdam, 1978.
Hansen, E.R.:Global optimization using interval analysis — The multi-dimensional case, Numer. Math. 34,247–270(1980).
Alefeld, G., Herzberger, J.: Introduction to Interval Computations. Academic Press, New York, 1983.
Nickel, K.L.E.:Interval Mathematics 1980. Academic Press, New York, 1980.
Ichida, K., Fujii, Y.:An interval arithmetic method for global optimization, Computing 23,85–97(1979).
Moore, R.E.:Interval Analysis. Englewood Cliffs, N.J., Prentice-Hall, 1966.
Dixon, L.C.W.: Nonlinear Optimisation. The English Univ. Press, London, 1972.
Tsuda, T., Sato, M.: An algorithm to locate the greatest maxima of multi-variable functions, Information Processing(Joho Shori) 16, 2–6(1975).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fujii, Y., Ichida, K., Ozasa, M. (1986). Maximization of multivariable functions using interval analysis. In: Nickel, K. (eds) Interval Mathematics 1985. IMath 1985. Lecture Notes in Computer Science, vol 212. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16437-5_3
Download citation
DOI: https://doi.org/10.1007/3-540-16437-5_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16437-1
Online ISBN: 978-3-540-39779-3
eBook Packages: Springer Book Archive