A heuristic rejection criterion in interval global optimization algorithms

BIT Numerical Mathematics

Volumn 41, Issue 4, 2001, Pages 683-692

  Casado, L G ^a   Garcia I ^a   Csendes, T ^b  

^a UNIVERSITY OF ALMERÍA   (Spain)

^b UNIVERSITY OF SZEGED   (Hungary)

Author keywords

Branch and bound algorithm; Global optimization; Inclusion function

Indexed keywords

EID: 0042318562     PISSN: 00063835     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1021991817955     Document Type: Article

References (8)

1. L. G. Casado and I. García, New load balancing criterion for parallel interval global optimization algorithms, in Proceedings of the 16th IASTED International Conference on Applied Informatics, Garmisch-Partenkirchen, Germany, February 1998, pp. 321-323.
2. L. G. Casado, I. García, and T. Csendes, A new multisection technique in interval methods for global optimization, Computing, 65 (2000), pp. 263-269.
3. T. Csendes and D. Ratz, Subdivision direction selection in interval methods for global optimization, SIAM J. Numer. Anal., 34 (1997), pp. 922-938.
4. R. Horst and P. Pardalos, eds., Handbook of Global Optimization, Vol. 2 of Nonconvex Optimization and its Applications, Kluwer Academic Publishers, Dordrecht, 1995.
5. R. B. Kearfott, Rigorous Global Search: Continuous Problems, Kluwer Academic Publishers, Dordrecht, 1996.
6. O. Knüppel, BIAS-Basic Interval Arithmetic Subroutines, Tech. Report 93.3, University of Hamburg, 1993.
7. K. Madsen and S. Zertchanninov, A new branch and bound method for global optimization, Tech. Report IMM 05/98, Technical University of Denmark, Copenhagen, 1998.
8. H. Ratschek and J. Rokne, New Computer Methods for Global Optimization, Ellis Horwood/Wiley, New York, 1988.