Abstract
Based on the investigation carried out in Ref. 1, this paper incorporates new studies about the properties of inclusion functions on subintervals while a branch-and-bound algorithm is solving global optimization problems. It is found that the relative place of the global minimum value within the inclusion function value of the objective function at the current interval indicates mostly whether the given interval is close to a minimizer point. This information is used in a heuristic interval rejection rule that can save a considerable amount of computation. Illustrative examples are discussed and an extended numerical study shows the advantages of the new approach.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Casado, L.G., GarcÍa, I., and Csendes, T., A Heuristic Rejection Criterion in Interval Global Optimization Algorithms, BIT, Vol. 41, pp. 683–692, 2001.
Madsen, K., and Zertchanninov, S., A New Branch-and-Bound Method for Global Optimization, Technical Report IMM 05/98, Technical University of Denmark, Lyngby, Denmark, 1998.
Casado, L. G., GarcÍa, I., and MartÍnez, J.A., Experiments with a New Selection Criterion in a Fast Interval Optimization Algorithm, Journal of Global Optimization, Vol. 19, pp. 247–264, 2001.
Ratschek, H., and Rokne, J., New Computer Methods for Global Optimization, Ellis Horwood, Chichester, England, 1988.
Ichida, K., and Fujii, Y., An Interval Arithmetic Method for Global Optimization, Computing, Vol. 23, pp. 85–97, 1979.
Hammer, R., Hocks, M., Kulisch, U., and Ratz, D., C++ Toolbox for Verified Computing, I, Basic Numerical Problems: Theory, Algorithms, and Programs, Springer-Verlag, Berlin, Germany, 1995.
Hansen, E., Global Optimization Using Interval Analysis, Pure and Applied Mathematics, Marcel Dekker, New York, NY, Vol. 165, 1992.
Kearfott, R.B., Rigorous Global Search: Continuous Problems, Kluwer Academic Publishers, Dordrecht, Holland, 1996.
Horst, R., and Pardalos, P., Editors, Handbook of Global Optimization; Noncovex Optimization and Its Applications, Kluwer Academic Publishers, Dordrecht, Holland, Vol. 2, 1995.
Ratz, D., and Csendes, T., On the Selection of Subdivision Directions in Interval Branch-and-Bound Methods for Global Optimization, Journal of Global Optimization, Vol. 7, pp. 183–207, 1995.
Berner, S., New Results in Verified Global Optimization, Computing, Vol. 57, pp. 323–343, 1996.
Casado, L. G., and GarcÍa, I., New Load Balancing Criterion for Parallel Interval Global Optimization Algorithms, Proceedings of the 16th IASTED International Conference on Applied Informatics, Garmisch-Partenkirchen, Germany, pp. 321–323, 1998.
Casado, L. G., GarcÍa, I., and Csendes, T., A New Multisection Technique in Interval Methods for Global Optimization, Computing, Vol. 65, pp. 263–269, 2000.
KnÜppel, O., A Fast Interval Library, Computing, Vol. 53, pp. 277–287, 1994.
Csendes, T., and Ratz, D., Subdivision Direction Selection in Interval Methods for Global Optimization, SIAM Journal on Numerical Analysis, Vol. 34, pp. 922–938, 1997.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Casado, L., García, I., Csendes, T. et al. Heuristic Rejection in Interval Global Optimization. Journal of Optimization Theory and Applications 118, 27–43 (2003). https://doi.org/10.1023/A:1024731306785
Issue Date:
DOI: https://doi.org/10.1023/A:1024731306785