On efficiency of tightening bounds in interval global optimization

Authors:
Antanas Žilinskas;Julius Žilinskas
Affiliations:
,Institute of Mathematics and Informatics, MII, Vilnius, Lithuania;Institute of Mathematics and Informatics, MII, Vilnius, Lithuania
Venue:
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Year:
2004

Citing 4
Cited 1

New computer methods for global optimization

New computer methods for global optimization
Parallel Branch-and-Bound for Chemical Engineering Applications: Load Balancing and Scheduling Issues

VECPAR '00 Selected Papers and Invited Talks from the 4th International Conference on Vector and Parallel Processing
Evaluation Ranges of Functions using Balanced Random Interval Arithmetic

Informatica
Comparison of Packages for Interval Arithmetic

Informatica

Estimation of Functional Ranges Using Standard and Inner Interval Arithmetic

Informatica

Quantified Score

Hi-index	0.00

Visualization

Abstract

The tightness of bounds is very important factor of efficiency of branch and bound based global optimization algorithms. An experimental model of interval arithmetic with controllable tightness of bounds is proposed to investigate the impact of bounds tightening in interval global optimization. A parallel version of the algorithm is implemented to cope with the computational intensity of the experiment. The experimental results on efficiency of tightening bounds are presented for several test and practical problems. The suitability of mater-slave type parallelization to speed up the experiments is justified.