A-optimal design measures for one-way layouts with additive regression

For linear models with one discrete factor and additive general regression term the problem of characterizing A-optimal design measures for inference on (i) treatment effects, (ii) the regression parameters and (iii) all parameters will be considered. In any of these problems product designs can be found which are optimal among all designs, and equal weigth 1/J may be given to each of the J levels of the discrete factor. For problem (i) and (ii) the allocation of the continuous factors for the regression term should follow a suitable optimal design for the corresponding pure regression model, whereas for problem (iii) this would not give an A-optimal product design. For this problem an equivalence theorem for A-optimal product designs will be given. An example will illustrate these results. Finally, by analyzing a model with two discrete factors it will be shown that for enlarged models the best product designs may not be A-optimal.     

Optimal designs for estimating the slope of a regression

In the common linear model with quantitative predictors we consider the problem of designing experiments for estimating the slope of the expected response in a regression. We discuss locally optimal designs, where the experimenter is only interested in the slope at a particular point, and standardized minimax optimal designs, which could be used if precise estimation of the slope over a given region is required. General results on the number of support points of locally optimal designs are derived if the regression functions form a Chebyshev system. For polynomial regression and Fourier regression models of arbitrary degree the optimal designs for estimating the slope of the regression are determined explicitly for many cases of practical interest.     

Applications and Implementations of Continuous Robust Designs

In the literature concerning the construction of robust optimal designs, many resulting designs turn out to have densities. In practice, an exact design should tell the experimenter what the support points are and how many subjects should be allocated to each of these points. In particular, we consider a practical situation in which the number of support points allowed is constrained. We discuss an intuitive approach, which motivates a new implementation scheme that minimizes the loss function based on the Kolmogorov and Smirnov distance between an exact design and the optimal design having a density. We present three examples to illustrate the application and implementation of a robust design constructed: one for a nonlinear dose-response experiment and the other two for general linear regression. Additionally, we perform some simulation studies to compare the efficiencies of the exact designs obtained by our optimal implementation with those by other commonly used implementation methods.     

Optimal allocation of time points for the random effects model

In this article the problem of the optimal selection and allocation of time points in repeated measures experiments is considered. D‐ optimal designs for linear regression models with a random intercept and first order auto‐regressive serial correlations are computed numerically and compared with designs having equally spaced time points. When the order of the polynomial is known and the serial correlations are not too small, the comparison shows that for any fixed number of repeated measures, a design with equally spaced time points is almost as efficient as the D‐ optimal design. When, however, there is no prior knowledge about the order of the underlying polynomial, the best choice in terms of efficiency is a D‐ optimal design for the highest possible relevant order of the polynomial. A design with equally‐spaced time points is the second best choice     

Computing A-optimal and E-optimal designs for regression models via semidefinite programming

In semidefinite programming (SDP), we minimize a linear objective function subject to a linear matrix being positive semidefinite. A powerful program, SeDuMi, has been developed in MATLAB to solve SDP problems. In this article, we show in detail how to formulate A-optimal and E-optimal design problems as SDP problems and solve them by SeDuMi. This technique can be used to construct approximate A-optimal and E-optimal designs for all linear and nonlinear regression models with discrete design spaces. In addition, the results on discrete design spaces provide useful guidance for finding optimal designs on any continuous design space, and a convergence result is derived. Moreover, restrictions in the designs can be easily incorporated in the SDP problems and solved by SeDuMi. Several representative examples and one MATLAB program are given.     

Optimal regression designs in the presence of random block effects

A- and D-optimal regression designs under random block-effects models are considered. We first identify certain situations where D- and A-optimal designs do not depend on the intra-block correlation and can be obtained easily from the optimal designs under uncorrelated models. For example, for quadratic regression on [−1,1], this covers D-optimal designs when the block size is a multiple of 3 and A-optimal designs when the block size is a multiple of 4. In general, the optimal designs depend on the intra-block correlation. For quadratic regression, we provide expressions for D-optimal designs for any block size. A-optimal designs with blocks of size 2 for quadratic regression are also obtained. In all the cases considered, robust designs which do not depend on the intrablock correlation can be constructed.     

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.     

Minimax A-, c-, and I-optimal regression designs for models with heteroscedastic errors

It is well known that it is difficult to construct minimax optimal designs. Furthermore, since in practice we never know the true error variance, it is important to allow small deviations and construct robust optimal designs. We investigate a class of minimax optimal regression designs for models with heteroscedastic errors that are robust against possible misspecification of the error variance. Commonly used A-, c-, and I-optimality criteria are included in this class of minimax optimal designs. Several theoretical results are obtained, including a necessary condition and a reflection symmetry for these minimax optimal designs. In this article, we focus mainly on linear models and assume that an approximate error variance function is available. However, we also briefly discuss how the methodology works for nonlinear models. We then propose an effective algorithm to solve challenging nonconvex optimization problems to find minimax designs on discrete design spaces. Examples are given to illustrate minimax optimal designs and their properties.     

Optimal allocation for linear combinations of linear predictors in generalized linear models

The problem of the allocation of experimental units to experimental groups is studied within the context of generalized linear models. Optimal designs for the estimation of linear combinations of linear predictors are characterized, using concepts from the theory of optimal design. If there is only one linear combination of interest, then the D-optimal allocation is equivalent to the well-known Neyman allocation of subsamples in stratified sampling. However, if the number of linear combinations equals the number of design points, or experimental groups, then the equal replication of all design points is D-optimal. For cases in between, there are no easily accessible general solutions to the problem, although some particular cases are solved, including: i estimation of the n- 1 possible comparisons with a control group in an n-point, one-factor design; and ii estimation of 2 one or two of the four natural parameters of a 2 factorial design. The A-optimal allocations are determined in general.     

Some as-optimal designs and their a-efficiencies

For polynomial regression over spherical regions, the d-th order As-optimal designs for γ-th order models are derived for 4 ≥ d > γ≥l. Efficiencies of these designs with respect to the γ-th order A-optimal designs are obtained. Furthermore, the effects of estimating intermediate m-th order models on these efficiencies are examined for d > m > γ     

Minimax designs for estimating slopes in a trigonometric regression model

Abstract

Designs for the first order trigonometric regression model over an interval on the real line are considered for the situation where estimation of the slope of the response surface at various points in the factor space is of primary interest. Minimization of the variance of the estimated slope at a point maximized over all points in the region of interest is taken as the design criterion. Optimal designs under the minimax criterion are derived for the situation where the design region and the region of interest are identical and a symmetric “partial cycle”. Some comparisons of the minimax designs with the traditional D- and A-optimal designs are provided. Efficiencies of some exact designs under the minimax criterion are also investigated.     

Multiplicative algorithms for computing optimum designs

We study a new approach to determine optimal designs, exact or approximate, both for the uncorrelated case and when the responses may be correlated. A simple version of this method is based on transforming design points on a finite interval to proportions of the interval. Methods for determining optimal design weights can therefore be used to determine optimal values of these proportions. We explore the potential of this method in a range of examples encompassing linear and non-linear models, some assuming a correlation structure and some with more than one design variable.     

D-optimal designs for combined polynomial and trigonometric regression on a partial circle

Consider the D-optimal designs for a combined polynomial and trigonometric regression on a partial circle. It is shown that the optimal design is equally supported and the structure of the optimal design depends only on the length of the design interval and the support points are analytic functions of this parameter. Moreover, the Taylor expansion of the optimal support points can be determined efficiently by a recursive procedure. Examples are presented to illustrate the procedures for computing the optimal designs.     

Variance of the difference between two estimated responses

Minimization of the maximum and average variance of the difference between estimated responses are taken as design criteria for univariate polynomial regression models. An optimal design under the first criterion is derived for the second-order model and a class of designs nearly optimal under the second criterion is obtained for the general polynomial models.     

Optimal designs for experiments with mixtures: a survey

This is a survey article on known results about analytic solutions and numerical solutions of optimal designs for various regression models for experiments with mixtures. The regression models include polynomial models, models containing homogeneous functions, models containing inverse terms and ratios, log contrast models, models with quantitative variables, and mod els containing the amount of mixture, Optimality criteria considered include D-, A-, E-,φ_p- and I_λ-Optimalities. Uniform design and uniform optimal design for mixture components, and efficiencies of the {q,2} simplex-controid design are briefly discussed.     

Adaptive grid semidefinite programming for finding optimal designs

We find optimal designs for linear models using a novel algorithm that iteratively combines a semidefinite programming (SDP) approach with adaptive grid techniques. The proposed algorithm is also adapted to find locally optimal designs for nonlinear models. The search space is first discretized, and SDP is applied to find the optimal design based on the initial grid. The points in the next grid set are points that maximize the dispersion function of the SDP-generated optimal design using nonlinear programming. The procedure is repeated until a user-specified stopping rule is reached. The proposed algorithm is broadly applicable, and we demonstrate its flexibility using (i) models with one or more variables and (ii) differentiable design criteria, such as A-, D-optimality, and non-differentiable criterion like E-optimality, including the mathematically more challenging case when the minimum eigenvalue of the information matrix of the optimal design has geometric multiplicity larger than 1. Our algorithm is computationally efficient because it is based on mathematical programming tools and so optimality is assured at each stage; it also exploits the convexity of the problems whenever possible. Using several linear and nonlinear models with one or more factors, we show the proposed algorithm can efficiently find optimal designs.     

A candidate-set-free algorithm for generating D-optimal split-plot designs

Summary.  We introduce a new method for generating optimal split-plot designs. These designs are optimal in the sense that they are efficient for estimating the fixed effects of the statistical model that is appropriate given the split-plot design structure. One advantage of the method is that it does not require the prior specification of a candidate set. This makes the production of split-plot designs computationally feasible in situations where the candidate set is too large to be tractable. The method allows for flexible choice of the sample size and supports inclusion of both continuous and categorical factors. The model can be any linear regression model and may include arbitrary polynomial terms in the continuous factors and interaction terms of any order. We demonstrate the usefulness of this flexibility with a 100-run polypropylene experiment involving 11 factors where we found a design that is substantially more efficient than designs that are produced by using other approaches.     

Bayes A-optimal designs for comparing test treatments with a control

The problem of comparing v test treatments simultaneously with a control treatment when k, v ⩾ 3 is considered. Following the work of Majumdar (1992), we use exact design theory to derive Bayes A-optimal block designs and optimal Г-minimax designs for a more general prior assumption for the one-way elimination of heterogeneity model. Examples of robust optimal designs, highly efficient designs, and the comparisons of the approximate optimal designs that are derived by our methods and by some other existing rounding-off schemes when using Owen's procedure are also provided.     

Equally spaced design points in polynomial regression: A comparison of systematic sampling methods with the optimal design of experiments

In some situations an experimenter may desire to have equally spaced design points. Three methods of obtaining such points on the interval [—1,1]—namely systematic random sampling, centrally located systematic sampling, and a purposive systematic sampling method which includes the endpoints - 1 and 1 as two of the design points-are evaluated under the D-optimal and G-optimal criteria. These methods are also compared to the optimal designs in polynomial regression and to the limiting designs of Kiefer and Studden (1976).     

ALL-BIAS DESIGNS FOR POLYNOMIAL SPLINE REGRESSION MODELS

Polynomial spline regression models of low degree have proved useful in modeling responses from designed experiments in science and engineering when simple polynomial models are inadequate. Where there is uncertainty in the number and location of the knots, or breakpoints, of the spline, then designs that minimize the systematic errors resulting from model misspecification may be appropriate. This paper gives a method for constructing such all‐bias designs for a single variable spline when the distinct knots in the assumed and true models come from some specified set. A class of designs is defined in terms of the inter‐knot intervals and sufficient conditions are obtained for a design within this class to be all‐bias under linear, quadratic and cubic spline models. An example of the construction of all‐bias designs is given.