Algorithm 2: The Multistart Algorithm

1:   $i=0$ and $X^{*}=$.

2:   Take a random sample x from S.

3:   Start a deterministic local search process at x and conclude at a local minimum $x^{*}$.

4:   Check if a new minimum is found.

5:   $x^{*}\notin X^{*}$ then

6:           $i\leftarrow i+1$.

7:           $x_i^{*}=x^{*}$.

8:           $X^{*}\leftarrow X^{*}\cup \left\{x_i^{*}\right\}$.

9:   end.

10: If ending criteria have been met, terminate the process.

11: Go to step 2.