Optimal partially balanced nested row-column designs

A partially balanced nested row-column design, referred to as PBNRC, is defined as an arrangement of v treatments in b p × q blocks for which, with the convention that p q, the information matrix for the estimation of treatment parameters is equal to that of the column component design which is itself a partially balanced incomplete block design. In this paper, previously known optimal incomplete block designs, and row-column and nested row-column designs are utilized to develop some methods of constructing optimal PBNRC designs. In particular, it is shown that an optimal group divisible PBNRC design for v = mn kn treatments in p × q blocks can be constructed whenever a balanced incomplete block design for m treatments in blocks of size k each and a group divisible PBNRC design for kn treatments in p × q blocks exist. A simple sufficient condition is given under which a group divisible PBNRC is Ψ_f-better for all f> 0 than the corresponding balanced nested row-column designs having binary blocks. It is also shown that the construction techniques developed particularly for group divisible designs can be generalized to obtain PBNRC designs based on rectangular association schemes.     

On the Choice of a Prior for Bayesian D-Optimal Designs for the Logistic Regression Model with a Single Predictor

The Bayesian design approach accounts for uncertainty of the parameter values on which optimal design depends, but Bayesian designs themselves depend on the choice of a prior distribution for the parameter values. This article investigates Bayesian D-optimal designs for two-parameter logistic models, using numerical search. We show three things: (1) a prior with large variance leads to a design that remains highly efficient under other priors, (2) uniform and normal priors lead to equally efficient designs, and (3) designs with four or five equidistant equally weighted design points are highly efficient relative to the Bayesian D-optimal designs.     

Locally and maximin optimal designs for multi-factor nonlinear models

This paper considers the search for locally and maximin optimal designs for multi-factor nonlinear models from optimal designs for sub-models of a lower dimension. In particular, sufficient conditions are given so that maximin D-optimal designs for additive multi-factor nonlinear models can be built from maximin D-optimal designs for their sub-models with a single factor. Some examples of application are models involving exponential decay in several variables.     

ADJUSTED ORTHOGONAL NESTED ROW-COLUMN DESIGNS

Adjusted orthogonality in nested row-column designs is defined and a sufficient condition established for its existence. It is shown that the properties of an adjusted orthogonal nested row-column design are directly related to those of its separate row and column component designs. A method for constructing efficient adjusted orthogonal designs involving a single replicate of every treatment in each of two blocks is given.     

On the Functional Approach to Bayesian Efficient Designs for Nonlinear Regression Models

The present article is devoted to an extension of the functional approach elaborated in the book Melas (2006 Melas , V. B. ( 2006 ). Functional Approach to Optimal Experimental Design . Lecture Notes in Statistics , Vol. 184. Heidelberg : Springer . [Google Scholar]) for studying optimal designs in linear and nonlinear regression models. Here we consider Bayesian efficient designs for nonlinear models under the standard assumptions on the observational errors. Sufficient conditions for uniqueness of locally optimal and Bayesian efficient designs for common optimality criteria are given. L-efficient Bayesian designs are constructed and investigated for a special nonlinear regression model of a rational form as an illustration of our main results. This model is interesting in both a practical and a theoretical sense.     

Robustness properties of minimally‐supported Bayesian D‐optimal designs for heteroscedastic models

Bayesian D‐optimal designs supported on a fixed number of points were found by Dette & Wong (1998) for estimating parameters in a polynomial model when the error variance depends exponentially on the explanatory variable. The present authors provide optimal designs under a broader class of error variance structures and investigate the robustness properties of these designs to model and prior distribution assumptions. A comparison of the performance of the optimal designs relative to the popular uniform designs is also given. The authors' results suggest that Bayesian D‐optimal designs suported on a fixed number of points are more likely to be globaly optimal among all designs if the prior distribution is symmetric and is concentrated around its mean.     

A note on all-bias designs with applications in spline regression models

If a model is fitted to empirical data, bias can arise from terms which are not incorporated in the model assumptions. As a consequence the commonly used optimality criteria based on the generalized variance of the estimator of the model parameters may not lead to efficient designs for the statistical analysis. In this note some general aspects of all-bias designs are presented, which were introduced in this context by Box and Draper (1959). Using an interesting correspondence between the points of all-bias designs and the knots of quadrature formulas we establish sufficient conditions such that a given design is an all-bias design. The results are illustrated in the special case of spline regression models. In particular our results generalize recent findings of Woods and Lewis (2006).     

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.     

Regular group divisible designs and Bhaskar Rao designs with block size three

Some recursive constructions are given for Bhaskar Rao designs. Using examples of these designs found by Shyam J. Singh, Rakesh Vyas and new ones given here we show the necessary conditions λ≡0 (mod 2), λυ(υ?1)≡0 (mod 24) are sufficient for the existence of Bhaskar Rao designs with one association class and block size 3. This result is used with a result of Street and Rodger to obtain regular partially balanced block designs with 2υ treatments, block size 3, λ₁=0, group size 2 and υ groups.     

Robust designs for linear mixed effects models

Summary.  In health sciences, medicine and social sciences linear mixed effects models are often used to analyse time-structured data. The search for optimal designs for these models is often hampered by two problems. The first problem is that these designs are only locally optimal. The second problem is that an optimal design for one model may not be optimal for other models. In this paper the maximin principle is adopted to handle both problems, simultaneously. The maximin criterion is formulated by means of a relative efficiency measure, which gives an indication of how much efficiency is lost when the uncertainty about the models over a prior domain of parameters is taken into account. The procedure is illustrated by means of three growth studies. Results are presented for a vocabulary growth study from education, a bone gain study from medical research and an epidemiological decline in height study. It is shown that, for the mixed effects polynomial models that are applied to these studies, the maximin designs remain highly efficient for different sets of models and combinations of parameter values.     

Some methods for constructing C-designs

Block designs having a property described by Caliński (1971) and Saha (1976), referred to as C-property, are further considered. A necessary and sufficient condition for a block design to have the C-property is given by Saha (1976) and another by Ceranka and Koz?owska (1983). In this paper some methods for constructing such block designs are presented.     

An algorithm for constructing optimal resolvable incomplete block designs

This paper describes an efficient algorithm for the construction of optimal or near-optimal resolvable incomplete block designs (IBDs) for any number of treatments v < 100. The performance of this algorithm is evaluated against known lattice designs and the 414 or-designs of Patterson & Williams [36]. For the designs under study, it appears that our algorithm is about equally effective as the simulated annealing algorithm of Venables & Eccleston [42]. An example of the use of our algorithm to construct the row (or column) components of resolvable row-column designs is given.     

Optimal Designs for the Carryover Model with Random Interactions Between Subjects and Treatments

The paper considers a model for crossover designs with carryover effects and a random interaction between treatments and subjects. Under this model, two observations of the same treatment on the same subject are positively correlated and therefore provide less information than two observations of the same treatment on different subjects. The introduction of the interaction makes the determination of optimal designs much harder than is the case for the traditional model. Generalising the results of Bludowsky's thesis, the present paper uses Kushner's method to determine optimal approximate designs. We restrict attention to the case where the number of periods is less than or equal to the number of treatments. We determine the optimal designs in the important special cases that the number of periods is 3, 4 or 5. It turns out that the optimal designs depend on the variance of the random interactions and in most cases are not binary. However, we can show that neighbour balanced binary designs are highly efficient, regardless of the number of periods and of the size of the variance of the interaction effects.     

Balanced Treatment incomplete block (BTIB) designs for comparing treatments with a control: minimal complete sets of generator designs for k = 3, p = 3(1)10

Bechhofer and Tamhane (1981) proposed a new class of incomplete block designs called BTIB designs for comparing p ≥ 2 test treatments with a control treatment in blocks of equal size k < p + 1. All BTIB designs for given (p,k) can be constructed by forming unions of replications of a set of elementary BTIB designs called generator designs for that (p,k). In general, there are many generator designs for given (p,k) but only a small subset (called the minimal complete set) of these suffices to obtain all admissible BTIB designs (except possibly any equivalent ones). Determination of the minimal complete set of generator designs for given (p,k) was stated as an open problem in Bechhofer and Tamhane (1981). In this paper we solve this problem for k = 3. More specifically, we give the minimal complete sets of generator designs for k = 3, p = 3(1)10; the relevant proofs are given only for the cases p = 3(1)6. Some additional combinatorial results concerning BTIB designs are also given.     

Resolution v.2 search designs

A fractional factorial design is called a resolution V.2 plan if it is capable of estimating all main effects and two-factor interaction effects, plus two three-factor interaction effects, In this paper, a necessary and sufficient condition for such a resolution V.2 plan is given, Furthermore, a new class of two-level resolution V.2 designs is proposed, We prove that the proposed design always satisfies such a necessary and sufficient condition, A comparison of run size between designs of resolutions VII and V.2 is made, It is shown that run size for design of resolution V.2 is significantly smaller.     

A-optimal diallel crosses for test versus control comparisons

A-optimality of block designs for control versus test comparisons in diallel crosses is investigated. A sufficient condition for designs to be A-optimal is derived. Type S₀ designs are defined and A-optimal type S₀ designs are characterized. A lower bound to the A-efficiency of type S₀ designs is also given. Using the lower bound to A-efficiency, type S₀ designs are shown to yield efficient designs for test versus control comparisons.     

Optimal designs for generalized linear models

Summary This paper solves some D-optimal design problems for certain Generalized Linear Models where the mean depends on two parameters and two explanatory variables. In all of the cases considered the support point of the optimal designs are found to be independent of the unknown parameters. While in some cases the optimal design measures are given by two points with equal weights, in others the support is given by three point with weights depending on the unknown parameters, hence the designs are locally optimal in general. Empirical results on the efficiency of the locally optimal designs are also given. Some of the designs found can also be used for planning D-optimal experiments for the normal linear model, where the mean must be positive. This research was carried out in part at University College, London as an M.Sc. project. Thanks are due to Prof. I. Ford (University of Glasgow) and Prof. A. Giovagnoli (University of Perugia) for their valuable suggestions and critical observations.     

Optimal and efficient crossover designs for comparing test treatments to a control treatment under various models

We study the optimality, efficiency, and robustness of crossover designs for comparing several test treatments to a control treatment. Since A-optimality is a natural criterion in this context, we establish lower bounds for the trace of the inverse of the information matrix for the test treatments versus control comparisons under various models. These bounds are then used to obtain lower bounds for efficiencies of a design under these models. Two algorithms, both guided by these efficiencies and results from optimal design theory, are proposed for obtaining efficient designs under the various models.     

Approximate theory of multiway block designs

Optimality properties of multiway block designs are deduced from the general results of J. Kiefer's approximate-design theory. In the model with additive effects these optimality properties solely depend on the two-dimensional marginals of the designs. Uniform designs, and designs whose two-dimensional marginals are products of the one-dimensional marginals, are shown to be optimal. Approximate Youden designs are introduced for the case when the support sets of the two-dimensional marginals are prescribed in advance. They are optimal in a relatively small class of competing designs only.     

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.