Given target positions \(\mathbf {u}^{\text{ex}}=(-0.45BW,0.45BW)\) , both targets are also in the search region with \(u_g=-0.45BW\) . The curves (a) and (b) show that for Algorithm 1 (with bounding \(\eta =0.8\text{æ}\) ) the convergence with a poor initialization can be improved using a larger value of \(\delta \)  in (REF ). The convergence to the minimum takes place very cautiously, in time increments \(t_n=\sum _{k=1}^n\frac{1}{k}\) , where \(n\)  is the number of iterations [1]}.
