Empirical study of the improved UNIRANDI local search method
- 76 Downloads
UNIRANDI is a stochastic local search algorithm that performs line searches from starting points along good random directions. In this paper, we focus on a modified version of this method. The new algorithm, addition to the random directions, considers more promising directions in order to speed up the optimization process. The performance of the new method is tested empirically on standard test functions in terms of function evaluations, success rates, error values, and CPU time. It is also compared to the previous version as well as other local search methods. Numerical results show that the new method is promising in terms of robustness and efficiency.
KeywordsDirect search Local search Global optimization Benchmarking
This work was supported by the Sapientia Foundation - Institute for Scientific Research with the Grant No. 252/11/28/04/2015.
- Csendes T (1988) Nonlinear parameter estimation by global optimization–efficiency and reliability. Acta Cybern 8(4):361–370Google Scholar
- Currie J, Wilson DI (2012) OPTI: lowering the barrier between open source optimizers and the industrial MATLAB user. In: Sahinidis N, Pinto J (eds) Foundations of computer-aided process operations. Savannah, USAGoogle Scholar
- Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of sixth international symposium micro machine and human science. Nagoya, Japan, pp 39–43Google Scholar
- Hansen N, Auger A, Finck S, Ros R (2009) Real-parameter black-box optimization benchmarking 2009: Experimental setup. Tech. Rep. RR-6828, INRIAGoogle Scholar
- Hansen N, Auger A, Ros R, Finck S, Pošík P (2010) Comparing results of 31 algorithms from the black-box optimization benchmarking bbob-2009. In: GECCO ’10: Proceedings of the 12th annual conference on Genetic and evolutionary computation. ACM, New York, NY, USA, pp 1689–1696Google Scholar
- Ingber L (1996) Adaptive simulated annealing (ASA): lessons learned. J Control Cybern 25:33–54Google Scholar
- Järvi T (1973) A random search optimizer with an application to a max-min problem. Publications of the Institute for Applied Mathematics (3), University of Turku, FinlandGoogle Scholar
- Johnson S (2015) The nlopt nonlinear-optimization package. http://ab-initio.mit.edu/nlopt. Accessed July 2015
- Pál L, Csendes T (2015) An improved stochastic local search method in a multistart framework. In: Proceedings of the 10th jubilee ieee international symposium on applied computational intelligence and informatics, Timisoara, pp 117–120Google Scholar
- Powell MJD (2009) The BOBYQA algorithm for bound constrained optimization without derivatives. Tech. Rep. NA2009/06, Department of Applied Mathematics and Theoretical Physics, University of Cambridge, CambridgeGoogle Scholar
- Press WH, Teukolsky SA, Vetterling WT, Flannery BP (1992) Numerical recipes in C. The art of scientific computing, 2nd edn. Cambridge University Press, New YorkGoogle Scholar