Algorithm 2 Hooke–Jeeves algorithm (pseudocode).

1:Search the space around the current point ${\mathbf{x}}^{\mathbf{k}}$ along directions from the orthogonal base $[{\mathbf{d}}^{\mathbf{1}},{\mathbf{d}}^{\mathbf{2}},\dots ,{\mathbf{d}}^{\mathbf{n}}]$ with step ${\tau }^i$ $(i=1,2,\dots ,n)$. This is an exploratory move. 2:If a better point is found, continue in that direction. This is a pattern move. 3:If no better point is found then narrow down the search space using the narrowing parameter $\beta$.