On d-optimal designs for binary data

We use the criterion of D-optimality of the Fisher information matrix to derive optimal vectors for binary data. Some concepts of totally positive functions and Polya functions of order II are used to derive properties of the determinant of the Fisher information matrix arising in quantal response bioassay and attribute life testing models. As is often the case in non-linear models the D-optimal vectors are functions of the unknown parameters. By using the criterion of D-optimality, general optimal vectors are characterized which could be used for constructing Bayesian or locally D-optimal designs.     

Modified D-optimal design for logistic model

Asymptotic theory of using the Fisher information matrix may provide poor approximation to the exact variance matrix of maximum likelihood estimation in nonlinear models. This may be due to not obtaining an efficient D-optimal design. In this article, we propose a modified D-optimality criterion, using a more accurate information matrix, based on the Bhattacharyya matrix. The proposed information matrix and its properties are given for two parameters simple logistic model. It is shown that the resulted modified locally D-optimal design is more efficient than the previous one; particularly, for small sample size experiments.     

Spatial sampling design for parameter estimation of the covariance function

We study the spatial optimal sampling design for covariance parameter estimation. The spatial process is modeled as a Gaussian random field and maximum likelihood (ML) is used to estimate the covariance parameters. We use the log determinant of the inverse Fisher information matrix as the design criterion and run simulations to investigate the relationship between the inverse Fisher information matrix and the covariance matrix of the ML estimates. A simulated annealing algorithm is developed to search for an optimal design among all possible designs on a fine grid. Since the design criterion depends on the unknown parameters, we define relative efficiency of a design and consider minimax and Bayesian criteria to find designs that are robust for a range of parameter values. Simulation results are presented for the Matérn class of covariance functions.     

Universal optimality of experimental designs: Definitions and a criterion

Several definitions of universal optimality of experimental designs are found in the Literature; we discuss the interrelations of these definitions using a recent characterization due to Friedland of convex functions of matrices. An easily checked criterion is given for a design to satisfy the main definition of universal optimality; this criterion says that a certain set of linear functions of the eigenvalues of the information matrix is maximized by the information matrix of a design if and only if that design is universally optimal. Examples are given; in particular we show that any universally optimal design is (M, S)-optimal in the sense of K. Shah.     

Optimal progressive interval censoring plan under accelerated life test with limited budget

In this paper, we investigate some inference and design problems related to multiple constant-stress accelerated life test with progressive type-I interval censoring. A Weibull lifetime distribution at each stress-level combination is considered. The scale parameter of Weibull distribution is assumed to be a log-linear function of stresses. We obtain the estimates of the unknown parameters through the method of maximum likelihood, and also derive the Fisher's information matrix. The optimal number of test units, number of inspections, and length of the inspection interval are determined under D-optimality, T-optimality, and E-optimality criteria with cost constraint. An algorithm based on nonlinear mixed-integer programming is proposed to the optimal solution. The sensitivity of the optimal solution to changes in the values of the different parameters is studied.     

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.     

A Compromise Experimental Design Method for Parametric Polynomial Response Surface Approximations

This study presents a compromise approach to augmentation of experimental designs, necessitated by the expense of performing each experiment (computational or physical), that yields higher quality parametric polynomial response surface approximations than traditional augmentation. Based on the D-optimality criterion as a measure of experimental design quality, the method simultaneously considers several polynomial models during the experimental design, resulting in good quality designs for all models under consideration, as opposed to good quality designs only for lower-order models, as in the case of traditional augmentation. Several numerical examples and an engineering example are presented to illustrate the efficacy of the approach.     

Recent developments in D-optimal designs

In the paper, some issues concerned with the determining spring balance weighing designs satisfying the criterion of D-optimality under the assumption measurement errors are uncorrelated and they have the same variances are discussed. In addition, highly D-efficient spring balance weighing designs are also considered. Some conditions under which any spring balance weighing design is regular D-optimal or highly D-efficient are proved. What is more, new construction methods of regular D-optimal and highly D-efficient spring balance weighing designs are presented.     

The Bayesian D-optimal design for simple beta regression model in two cases (both known and unknown nuisance parameter)

According to investigated topic in the context of optimal designs, various methods can be used to obtain optimal design, of which Bayesian method is one. In this paper, considering the model and the features of the information matrix, this method (Bayesian optimality criterion) has been used for obtaining optimal designs which due to the variation range of the model parameters, prior distributions such as Uniform, Normal and Exponential have been used and the results analysed.     

Construction of optimal designs in random coefficient regression models

We consider the problem of optimal experimental design in random coefficient regression models with respect to a quadratic loss function. By application of WHITTLE'S general equivalence theorem we obtain the structure of optimal designs. An alogrithm is given which allows, under certain assumptions, the construction of the information matrix of an optimal design. Moreover, we give conditions on the equivalence of optimal designs with respect to optimality criteria which are analogous to usual A-D- and _E/-optimality.     

Optimality and Contrasts in Block Designs with Unequal Treatment Replication

The computer construction of optimal or near‐optimal experimental designs is common in practice. Search procedures are often based on the non‐zero eigenvalues of the information matrix of the design. Minimising the average of the pairwise treatment variances can also be used as a search criterion. For equal treatment replication these approaches are equivalent to maximising the harmonic mean of the design's canonical efficiency factors, but differ when treatments are unequally replicated. This paper investigates the extent of these differences and discusses some apparent inconsistencies previously observed when comparing the optimality of equally and unequally replicated designs.     

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.     

Optimal Latin hypercube designs for the Kullback–Leibler criterion

Space-filling designs are commonly used for selecting the input values of time-consuming computer codes. Computer experiment context implies two constraints on the design. First, the design points should be evenly spread throughout the experimental region. A space-filling criterion (for instance, the maximin distance) is used to build optimal designs. Second, the design should avoid replication when projecting the points onto a subset of input variables (non-collapsing). The Latin hypercube structure is often enforced to ensure good projective properties. In this paper, a space-filling criterion based on the Kullback–Leibler information is used to build a new class of Latin hypercube designs. The new designs are compared with several traditional optimal Latin hypercube designs and appear to perform well.     

Nearly optimal truncated group sequential test on binomial proportions

In this article, we systematically study the optimal truncated group sequential test on binomial proportions. Through analysis of the cost structure, average test cost is introduced as a new optimality criterion. According to the new criterion, the optimal tests on different design parameters including the boundaries, success discriminant value, stage sample vector, stage size, and the maximum sample size are defined. Since the computation time in finding optimal designs by exhaustive search is intolerably long, group sequential sample space sorting method and procedures are developed to find the near-optimal ones. In comparison with the international standard ISO2859-1, the truncated group sequential designs proposed in this article can reduce the average test costs around 20%.     

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.     

Bayesian two-stage optimal design for mixture models

In this paper, a Bayesian two-stage D–D optimal design for mixture experimental models under model uncertainty is developed. A Bayesian D-optimality criterion is used in the first stage to minimize the determinant of the posterior variances of the parameters. The second stage design is then generated according to an optimalityprocedure that collaborates with the improved model from the first stage data. The results show that a Bayesian two-stage D–D-optimal design for mixture experiments under model uncertainty is more efficient than both the Bayesian one-stage D-optimal design and the non-Bayesian one-stage D-optimal design in most situations. Furthermore, simulations are used to obtain a reasonable ratio of the sample sizes between the two stages.     

An optimal response adaptive biased coin design with k heteroscedastic treatments

For comparing treatments in clinical trials, Atkinson (1982) introduced optimal biased coins for balancing patients across treatment assignments by using D-optimality under the assumption of homoscedastic responses of different treatments. However, this assumption can be violated in many real applications. In this paper, we relax the homoscedasticity assumption in the k treatments setting with k>2. A general family of optimal response adaptive biased coin designs are proposed following Atkinson's procedure. Asymptotic properties of the proposed designs are obtained. Some advantages of the proposed design are discussed.     

Designs for two-colour microarray experiments

Summary.  Designs for two-colour microarray experiments can be viewed as block designs with two treatments per block. Explicit formulae for the A- and D-criteria are given for the case that the number of blocks is equal to the number of treatments. These show that the A- and D-optimality criteria conflict badly if there are 10 or more treatments. A similar analysis shows that designs with one or two extra blocks perform very much better, but again there is a conflict between the two optimality criteria for moderately large numbers of treatments. It is shown that this problem can be avoided by slightly increasing the number of blocks. The two colours that are used in each block effectively turn the block design into a row–column design. There is no need to use a design in which every treatment has each colour equally often: rather, an efficient row–column design should be used. For odd replication, it is recommended that the row–column design should be based on a bipartite graph, and it is proved that the optimal such design corresponds to an optimal block design for half the number of treatments. Efficient row–column designs are given for replications 3–6. It is shown how to adapt them for experiments in which some treatments have replication only 2.     

D-optimal minimax design criterion for two-level fractional factorial designs

A D-optimal minimax design criterion is proposed to construct two-level fractional factorial designs, which can be used to estimate a linear model with main effects and some specified interactions. D-optimal minimax designs are robust against model misspecification and have small biases if the linear model contains more interaction terms. When the D-optimal minimax criterion is compared with the D-optimal design criterion, we find that the D-optimal design criterion is quite robust against model misspecification. Lower and upper bounds derived for the loss functions of optimal designs can be used to estimate the efficiencies of any design and evaluate the effectiveness of a search algorithm. Four algorithms to search for optimal designs for any run size are discussed and compared through several examples. An annealing algorithm and a sequential algorithm are particularly effective to search for optimal designs.     

Asymptotic Comparison Between Constant-stress Testing and Step-stress Testing for Type-I Censored Data from Exponential Distribution

By running the life tests at higher stress levels than normal operating conditions, accelerated life testing quickly yields information on the lifetime distribution of a test unit. The lifetime at the design stress is then estimated through extrapolation using a regression model. In constant-stress testing, a unit is tested at a fixed stress level until failure or the termination time point of the test, while step-stress testing allows the experimenter to gradually increase the stress levels at some pre-fixed time points during the test. In this article, the optimal k-level constant-stress and step-stress accelerated life tests are compared for the exponential failure data under Type-I censoring. The objective is to quantify the advantage of using the step-stress testing relative to the constant-stress one. A log-linear relationship between the mean lifetime parameter and stress level is assumed and the cumulative exposure model holds for the effect of changing stress in step-stress testing. The optimal design point is then determined under C-optimality, D-optimality, and A-optimality criteria. The efficiency of step-stress testing compared to constant-stress testing is discussed in terms of the ratio of optimal objective functions based on the information matrix.