Interval algorithm for global numerical optimization
- 19 August 2008
- journal article
- research article
- Published by Taylor & Francis in Engineering Optimization
- Vol. 40 (9) , 849-868
Abstract
The interval optimization algorithm shows great advantages in bound constrained global optimization. An interval algorithm is presented in this article based on a new selection criterion. The selection criterion is proposed based on numerical experiments and the parameter pf* designed by Casado, Garcia and Csendes in 2000. The proposed criterion at each iteration selects some intervals of which the number is not greater than a constant so that the possible memory problem during the implementation of the algorithm is avoided and the running time of the algorithm is decreased, when the dimension of the problem is increasing. Based on the selection criterion, the proposed algorithm is implemented for a wide set of tested functions which includes easy and hard problems. Numerical experiments show that the proposed algorithm is efficient.Keywords
This publication has 24 references indexed in Scilit:
- Hybrid Taguchi-Genetic Algorithm for Global Numerical OptimizationIEEE Transactions on Evolutionary Computation, 2004
- Evolutionary Programming Using Mutations Based on the LÉvy Probability DistributionIEEE Transactions on Evolutionary Computation, 2004
- An orthogonal genetic algorithm with quantization for global numerical optimizationIEEE Transactions on Evolutionary Computation, 2001
- A New Multisection Technique in Interval Methods for Global OptimizationComputing, 2000
- A new hybrid genetic algorithm for global optimizationNonlinear Analysis, 1997
- A general CDC formulation for specializing the cell exclusion algorithms of finding all zeros of vector functionsApplied Mathematics and Computation, 1997
- Subdivision Direction Selection in Interval Methods for Global OptimizationSIAM Journal on Numerical Analysis, 1997
- Interval methods for global optimizationApplied Mathematics and Computation, 1996
- On the selection of subdivision directions in interval branch-and-bound methods for global optimizationJournal of Global Optimization, 1995
- Global optimization using interval analysis ? the multi-dimensional caseNumerische Mathematik, 1980