ABSTRACT
There are many designs introduced for computer experiments; see [1, 5, 6, 7] among others. Some authors proposed orthogonal space-filling designs and showed their good properties [2, 4, 8, 9]. In this paper we consider a class of orthogonal designs that optimize some optimal criterion but are not limited as Latin hypercube designs. A block coordinate descent algorithm is proposed to construct them.
