This paper describes and provides MATLAB code for a hybrid algorithm that finds the global minimum for n-dimensional unconstrained optimization problems using Cubic chaotic map in stage-1 and Hooke-Jeeves method in stage-2. Eight benchmark functions are considered for evaluating the MATLAB code. The results that are obtained are tabulated for different dimensions such as 10D, 50D, 100D and 500D.
M. Vallabhaneni, Madulla, B., Sarada Jayan, and R. Subramani, “Chaotic Hooke-Jeeves Algorithm using Cubic map with MATLAB code”, IEEE International Conference for Innovation in Technology (INOCON). IEEE, Bangluru, India, 2020.