Random search is an optimization method that attempts to find the optimum by testing the objective function's value on a series of combinations of random values of the adjustable parameters. The random values are generated complying with any boundaries selected by the user, furthermore, any combinations of parameter values that do not fulfill constraints on the variables are excluded. This means that the method is capable of handling bounds on the adjustable parameters and fulfilling constraints.
For infinite number of iterations this method is guaranteed to find the global optimum of the objective function. In general one is interested in processing a very large number of iterations.
Options for Random Search
Number of Iterations
This parameter is a positive integer to determine the number of parameter sets to be drawn before the algorithm stops. The default value is '100000'.
Random Number Generator
The parameter is an enumeration value to determine which random number generator this method shall use. COPASI provides two random number generators R250 [Maier91] (selected through the value 0) and the Mersenne Twister [Matsumoto98] (selected through the value 1 (default)).
The parameter is a positive integer value to determine the seed for the random number generator. A value of zero instructs COPASI to select a "random" value.