On global optimization in R using interval arithmetic
Author:
- 1 January 1994
- journal article
- other
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 3 (1-3) , 61-76
Abstract
Interval arithmetic algorithms A.l and A.2 that determine computationally rigorous bounds on the global minimizers of continuous functions without inequality constraints and with inequality constraints respectively are described. It is assumed that, for A.l and that for and . Computational experience indicates that A.l and A.2 always succeed, although in some cases more than one interval containing a global minimizer is found. Numerical results obtained from Sun Pascal implementations of A.l and A.2 are presented.Keywords
This publication has 7 references indexed in Scilit:
- Unconstrained and constrained global optimization of polynomial functions in one variableJournal of Global Optimization, 1992
- Global Optimization1989
- An interval version of Shubert's iterative method for the localization of the global maximumComputing, 1987
- Global optimization using interval analysis: The one-dimensional caseJournal of Optimization Theory and Applications, 1979
- Methods and Applications of Interval Analysis1979
- A Sequential Method Seeking the Global Maximum of a FunctionSIAM Journal on Numerical Analysis, 1972
- Strict estimation of the maximum of a function of one variableBIT Numerical Mathematics, 1971