Global optimization combining Monte Carlo and Quasi Monte Carlo simulation with a local search. The local searches can be easily speeded up by using a network of local workstations.
multiStartoptim generates pseudo-random and quasi-random numbers within the search domain specified by its bounds. Local searches are then performed by a user-selected method, either on the whole set of numbers generated as starting points, or only on the points lying under the objective function's median. When (and only when) a high number of local searches are to be performed, parallel computation can be used to speed-up the search.