On the construction of optimal designs

Two strategies for specifying additional data to be included with the data of a non-orthogonal design are presented. The additional data increase the magnitude of the information matrix X′X and the orthogonality of the design matrix. Sequentially, the new points are augmented to the original design, such that each new point optimally increases the smallest eigenvalue of X′X. The new runs are created in a predefined spherical region and a rectangular region. Optimum number of additional observations is presented in order to orthogonalize the design matrix X and optimize some functions of the information matrix X′X. Comparisons of the results acquired with the proposed methods versus the most commonly used procedures for data augmentation are carried out. In addition, the advantages of the use of our techniques over the studied methods to solve the augmenting data problems are discussed.     

Efficient construction of Bayes optimal designs for stochastic process models

Statistics and Computing - Stochastic process models are now commonly used to analyse complex biological, ecological and industrial systems. Increasingly there is a need to deliver accurate...     

The construction of multi-factor crossover designs in animal husbandry studies

For ethical reasons it is important to try to obtain as much useful information as possible from an animal experiment whilst minimizing the number of animals used. Crossover designs, where applicable, provide an ideal framework for achieving this. If two or more treatment factors are included in the crossover design then the reduction in total animal usage can be considerable. In this paper we consider such designs, defined as multi-factor crossover designs. The designs are applicable when there are several different treatment factors, each at t levels, to be applied to the experimental units. The motivation for investigating these designs was a study conducted at GlaxoSmithKline to determine the preference of male and female dogs for t=5 different types of bed and t=5 different bedding conditions. A construction method is given for forming universally optimal designs for t not too large. Also given is an example for the special case where the number of treatment levels t=6.     

Some advances in optimal designs in contingent valuation studies

When an organisation such as a local or health authority or an environmental agency is considering making new or increased charges for a (new) amenity it might commission a survey in which a key question would be of the form:‘Are you Willing To Pay an amount X for the (new) amenity?’.This illustrates one type of contingent valuation (CV) study, namely, a dichotomous choice CV study with the figure X being a ‘Bid’ value. The paper will focus on double bounded CV's in which a second bid is offered.In particular we focus on optimal designs for the second bid of a double bounded study given the response at the first bid. These will be useful when there is a time gap between offering the two bids.     

Penalized optimal designs for dose-finding

Optimal design under a cost constraint is considered, with a scalar coefficient setting the compromise between information and cost. It is shown that for suitable cost functions, by increasing the value of the coefficient one can force the support points of an optimal design measure to concentrate around points of minimum cost. An example of adaptive design in a dose-finding problem with a bivariate binary model is presented, showing the effectiveness of the approach.     

On the construction of optimal experimental designs: a penalty approach

Tn optimal experimental design theory there are well-known situations, in which additional constraints are implied to the design set. These constraints destroy in general the simplex structure of the set of feasible points of the design set. Thus the available iteration procedures for the unrestricted case are no longer applicable.

In this paper a penalty approach is suggested which transforms the restricted problem to the unrestricted case and allows the application of well-known algorithms such as the Fedorov-Wynn-type or the projected gradient procedure.     

Differential evolutionary algorithm in the construction process of optimal experimental designs

This article shows how a differential evolution algorithm can be used to find statistical designs under several optimality criteria as A, D, and T. The general algorithm of differential evolution is described and then applied on constructing optimal designs for several well-known models and compare them with those already available by other algorithms, in terms of relative efficiency. Moreover, the great effect of population size in the running of this algorithm establishes a precedent in the use of differential evolution algorithms over genetic algorithms.     

Constrained optimal designs

The problem combining optimality criteria using constrained optimization techniques is considered. Constraints may be due to some optimality criteria so that the designs satisfying the constraints will have at least the minimal quality that an investigator wishes to maintain. A necessary and sufficient condition similar to Kiefer (Theorem 1, 1974a) is obtained using Fréchet derivatives. Some examples are presented to illustrate some possible applications of the constrained optimality criterion, including Stigler's (1971) C-restricted D-criterion, Lauter's (1976) multiresponse modeling problem and Lee (1987), combination of A- and D-criteria.     

Combined array approach for optimal designs

Robust parameter design, originally proposed by Taguchi ( 1987 ) is an offline production technique for reducing variation and improving product's quality To achieve this objective Taguchi proposed the use of product arrays. However. the product array approach, results in an exorbitant number of runs To overcome the drawbacks of the product array Welch, Wu, Kang and Sacks ( 1990 ), Shoemaker, Tsui and Wu ( 1991 ) and Montgomery ( 1991a ) proposed the use of combined arrays, where the control factors and noise factors are combined in a single array. In this paper we study the concept of combined array for an intermediate class of designs where n = 1 (mod4), n = 2 (mod4) and n = 3 (mod4). The designs presented in this paper, though not orthogonal, offer a great reduction in the run-size.     

First-order optimal designs for non-linear models

This paper presents D-optimal experimental designs for a variety of non-linear models which depend on an arbitrary number of covariates but assume a positive prior mean and a Fisher information matrix satisfying particular properties. It is argued that these optimal designs can be regarded as a first-order approximation of the asymptotic increase of Shannon information. The efficiency of this approximation is compared in some examples, which show how the results can be further used to compute the Bayesian optimal design, when the approximate solution is not accurate enough.     

An optimal allocation for response-adaptive designs

A new allocation proportion is derived by using differential equation methods for response-adaptive designs. This new allocation is compared with the balanced and the Neyman allocations and the optimal allocation proposed by Rosenberger, Stallard, Ivanova, Harper and Ricks (RSIHR) from an ethical point of view and statistical power performance. The new allocation has the ethical advantages of allocating more than 50% of patients to the better treatment. It also allocates higher proportion of patients to the better treatment than the RSIHR optimal allocation for success probabilities larger than 0.5. The statistical power under the proposed allocation is compared with these under the balanced, the Neyman and Rosenberger's optimal allocations through simulation. The simulation results indicate that the statistical power under the proposed allocation proportion is similar as to those under the balanced, the Neyman and the RSIHR allocations.     

Constrained optimal designs for regressiom models

An attempt of combining several optimality criteria simulaneously by using the techniques of nonliear programming is demonstrated. Four constrained D- and G-optimality criteria are introduced, namely, D-restrcted, D_s-restricted, A-restricted and E-restricted D- and G-optimality. The emphasis is particularly on the polynomial regression. Examples for quadratic polynomial regression are investigated to illustrate the applicability of these constrained optimality criteria.     

Constructing optimal projection designs

ABSTRACT

The early stages of many real-life experiments involve a large number of factors among which only a few factors are active. Unfortunately, the optimal full-dimensional designs of those early stages may have bad low-dimensional projections and the experimenters do not know which factors turn out to be important before conducting the experiment. Therefore, designs with good projections are desirable for factor screening. In this regard, significant questions are arising such as whether the optimal full-dimensional designs have good projections onto low dimensions? How experimenters can measure the goodness of a full-dimensional design by focusing on all of its projections?, and are there linkages between the optimality of a full-dimensional design and the optimality of its projections? Through theoretical justifications, this paper tries to provide answers to these interesting questions by investigating the construction of optimal (average) projection designs for screening either nominal or quantitative factors. The main results show that: based on the aberration and orthogonality criteria the full-dimensional design is optimal if and only if it is optimal projection design; the full-dimensional design is optimal via the aberration and orthogonality if and only if it is uniform projection design; there is no guarantee that a uniform full-dimensional design is optimal projection design via any criterion; the projection design is optimal via the aberration, orthogonality and uniformity criteria if it is optimal via any criterion of them; and the saturated orthogonal designs have the same average projection performance.     

Constructing optimal designs for fitting pharmacokinetic models

We consider some computational issues that arise when searching for optimal designs for pharmacokinetic (PK) studies. Special factors that distinguish these are (i) repeated observations are taken from each subject and the observations are usually described by a nonlinear mixed model (NLMM), (ii) design criteria depend on the model fitting procedure, (iii) in addition to providing efficient parameter estimates, the design must also permit model checking, (iv) in practice there are several design constraints, (v) the design criteria are computationally expensive to evaluate and often numerical integration is needed and finally (vi) local optimisation procedures may fail to converge or get trapped at local optima.We review current optimal design algorithms and explore the possibility of using global optimisation procedures. We use these latter procedures to find some optimal designs.For multi-purpose designs we suggest two surrogate design criteria for model checking and illustrate their use.     

A procedure for optimal augmentation of multidimensional designs

The augmentation of an existing multidimensional design is discussed from the point of view of estimability of certain two-factor interactions which are nonestimable from the original design. A general procedure is proposed which achieves this with a minimal number of additional assemblies and which is optimal in a certain sense. The individual steps in this procedure are described in detail and illustrated by an example.     

The construction of optimal histograms

In this note, a stopping rule is derived that gives the optimal histogram bin width to approximate a probability density function, The procedure minimizes the mean integrated square error between the density function and the histogram, and requires no prior knowledge of the density function.     

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.     

The effect of small sample on optimal designs for logistic regression models

Asymptotic methods are commonly used in statistical inference for unknown parameters in binary data models. These methods are based on large sample theory, a condition which may be in conflict with small sample size and hence leads to poor results in the optimal designs theory. In this paper, we apply the second order expansions of the maximum likelihood estimator and derive a matrix formula for the mean square error (MSE) to obtain more precise optimal designs based on the MSE. Numerical results indicate the new optimal designs are more efficient than the optimal designs based on the information matrix.     

Block-circulant matrices for constructing optimal Latin hypercube designs

Computer simulations are usually needed to study a complex physical process. In this paper, we propose new procedures for constructing orthogonal or low-correlation block-circulant Latin hypercube designs. The basic concept of these methods is to use vectors with a constant periodic autocorrelation function to obtain suitable block-circulant Latin hypercube designs. A general procedure for constructing orthogonal Latin hypercube designs with favorable properties and allowing run sizes being different from a power of 2 (or a power of 2 plus 1), is presented here for the first time. In addition, an expansion of the method is given for constructing Latin hypercube designs with low correlation. This expansion is useful when orthogonal Latin hypercube designs do not exist. The properties of the generated designs are further investigated. Some examples of the new designs, as generated by the proposed procedures, are tabulated. In addition, a brief comparison with the designs that appear in the literature is given.