A note on trend-free block designs

Trend-free and nearly trend-free block designs were developed to eliminate polynomial trends across the plots of experimental designs. Yeh, Bradley and Notz (1985) proved that certain nearly trend-free designs are A- and D-optimal in a subclass of all competing designs. This article extends that result by enlarging the class of designs for which the optimality holds, and by increasing the class of optimality criteria from A- and D-optimality to the class of all Schur-convex nonincreasing functions.     

Minimum cost linear trend-free 12-run fractional factorial designs

Time trend resistant fractional factorial experiments have often been based on regular fractionated designs where several algorithms exist for sequencing their runs in minimum number of factor-level changes (i.e. minimum cost) such that main effects and/or two-factor interactions are orthogonal to and free from aliasing with the time trend, which may be present in the sequentially generated responses. On the other hand, only one algorithm exists for sequencing runs of the more economical non-regular fractional factorial experiments, namely Angelopoulos et al. [1 P. Angelopoulos, H. Evangelaras, and C. Koukouvinos, Run orders for efficient two-level experimental plans with minimum factor level changes robust to time trends, J. Statist. Plann. Inference 139 (2009), pp. 3718–3724. doi: 10.1016/j.jspi.2009.05.002[Crossref], [Web of Science ®] , [Google Scholar]]. This research studies sequential factorial experimentation under non-regular fractionated designs and constructs a catalog of 8 minimum cost linear trend-free 12-run designs (of resolution III) in 4 up to 11 two-level factors by applying the interactions-main effects assignment technique of Cheng and Jacroux [3 C.S. Cheng and M. Jacroux, The construction of trend-free run orders of two-level factorial designs, J. Amer. Statist. Assoc. 83 (1988), pp. 1152–1158. doi: 10.1080/01621459.1988.10478713[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]] on the standard 12-run Plackett–Burman design, where factor-level changes between runs are minimal and where main effects are orthogonal to the linear time trend. These eight 12-run designs are non-orthogonal but are more economical than the linear trend-free designs of Angelopoulos et al. [1 P. Angelopoulos, H. Evangelaras, and C. Koukouvinos, Run orders for efficient two-level experimental plans with minimum factor level changes robust to time trends, J. Statist. Plann. Inference 139 (2009), pp. 3718–3724. doi: 10.1016/j.jspi.2009.05.002[Crossref], [Web of Science ®] , [Google Scholar]], where they can accommodate larger number of two-level factors in smaller number of experimental runs. These non-regular designs are also more economical than many regular trend-free designs. The following will be provided for each proposed systematic design:

• (1) The run order in minimum number of factor-level changes.

• (2) The total number of factor-level changes between the 12 runs (i.e. the cost).

• (3) The closed-form least-squares contrast estimates for all main effects as well as their closed-form variance–covariance structure.

In addition, combined designs of each of these 8 designs that can be generated by either complete or partial foldover allow for the estimation of two-factor interactions involving one of the factors (i.e. the most influential).     

Remainder modified systematic sampling in the presence of linear trend

If the population size is not a multiple of the sample size, then the usual linear systematic sampling design is unattractive, since the sample size obtained will either vary, or be constant and different to the required sample size. Only a few modified systematic sampling designs are known to deal with this problem and in the presence of linear trend, most of these designs do not provide favorable results. In this paper, a modified systematic sampling design, known as remainder modified systematic sampling (RMSS), is introduced. There are seven cases of RMSS and the results in this paper suggest that the proposed design is favorable, regardless of each case, while providing linear trend-free sampling results for three of the seven cases. To obtain linear trend-free sampling for the other cases and thus improve results, an end corrections estimator is constructed.     

Robust sequential designs for approximately linear models

We consider the problem of the sequential choice of design points in an approximately linear model. It is assumed that the fitted linear model is only approximately correct, in that the true response function contains a nonrandom, unknown term orthogonal to the fitted response. We also assume that the parameters are estimated by M-estimation. The goal is to choose the next design point in such a way as to minimize the resulting integrated squared bias of the estimated response, to order n^-1. Explicit applications to analysis of variance and regression are given. In a simulation study the sequential designs compare favourably with some fixed-sample-size designs which are optimal for the true response to which the sequential designs must adapt.     

On the existence of linear trend free block designs

We present a class of counerexamples for a conjecture on the existence or linear trend free block designs we will also prove a considerably weakened version of this conjecture which will determine all combinations of designs parmetres for which the class of linear trend free block designs is non empty.     

Algorithmic construction of optimal block designs for two-colour cDNA microarray experiments using the linear mixed effects model

ABSTRACT

In this study, methods for efficient construction of A-, MV-, D- and E-optimal or near-optimal block designs for two-colour cDNA microarray experiments with array as the block effect are considered. Two algorithms, namely the array exchange and treatment exchange algorithms together with the complete enumeration technique are introduced. For large numbers of arrays or treatments or both, the complete enumeration method is highly computer intensive. The treatment exchange algorithm computes the optimal or near-optimal designs faster than the array exchange algorithm. The two methods however produce optimal or near-optimal designs with the same efficiency under the four optimality criteria.     

A SEQUENTIAL METHOD OF CONSTRUCTING OPTIMAL BLOCK DESIGNS

An algorithm for the construction of a wide class of block designs including Balanced Incomplete Blocks (BIB) is described. The algorithm which allows the experimenter to give weights for a set of treatment contrasts uses an initial starting design to generate an optimal block design sequentially. The performance of the algorithm is illustrated by examples, and designs constructed by the algorithm compare favourably with designs generated by other methods.     

ON CONSTRUCTION OF GENERALIZED GROUP DIVISIBLE DESIGNS WITH TWO GROUPS

ABSTRACT

Many simple and general methods of construction, using α-resolvable balanced incomplete block designs, for generalized group divisible designs with two groups (GGDD(2)) are given. The E-optimality of all constructed designs is also discussed.     

Balanced treatment incomplete block designs through integer programming

An algorithm is presented to construct balanced treatment incomplete block (BTIB) designs using a linear integer programming approach. Construction of BTIB designs using the proposed approach is illustrated with an example. A list of efficient BTIB designs for 2 ? v ? 12, v + 1 ? b ? 50, 2 ? k ? min(10, v), r ? 10, r₀ ? 20 is provided. The proposed algorithm is implemented as part of an R package.     

An evolutionary algorithm for A-optimal incomplete block designs

Evolutionary algorithms are heuristic stochastic search and optimization techniques with principles taken from natural genetics. They are procedures mimicking the evolution process of an initial population through genetic transformations. This paper is concerned with the problem of finding A-optimal incomplete block designs for multiple treatment comparisons represented by a matrix of contrasts. An evolutionary algorithm for searching optimal, or nearly optimal, incomplete block designs is described in detail. Various examples regarding the application of the algorithm to some well-known problems illustrate the good performance of the algorithm     

E- and R-optimality of block designs for treatment-control comparisons

Abstract

We study optimal block designs for comparing a set of test treatments with a control treatment. We provide the class of all E-optimal approximate block designs, which is characterized by simple linear constraints. Based on this characterization, we obtain a class of E-optimal exact designs for unequal block sizes. In the studied model, we provide a statistical interpretation for wide classes of E-optimal designs. Moreover, we show that all approximate A-optimal designs and a large class of A-optimal exact designs for treatment-control comparisons are also R-optimal. This reinforces the observation that A-optimal designs perform well even for rectangular confidence regions.     

A clustering-based coordinate exchange algorithm for generating G-optimal experimental designs

In the optimal experimental design literature, the G-optimality is defined as minimizing the maximum prediction variance over the entire experimental design space. Although the G-optimality is a highly desirable property in many applications, there are few computer algorithms developed for constructing G-optimal designs. Some existing methods employ an exhaustive search over all candidate designs, which is time-consuming and inefficient. In this paper, a new algorithm for constructing G-optimal experimental designs is developed for both linear and generalized linear models. The new algorithm is made based on the clustering of candidate or evaluation points over the design space and it is a combination of point exchange algorithm and coordinate exchange algorithm. In addition, a robust design algorithm is proposed for generalized linear models with modification of an existing method. The proposed algorithm are compared with the methods proposed by Rodriguez et al. [Generating and assessing exact G-optimal designs. J. Qual. Technol. 2010;42(1):3–20] and Borkowski [Using a genetic algorithm to generate small exact response surface designs. J. Prob. Stat. Sci. 2003;1(1):65–88] for linear models and with the simulated annealing method and the genetic algorithm for generalized linear models through several examples in terms of the G-efficiency and computation time. The result shows that the proposed algorithm can obtain a design with higher G-efficiency in a much shorter time. Moreover, the computation time of the proposed algorithm only increases polynomially when the size of model increases.     

Constructions of Nested Pairwise Efficiency and Variance Balanced Designs

ABSTRACT

Nested pairwise efficiency and variance balanced designs form a new class of block designs. In this article, two methods of constructing such designs from a symmetric balanced incomplete block design are proposed with some illustrations.     

A new extension strategy on three-level factorials under wrap-around L2-discrepancy

Sequential experiment is an indispensable strategy and is applied immensely to various fields of science and engineering. In such experiments, it is desirable that a given design should retain the properties as much as possible when few runs are added to it. The designs based on sequential experiment strategy are called extended designs. In this paper, we have studied theoretical properties of such experimental strategies using uniformity measure. We have also derived a lower bound of extended designs under wrap-around L₂-discrepancy measure. Moreover, we have provided an algorithm to construct uniform (or nearly uniform) extended designs. For ease of understanding, some examples are also presented and a lot of sequential strategies for a 27-run original design are tabulated for practice.     

On constructing general minimum lower order confounding two-level block designs

In practice, to reduce systematic variation and increase precision of effect estimation, a practical design strategy is then to partition the experimental units into homogeneous groups, known as blocks. It is an important issue to study the optimal way on blocking the experimental units. Blocked general minimum lower order confounding (B¹-GMC) is a new criterion for selecting optimal block designs. The paper considers the construction of optimal two-level block designs with respect to the B¹-GMC criterion. By utilizing doubling theory and MaxC2 design, some optimal block designs with respect to the B¹-GMC criterion are obtained.     

COMPUTER-AIDED CONSTRUCTION OF SMALL (M, S)-OPTIMAL INCOMPLETE BLOCK DESIGNS

A new exchange algorithm for the construction of (M, S)-optimal incomplete block designs (IBDS) is developed. This exchange algorithm is used to construct 973 (M, S)-optimal IBDs (v, k, b) for v= 4,…,12 (varieties) with arbitrary v, k (block size) and b (number of blocks). The efficiencies of the “best” (M, S)-optimal IBDs constructed by this algorithm are compared with the efficiencies of the corresponding nearly balanced incomplete block designs (NBIBDs) of Cheng(1979), Cheng & Wu (1981) and Mitchell & John(1976).     

On Exact K-optimal Designs Minimizing the Condition Number

A new design criterion based on the condition number of an information matrix is proposed to construct optimal designs for linear models, and the resulting designs are called K-optimal designs. The relationship between exact and asymptotic K-optimal designs is derived. Since it is usually hard to find exact optimal designs analytically, we apply a simulated annealing algorithm to compute K-optimal design points on continuous design spaces. Specific issues are addressed to make the algorithm effective. Through exact designs, we can examine some properties of the K-optimal designs such as symmetry and the number of support points. Examples and results are given for polynomial regression models and linear models for fractional factorial experiments. In addition, K-optimal designs are compared with A-optimal and D-optimal designs for polynomial regression models, showing that K-optimal designs are quite similar to A-optimal designs.     

Robust designs for experiments with blocks

ABSTRACT

For experiments running in field plots or over time, the observations are often correlated due to spatial or serial correlation, which leads to correlated errors in a linear model analyzing the treatment means. Without knowing the exact correlation matrix of the errors, it is not possible to compute the generalized least-squares estimator for the treatment means and use it to construct optimal designs for the experiments. In this paper, we propose to use neighborhoods to model the covariance matrix of the errors, and apply a modified generalized least-squares estimator to construct robust designs for experiments with blocks. A minimax design criterion is investigated, and a simulated annealing algorithm is developed to find robust designs. We have derived several theoretical results, and representative examples are presented.     

Some new factor screening designs using the search linear model

Factor screening designs for searching two and three effective factors using the search linear model are discussed. The construction of such factor screening designs involved finding a fraction with small number of treatments of a 2^m factorial experiment having the property P_2t (no 2t columns are linearly dependent) for t=2 and 3. A ‘Packing Problem’ is introduced in this connection. A complete solution of the problem in one case and partial solutions for the other cases are presented. Many practically useful new designs are listed.