The simplest and fastest algorithm is the sequential search due to Dykstra (1971), which starts with an empty design and adds successive candidate points so that the chosen criterion is optimized at ...

Under the assumptions of Weitzman’s sequential search algorithm, the proposed procedure recursively makes random draws for each quantity that requires numerical integration while enforcing the ...