Approximating Pareto frontier using a hybrid line search approach
Information Sciences: an International Journal
A hybrid attractive and repulsive particle swarm optimization based on gradient search
ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories and Technology
| Hi-index | 0.00 |
Several types of line search methods are documented in the literature and are well known for unconstraint optimization problems. This paper proposes a modified line search method, which makes use of partial derivatives and restarts the search process after a given number of iterations by modifying the boundaries based on the best solution obtained at the previous iteration (or set of iterations). Using several high-dimensional benchmark functions, we illustrate that the proposed line search restart (LSRS) approach is very suitable for high-dimensional global optimization problems. Performance of the proposed algorithm is compared with two popular global optimization approaches, namely, genetic algorithm and particle swarm optimization method. Empirical results for up to 2000 dimensions clearly illustrate that the proposed approach performs very well for the tested high-dimensional functions. © 2009 Wiley Periodicals, Inc.