Orthogonal Latin hypercube designs for Fourier-polynomial models

Latin hypercube designs (LHDs) are widely used in computer experiments because of their one-dimensional uniformity and other properties. Recently, a number of methods have been proposed to construct LHDs with properties that all linear effects are mutually orthogonal and orthogonal to all second-order effects, i.e., quadratic effects and bilinear interactions. This paper focuses on the construction of LHDs with the above desirable properties under the Fourier-polynomial model. A convenient and flexible algorithm for constructing such orthogonal LHDs is provided. Most of the resulting designs have different run sizes from that of Butler (2001), and thus are new and very suitable for factor screening and building Fourier-polynomial models in computer experiments as discussed in Butler (2001).     

Construction of orthogonal Latin hypercube designs with flexible run sizes

Latin hypercube designs (LHDs) have recently found wide applications in computer experiments. A number of methods have been proposed to construct LHDs with orthogonality among main-effects. When second-order effects are present, it is desirable that an orthogonal LHD satisfies the property that the sum of elementwise products of any three columns (whether distinct or not) is 0. The orthogonal LHDs constructed by Ye (1998), Cioppa and Lucas (2007), Sun et al. (2009) and Georgiou (2009) all have this property. However, the run size n of any design in the former three references must be a power of two (n=2^c) or a power of two plus one (n=2^c+1), which is a rather severe restriction. In this paper, we construct orthogonal LHDs with more flexible run sizes which also have the property that the sum of elementwise product of any three columns is 0. Further, we compare the proposed designs with some existing orthogonal LHDs, and prove that any orthogonal LHD with this property, including the proposed orthogonal LHD, is optimal in the sense of having the minimum values of ave(|t|), t_max, ave(|q|) and q_max.     

On construction of constant block-sum partially balanced incomplete block designs

Abstract

Constant block-sum designs are of interest in repeated measures experimentation where the treatments levels are quantitative and it is desired that at the end of the experiments, all units have been exposed to the same constant cumulative dose. It has been earlier shown that the constant block-sum balanced incomplete block designs do not exist. As the next choice, we, in this article, explore and construct several constant block-sum partially balanced incomplete block designs. A natural choice is to first explore these designs via magic squares and Parshvanath yantram is found to be especially useful in generating designs for block size 4. Using other techniques such as pair-sums and, circular and radial arrangements, we generate a large number of constant block-sum partially balanced incomplete block designs. Their relationship with mixture designs is explored. Finally, we explore the optimization issues when constant block-sum may not be possible for the class of designs with a given set of parameters.     

Constructing 1-rotational NRDFs through an optimization approach: new (46,9,8), (51,10,9) and (55,9,8)-NRBDs

In this paper we formulate the problem of constructing 1-rotational near resolvable difference families as a combinatorial optimization problem where a global optimum corresponds to a desired difference family. Then, we develop an algorithm based on scatter search in conjunction with a tabu search to construct many of these difference families. In particular, we construct three new near resolvable difference families which lead to an equal number of new 1-rotational near resolvable block designs with parameters: (46,9,8), (51,10,9) and (55,9,8). Our results indicate that this conjunction outperforms both scatter search and tabu search.     

A multi-objective coordinate-exchange two-phase local search algorithm for multi-stratum experiments

A multi-stratum design is a useful tool for industrial experimentation, where factors that have levels which are harder to set than others, due to time or cost constraints, are frequently included. The number of different levels of hardness to set defines the number of strata that should be used. The simplest case is the split-plot design, which includes two strata and two sets of factors defined by their level of hardness-to-set. In this paper, we propose a novel computational algorithm which can be used to construct optimal multi-stratum designs for any number of strata and up to six optimality criteria simultaneously. Our algorithm allows the study of the entire Pareto front of the optimization problem and the selection of the designs representing the desired trade-off between the competing objectives. We apply our algorithm to several real case scenarios and we show that the efficiencies of the designs obtained present experimenters with several good options according to their objectives.     

Design of robust parameter experiments in a continuous space using an evolutionary optimization algorithm

Two common experimental designs used in robust parameter design (RPD) are crossed array and mixed resolution designs. However, the prohibited number of runs, constraints in the design space or special model requirements render some of these designs inadequate. This paper presents the application of an evolutionary strategy to produce nearly optimal design matrices for RPD. The designs are derived by solving a nonlinear optimization problem involving both 𝒟- and 𝒢-efficiency simultaneously. The methodology presented allows the user to obtain new exact designs for a specific number of runs, and a particular experimental region. The combination of 𝒟- and 𝒢-efficiency results in experimental designs that outperform the corresponding benchmarks.     

Computer-aided unbalanced supersaturated designs involving interactions

Supersaturated designs (SSDs) are defined as fractional factorial designs whose experimental run size is smaller than the number of main effects to be estimated. While most of the literature on SSDs has focused only on main effects designs, the construction and analysis of such designs involving interactions has not been developed to a great extent. In this paper, we propose a backward elimination design-driven optimization (BEDDO) method, with one main goal in mind, to eliminate the factors which are identified to be fully aliased or highly partially aliased with each other in the design. Under the proposed BEDDO method, we implement and combine correlation-based statistical measures taken from classical test theory and design of experiments field, and we also present an optimality criterion which is a modified form of Cronbach's alpha coefficient. In this way, we provide a new class of computer-aided unbalanced SSDs involving interactions, that derive directly from BEDDO optimization.     

Optimal regular graph designs

A typical problem in optimal design theory is finding an experimental design that is optimal with respect to some criteria in a class of designs. The most popular criteria include the A- and D-criteria. Regular graph designs occur in many optimality results, and if the number of blocks is large enough, an A-optimal (or D-optimal) design is among them (if any exist). To explore the landscape of designs with a large number of blocks, we introduce extensions of regular graph designs. These are constructed by adding the blocks of a balanced incomplete block design repeatedly to the original design. We present the results of an exact computer search for the best regular graph designs and the best extended regular graph designs with up to 20 treatments v, block size \(k \le 10\) and replication r \(\le 10\) and \(r(k-1)-(v-1)\lfloor r(k-1)/(v-1)\rfloor \le 9\).     

ON OPTIMIZING MULTI-LEVEL DESIGNS: POWER UNDER BUDGET CONSTRAINTS

This paper derives a procedure for efficiently allocating the number of units in multi‐level designs given prespecified power levels. The derivation of the procedure is based on a constrained optimization problem that maximizes a general form of a ratio of expected mean squares subject to a budget constraint. The procedure makes use of variance component estimates to optimize designs during the budget formulating stages. The method provides more general closed form solutions than other currently available formulae. As such, the proposed procedure allows for the determination of the optimal numbers of units for studies that involve more complex designs. A method is also described for optimizing designs when variance component estimates are not available. Case studies are provided to demonstrate the method.     

PARTIALLY EQUINEIGHBOURED DESIGNS

This paper presents further results on a class of designs called equineighboured designs, ED. These designs are intended for field and related experiments, especially whenever there is evidence that observations in the same block are correlated. An ED has the property that every unordered pair of treatments occurs as nearest neighbours equally frequently at each level. Ipinyomi (1986) has defined and shown that ED are balanced designs when neighbouring observations are correlated. He has also presented ED as a continuation of the development of optimal block designs. An ED would often require many times the number of experimental materials needed for the construction of an ordinary balanced incomplete block, BIB, design for the same number of treatments and block sizes. Thus for a relatively large number of treatments and block sizes the required minimum number of blocks may be excessively large for practical use of ED. In this paper we shall define and examine partially equineighboured designs with n concurrences, PED (n), as alternatives where ED are practically unachievable. Particular attention will be given to designs with smaller numbers of blocks and for which only as little balance as possible may be lost.     

A bound connected with 26 factorial search designs of resolution 3.1

In this paper, we give a lower bound for the number of treatments required

for a plan to be a main effect plus one plan for 2^m (m = 6) factorial experiments, The lower bound problem is important in the event of generating new designs with similar properties or when one wants to study the criteria of optimality for such designs.     

Optimal Bayesian two-phase designs

In this paper we present a Bayesian decision theoretic approach to the two-phase design problem. The solution of such sequential decision problems is usually difficult to obtain because of their reliance on preposterior analysis. In overcoming this problem, we adopt the Mont-Carlo-based approach of Müller and Parmigiani (1995) and develop optimal Bayesian designs for two-phase screening tests. A rather attractive feature of the Monte-Carlo approach is that it facilitates the preposterior analysis by replacing it with a sequence of scatter plot smoothing/regression techniques and optimization of the corresponding fitted surfaces. The method is illustrated for depression in adolescents using data from past studies.     

Optimal designs for the logit and probit models for binary data

We consider optimal designs for a class of symmetric models for binary data which includes the common probit and logit models. We show that for a large group of optimality criteria which includes the main ones in the literature (e.g. A-, D-, E-, F- and G-optimality) the optimal design for our class of models is a two-point design with support points symmetrically placed about the ED50 but with possibly unequal weighting. We demonstrate how one can further reduce the problem to a one-variable optimization by characterizing various of the common criteria. We also use the results to demonstrate major qualitative differences between the F - and c-optimal designs, two design criteria which have similar motivation.     

Search for optimal designs in a three stagenested random model

In this paper we define a class of unbalanced designs, denoted by C_k,s,t, for estimating the components of variance in a k-stage nested random effects linear model. This class contains many of the designs proposed in the literature for nested components of variance models. We focus on the three-state model and discuss the determination of locally optimal designs within this class using a systematic computer search. For large sample sizes we show that approximate optimal designs may be obtained using a limit argument combined with numerical optimization. A comparison of our designs with previously published designs suggests that, in many cases, our designs result in substantial gains in efficiency.     

An Optimality Probability Index for Correlated Multiple Responses

In the real problems, there are many cases which have correlated quality characteristics so multiple response optimization can be more realistic if we can consider correlation structure of responses. In this study we propose a new method which uses multivariate normal probability to find the optimal treatment in an experimental design. Moreover, a heuristic method is used to find better factors’ level in all possible combinations in the designs with large number of controllable factors and their levels. Some simulated numerical examples and a real case were studied by the proposed approach and the comparison of the results with previous methods show efficiency of the proposed method.     

Simulation-based designs for accelerated life tests

In this paper we present a Bayesian decision theoretic approach to the design of accelerated life tests (ALT). We discuss computational issues regarding the evaluation of expectation and optimization steps in the solution of the decision problem. We illustrate how Monte Carlo methods can be used in preposterior analysis to find optimal designs and how the required computational effort can be avoided by using curve-fitting techniques. In so doing, we adopt the recent Monte-Carlo-based approaches of Muller and Parmigiani (1995. J. Amer. Statist. Assoc. 90, 503–510) and Muller (2000. Bayesian Statistics 6, forthcoming) to develop optimal Bayesian designs. These approaches facilitate the preposterior analysis by replacing it with a sequence of scatter plot smoothing/regression techniques and optimization of the corresponding fitted surfaces. We present our development by considering single and multiple-point fixed, as well as, sequential design problems when the underlying life model is exponential, and illustrate the implementation of our approach with some examples.     

A modification of the Box–Meyer method for finding the active factors in screening experiments

Screening experiments are conducted to identify a few active factors among a large number of factors. For the objective of identifying active factors, Box and Meyer provided an innovative approach, the Box–Meyer method (BMM). With the use of means models, we propose a modification of the BMM in this paper. Compared with the original BMM, the modified BMM (MBMM) can circumvent the problem that the original BMM runs into, namely that it may fail to identify some active factors due to the ignorance of higher order interactions. Furthermore, the number of explanatory variables in the MBMM is smaller. Therefore, the computational complexity is reduced. Finally, three examples with different types of designs are used to demonstrate the wide applicability of the MBMM.     

Some sufficient conditions for the type 1 optimality of block designs

In this paper, we investigate the problem of determining block designs which are optimal under type 1 optimality criteria within various classes of designs having υ treatments arranged in b blocks of size k. The solutions to two optimization problems are given which are related to a general result obtained by Cheng (1978) and which are useful in this investigation. As one application of the solutions obtained, the definition of a regular graph design given in Mitchell and John (1977) is extended to that of a semi-regular graph design and some sufficient conditions are derived for the existence of a semi-regular graph design which is optimal under a given type 1 criterion. A result is also given which shows how the sufficient conditions derived can be used to establish the optimality under a specific type 1 criterion of some particular types of semi- regular graph designs having both equal and unequal numbers of replicates. Finally,some sufficient conditions are obtained for the dual of an A- or D-optimal design to be A- or D-optimal within an appropriate class of dual designs.     

Efficient circular neighbour designs for spatial interference model

We consider circular block designs for field-trials when there are two-sided spatial interference between neighbouring plots of the same blocks. The parameter of interest is total effects that is the sum of direct effect of treatment and neighbour effects, which correspond to the use of a single treatment in the whole field. We determine universally optimal approximate designs. When the number of blocks may be large, we propose efficient exact designs generated by a single sequence of treatment. We also give efficiency factors of the usual binary block neighbour balanced designs which can be used when the number of blocks is small.     

A new characterization of Elfving's method for high dimensional computation

We give a new characterization of Elfving's (1952) method for computing c-optimal designs in k dimensions which gives explicit formulae for the k unknown optimal weights and k unknown signs in Elfving's characterization. This eliminates the need to search over these parameters to compute c-optimal designs, and thus reduces the computational burden from solving a family of optimization problems to solving a single optimization problem for the optimal finite support set. We give two illustrative examples: a high dimensional polynomial regression model and a logistic regression model, the latter showing that the method can be used for locally optimal designs in nonlinear models as well.