<Emphasis Type="Italic">D</Emphasis>-optimal designs for polynomial regression with exponential weight function

Weighted polynomial regression with exponential weight function on an interval is considered. The D-optimal designs are completely characterized via three differential equations. Some invariant properties of the optimal designs under affine transformation are derived. The optimal design as degree of polynomial goes to infinity, is shown to converge weakly to the arcsin distribution. Comparisons of the optimal designs with the arcsin distribution are also made.     

On Minimally-supported <Emphasis Type="Italic">D</Emphasis>-optimal Designs for Polynomial Regression with Log-concave Weight Function

This paper studies minimally-supported D-optimal designs for polynomial regression model with logarithmically concave (log-concave) weight functions. Many commonly used weight functions in the design literature are log-concave. For example, and exp(−x ²) in Theorem 2.3.2 of Fedorov (Theory of optimal experiments, 1972) are all log-concave. We show that the determinant of information matrix of minimally-supported design is a log-concave function of ordered support points and the D-optimal design is unique. Therefore, the numerically D-optimal designs can be constructed efficiently by cyclic exchange algorithm.     

On exact D-optimal designs with 2 two-level factors and n autocorrelated observations

In this paper we consider the exact D-optimal designs for estimation of the unknown parameters in the two factors, each at only two-level, main effects model with autocorrelated errors. The vector of the n random errors in the observed responses is assumed to follow a first-order autoregressive model (AR(1)). The exact D-optimal designs seek the optimal combinations of the design levels as well as the optimal run orders, so that the determinant of the information matrix of BLUEs for the unknown parameters is maximized. Bora-Senta and Moyssiadis (1999) gave some conjectures about the exact D-optimal designs based on their experience of several exhaustive searches. In this paper their conjectures are partially proved to be true.Received: January 2003 / Accepted: October 2003Partially supported by the National Science Council of Taiwan, R.O.C. under grant NSC 91-2115-M-008-013.Supported in part by the National Science Council of Taiwan, R.O.C. under grant NSC 89-2118-M-110-003.     

One-step ahead adaptive D-optimal design on a finite design space is asymptotically optimal

We study the consistency of parameter estimators in adaptive designs generated by a one-step ahead D-optimal algorithm. We show that when the design space is finite, under mild conditions the least-squares estimator in a nonlinear regression model is strongly consistent and the information matrix evaluated at the current estimated value of the parameters strongly converges to the D-optimal matrix for the unknown true value of the parameters. A similar property is shown to hold for maximum-likelihood estimation in Bernoulli trials (dose–response experiments). Some examples are presented.     

$${\phi_p}$$-optimal designs for a linear log contrast model for experiments with mixtures

A mixture experiment is an experiment in which the k ingredients are nonnegative and subject to the simplex restriction on the (k − 1)-dimensional probability simplex S ^k-1. In this work, an essentially complete class of designs under the Kiefer ordering for a linear log contrast model with a mixture experiment is presented. Based on the completeness result, -optimal designs for all p,−∞ ≤ p ≤ 1 including D- and A-optimal are obtained, where the eigenvalues of the design moment matrix are used. By using the approach presented here, we gain insight on how these -optimal designs behave. Mong-Na Lo Huang was supported in part by the National Science Council of Taiwan, ROC under grant NSC 93-2118-M-110-001.     

R-optimal designs for multi-factor models with heteroscedastic errors

In this paper, we consider the R-optimal design problem for multi-factor regression models with heteroscedastic errors. It is shown that a R-optimal design for the heteroscedastic Kronecker product model is given by the product of the R-optimal designs for the marginal one-factor models. However, R-optimal designs for the additive models can be constructed from R-optimal designs for the one-factor models only if sufficient conditions are satisfied. Several examples are presented to illustrate and check optimal designs based on R-optimality criterion.     

Optimal variance- and efficiency-balanced designs for one- and two-way elimination of heterogeneity

Summary In this paper, a series ofE-optimal non-binary variance balanced (block or row-column) designs and a series ofE-optimal non-binary efficiency balanced (block or row-column) designs are provided in certain broad classes of competing designs. Furthermore, their high efficiencies by the usualA- andD-optimality criteria are shown.     

Designs for estimating an extremal point of quadratic regression models in a hyperball

This paper is devoted to studying optimal designs for estimating an extremal point of a multivariate quadratic regression model in the unit hyperball. The problem of estimating an extremal point is reduced to that of estimating certain parameters of a corresponding nonlinear (in parameters) regression model. For this reduced problem truncated locally D-optimal designs are found in an explicit form. The result is a generalization of the results of Fedorov and Müller (1997) for onedimensional quadratic regression function in the unit segment. Received February 2002     

Efficient discriminating design for a class of nested polynomial regression models

This paper studies efficient designs for simultaneous model discrimination among polynomial regression models up to degree k. Based on the -optimality criterion proposed by Dette (Ann Stat 22:890–903, 1994), a maximin -optimal discriminating design is derived in terms of canonical moments for . Theoretical and numerical results show that the proposed design performs well for model discrimination in most of the considered models.     

On theE-optimality of certain asymmetrical designs under mixed effects model

TheE-optimality of the following designs within the class of all proper and connected designs with givenb, k andv under mixed effects model are established.

1. A group divisible design with λ₂ = λ₁ + 1.
2. A group divisible design with λ₁ = λ₂ + 1 and group size 2.
3. A linked block design.
4. The dual of design (i)
5. The dual of design (ii).

All these designs are known to satisfy the same optimality property under fixed effects model whenk<v, while the design (i) is known to beE-optimal even whenk>v. From the results proved here, theE-optimality of designs (ii, (iii), (iv) and (v) under fixed effects model in the situation whenk >v also follows.     

A relationship between efficiencies of marginal designs and the product design

We derive theD- andG-efficiencies of product designs in a multifactor experiment in terms of theD- andG-efficiencies of the designs in the marginal models. Work supported by grants Ku 719/2 and 477/645/96 of the Deutsche Forschungsgemeinschaft     

A new interpretation of optimality forE-optimal designs in linear regression models

The optimal design problem for the estimation of several linear combinationsc′ _l ϑ (l=1, …,m) is considered in the usual linear regression modely=f′(x)ϑ (f(x) ∈ ℝ ^k ,ϑ ∈ ℝ ^k ). An optimal design minimizes a (weighted)p-norm of the variances of the least squares estimates for the different linear combinationsc′ _l ϑ. A generalized Elfving theorem is used to derive the relation of the new optimality criterion to theE-optimal design problem. It is shown that theE-optimal design for the parameterϑ minimizes such a (weighted)p-norm whenever the vectorc=(c′ ₁, …, c′_k)′ is an inball vector of a symmetric convex and compact “Elfving set” in.     

Exact D-optimal designs for first-order trigonometric regression models on a partial circle

Recently, various approximate design problems for low-degree trigonometric regression models on a partial circle have been solved. In this paper we consider approximate and exact optimal design problems for first-order trigonometric regression models without intercept on a partial circle. We investigate the intricate geometry of the non-convex exact trigonometric moment set and provide characterizations of its boundary. Building on these results we obtain a solution of the exact $D$ -optimal design problem. It is shown that the structure of the optimal designs depends on both the length of the design interval and the number of observations.     

Criterion-robust optimal product designs for discrimination between nested response surface models

Consider the problem of discriminating between two rival response surface models and estimating parameters in the identified model. To construct designs serving for both model discrimination and parameter estimation, the M _γ-optimality criterion, which puts weight γ (0≤γ≤1) for model discrimination and 1 − γ for parameter estimation, is adopted. The corresponding M _γ-optimal product design is explicitly derived in terms of canonical moments. With the application of the maximin principle on the M _γ-efficiency of any M _γ'-optimal product design, a criterion-robust optimal product design is proposed.     

On the construction of <Emphasis Type="Italic">E</Emphasis>(<Emphasis Type="Italic">s</Emphasis><Superscript>2</Superscript>)-optimal supersaturated designs

Supersaturated designs are an important class of factorial designs in which the number of factors is larger than the number of runs. These designs supply an economical method to perform and analyze industrial experiments. In this paper, we consider generalized Legendre pairs and their corresponding matrices to construct E(s ²)-optimal two-level supersaturated designs suitable for screening experiments. Also, we provide some general theorems which supply several infinite families of E(s ²)-optimal two-level supersaturated designs of various sizes.      

Two ge neral classes of search designs for factor screening experiments with factors at three levels

In this paper, we are presenting general classes of factor screening designs for identifying a few important factors from a list of m (≥ 3) factors each at three levels. A design is a subset of 3^m possible runs. The problem of finding designs with small number of runs is considered here. A main effect plan requires at least (2m + 1) runs for estimating the general mean, linear and quadratic effects of m factors. An orthogonal main effect plan requires, in addition, the number of runs as a multiple of 9. For example, when m=5, a main effect plan requires at least 11 runs and an orthogonal main effect plan requires 18 runs. Two general factor screening designs presented here are nonorthogonal designs with (2m− 1) runs. These designs, called search designs permit us to search for and identify at most two important factors out of m factors under the search linear model introduced in Srivastava (1975). For example, when m=5, the two new plans given in this paper have 9 runs, which is a significant improvement over an orthogonal main effect plan with 18 runs in terms of the number of runs and an improvement over a main effect plan with at least 11 runs. We compare these designs, for 4≤m≤ 10, using arithmetic and geometric means of the determinants, traces, and maximum characteristic roots of certain matrices. Two designs D1 and D2 are identical for m=3 and this design is an optimal design in the class of all search designs under the six criteria discussed above. Designs D1 and D2 are also identical for m=4 under some row and column permutations. Consequently, D1 and D2 are equally good for searching and identifying one important factor out of m factors when m=4. The design D1 is marginally better than the design D2 for searching and identifying one important factor out of m factors when m=5, … , 10. The design D1 is marginally better than the D2 for searching and identifying two important factors out of m factors when m=5, 7, 9. The design D2 is somewhat better than the design D1 for m=6, 8. For m=10, D1 is marginally better than D2 w.r.t. the geometric mean and D2 is marginally better than D1 w.r.t. the arithmetic mean of the maximum characteristic roots.     

SomeE andMV-optimal row-column designs having equal numbers of rows and columns

In this paper we consider experimental situations in whichv treatments are to be tested using a row-column design consisting ofb columns andb rows and wherev does not divideb ². Some sufficient conditions are obtained for a design to beE orMV-optimal in such an experimental setting and methods for constructing row-column designs satisfying the sufficient conditions obtained are also given. This research was supported by NSF Grant No. DMS-8401943.     

A general construction of E(s 2)-optimal large supersaturated designs

A general method for construction of E(s ²)-optimal, two-level supersaturated designs (SSDs) with the equal occurrence property, from supplementary difference sets is introduced. It is proved that SSDs constructed in this way are E(s ²)-optimal. Comparisons are made with previous works and it is shown that the proposed method gives promising results for the construction of E(s ²)-optimal large SSDs.     

On someE-optimal block designs

Summary TheE-optimality of block designs is the concern of this paper. Bounds for the smallest positive eigenvalue of theC-matrix of block designs are obtained in some general classes of connected designs with equal or unequal block sizes. Use of these bounds is made to obtainE-optimal block designs in various classes.     

Totally positive regression: E-optimal designs

E-optimality of approximate designs in linear regression models is paired with a dual problem of nonlinear Chebyshev approximation. When the regression functions form a totally positive system, then the information matrices of designs for subparameters turn out to be “almost” totally positive, a property which allows to solve the nonlinear Chebyshev problem. Thereby we obtain explicit formulae for E-optimal designs in terms of equi-oscillating generalized polynomials. The considerations unify and generalize known results on E-optimality for particular regression setups.