Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms

Journal of Optimization Theory and Applications

Volumn 107, Issue 1, 2000, Pages 145-168

  Sergeyev, Ya D ^a,b  

^a UNIVERSITY OF CALABRIA   (Italy)

^b LOBACHEVSKY STATE UNIVERSITY OF NIZHNY NOVGOROD   (Russian Federation)

Author keywords

Diagonal algorithms; Global optimization; Minimal description; Partitioning

Indexed keywords

ADAPTIVE PARTITIONS; DIAGONAL ALGORITHM; EFFICIENT STRATEGY; GLOBAL OPTIMISATION; MEMORY COMPLEXITY; MINIMAL DESCRIPTION; PARTITIONING; SUBINTERVALS;

GLOBAL OPTIMIZATION;

EID: 0034349662     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1004613001755     Document Type: Article

References (39)

1. 1. HORST, R., and PARDALOS, P. M., Editors, Handbook of Global Optimization, Kluwer Academic Publishers, Dordrecht, Holland, 1995.
2. 2. PINTÉR, J., Global Optimization in Action, Kluwer Academic Publishers, Dordrecht, Holland, 1996.
3. 3. KOROBOV, N. M., Trigonometric Sums and Their Applications, Nauka, Moscow, Russia, 1989 (in Russian).
4. 4. SUKHAREV, A. G., Minimax Algorithms in Problems of Numerical Analysis, Moscow, Nauka, Russia, 1989 (in Russian).
5. 5. AGARWAL, P. K., Geometric Partitioning and Its Applications, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Edited by J. E. Goodman, R. Pollack, and J. O'Rourke, Vol. 6, pp. 1-37, 1991.
6. 6. GOODMAN, J. E., and O'ROURKE, J., Editors, Handbook of Discrete and Computational Geometry, CRC Press, Boca Raton, Florida, 1997.
7. 7. KOROTKICH, V. V., Multicriteria Analysis in Problem Solving and Structural Complexity, Advances in Multicryteria Analysis, Edited by P. M. Pardalos, Y. Siskos, and C. Zopounidis, Kluwer Academic Publishers, Dordrecht, Holland, pp. 81-90, 1995.
8. 8. ARCHETTI, R., and SCHOEN, F., A Survey on the Global Optimization Problem: General Theory and Computational Approaches, Annals of Operations Research, Vol. 1, pp. 87-110, 1984.
9. 9. HORST, R., and TUY, H., Global Optimization: Deterministic Approaches, 3rd Edition, Springer Verlag, Berlin, Germany, 1996.
10. 10. RATSCHEK, H., and ROKNE, J., New Computer Methods for Global Optimization, Ellis Horwood, Chichester, England, 1988.
11. 11. STRONGIN, R. G., Numerical Methods on Multiextremal Problems, Moscow, Nauka, Russia, 1978 (in Russian).
12. 12. BERNER, S., New Results on Verified Global Optimization, Computing, Vol. 57, pp. 323-343, 1996.
13. 13. CASADO, L. G., GARCÍA, I., and CSENDES, T., A New Multisection Technique in Interval Methods for Global Optimization Computing (to appear).
14. 14. CSALLNER, A. E., CSENDES, T., and MARKÓT, M. C., Multisection in Interval Branch-and-Bound Methods for Global Optimization, Journal of Global Optimization, Vol. 16, pp. 371-392, 2000.
15. 15. CSENDES, T., and PINTÉR, J., The Impact of Accelerating Tools on the Interval Subdivision Algorithm for Global Optimization, European Journal of Operational Research, Vol. 65, pp. 314-320, 1993.
16. 16. 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.
17. 17. HAMMER, R., HOCKS, M., KULISCH, U., and RATZ, D., Numerical Toolbox for Verified Computing, Vol. 1, Springer Verlag, Berlin, Germany, 1993.
18. 18. HANSEN, E., Global Optimization Using Interval Analysis: The Multidimensional Case, Numerische Mathematik, Vol. 34, pp. 247-270, 1980.
19. 19. HANSEN, E., Global Optimization Using Interval Analysis, Marcel Dekker, New York, NY, 1992.
20. 20. 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.
21. 21. GALPERIN, E. A., The Cubic Algorithm, Journal of Mathematical Analysis and Applications, Vol. 112, pp. 635-640, 1985.
22. 22. JONES, D. R., PERTTUNEN, C. D., and STUCKMAN, B. E., Lipschitzian Optimization without the Lipschitz Constant, Journal of Optimization Theory and Applications, Vol. 79, pp. 157-181, 1993.
23. 23. MEEWELLA, C. C., and MAYNE, D. Q., Efficient Domain Partitioning Algorithms for Global Optimization of Rational and Lipschitz Continuous Functions, Journal of Optimization Theory and Applications, Vol. 61, pp. 247-270, 1989.
24. 24. HORST, R., On Generalized Bisection of N-Simplices, Mathematics of Computation, Vol. 66, pp. 691-698, 1997.
25. 25. ŽILINSKAS, A., Select and Clone: A Statistical Approach to Global Optimization, Book of Abstracts, 19th IFIP Conference on System Modelling and Optimization, Cambridge, England, p. 59, 1999.
26. 26. BARITOMPA, W. P., Accelerations for a Variety of Global Optimization Methods, Journal of Global Optimization, Vol. 4, pp. 37-45, 1994.
27. 27. BARITOMPA, W. P., and VIITANEN, S., PMB-Parallel Multidimensional Bisection, Report 101, Department of Mathematics and Statistics, University of Canterbury, Christchurch, New Zealand, 1993.
28. 28. BREIMAN, L., and CUTLER, A., A Deterministic Algorithm for Global Optimization, Mathematical Programming, Vol. 58, pp. 179-199, 1993.
29. 29. MLADINEO, R., An Algorithm for Finding the Global Maximum of a Multimodal, Multivariate Function, Mathematical Programming, Vol. 34, pp. 188-200, 1986.
30. 30. WOOD, G. R., The Bisection Method in Higher Dimensions, Mathematical Programming, Vol. 55, pp. 319-337, 1992.
31. 31. WOOD, G. R., Multidimensional Bisection and Global Optimization, Computers and Mathematics with Applications, Vol. 21, pp. 161-172, 1991.
32. 32. PINTÉR, J., Extended Univariate Algorithms for N-Dimensional Global Optimization, Computing, Vol. 36, pp. 91-103, 1986.
33. 33. GERGEL, V. P., A Global Optimization Algorithm for Multivariate Functions with Lipschitzian First Derivatives, Journal of Global Optimization, Vol. 10, pp. 257-281, 1997.
34. 34. MOLINARO, A., PIZZUTI, C., and SERGEYEV, YA.D., Acceleration Tools for Diagonal Information Global Optimization Algorithms, Computational Optimization and Applications (to appear).
35. 35. PINTÉR, J., Convergence Qualification of Adaptive Partition Algorithms in Global Optimization, Mathematical Programming, Vol. 56, pp. 343-360, 1992.
36. 36. SERGEYEV, YA.D., A Multidimensional Global Optimization Algorithm Using Derivatives and Local Tuning, Report 6, ISI-CNR, Rende, Cosenza, Italy, 1994.
37. 37. BUTZ, A. R., Space Filling Curves and Mathematical Programming, Information and Control, Vol. 12, pp. 314-330, 1968.
38. 38. SAGAN, H., Space-Filling Curves, Springer Verlag, New York, NY, 1994.
39. 39. SERGEYEV, YA.D., An Information Global Optimization Algorithm with Local Tuning, SIAM Journal on Optimization, Vol. 5, pp. 858-870, 1995.