E-optimal designs for polynomial regression
The authors prove a conjecture of \textit{F. Preitschopf} [``Bestimmung optimaler Versuchspläne in der polynomialen Regression. (1989; Zbl 0719.62087)] that \(E\)-optimal designs for polynomial regression with constant variance in the interval \([-1,1]\) are supported by Chebyshev points. The proof uses a certain duality between \(E\)-optimality and \(c\)- optimality and the experience that the Chebyshev polynomial \(\sum^ d_{i=0}a_ ix^ i=a'f(x)\) plays an essential role for \(c\)- optimality. The main result is that a \(c\)-optimal design w.r.t. \(c=KK'a\) is also \(E\)- optimal w.r.t. the parameter subsystem \(K'\Theta\). This design is supported by the Chebyshev points \(s_ i=\cos((d-i)\pi/d)\); \(i=0,1,\dots,d\); with weights \(w_ i=w_{d-i}=(-1)^{d-i}u_ i/\| K'a\|\) where the \(u_ i\) are determined from \(\sum^ d_{i=0}u_ if(s_ i)=KK'a\).
- \(E\)-optimal designs for polynomial regression without intercept
- E-optimal designs for polynomial spline regression
- Totally nonnegative moment matrices
- Optimal designs with respect to Elfving's partial minimax criterion in polynomial regression
- A note on the uniform distribution on the arcsin points
- Non-Chebyshev E-optimal experimental designs and decompositions of positive polynomial. I
- On the duality of the optimal design problem by the E-criterion
- On asymptotic distribution of optimal design for polynomial-type regression
- Optimal designs for estimating individual coefficients in Fourier regression models
- Optimal designs for a growth curve model
- Removal of the points that do not support an E-optimal experimental design
- Elfving's theorem revisited
- Optimal designs for a class of nonlinear regression models
- Computing \(E\)-optimal polynomial regression designs.
- \(E\)-optimal designs for rational models
- Robust designs for polynomial regression by maximizing a minimum of D- and D₁-efficiencies
- Algorithms for optimal design with application to multiple polynomial regression
- An optimum design for estimating the first derivative
- Computing maximin efficient experimental designs using the methods of semidefinite programming
- Dual optimal design and the Christoffel-Darboux polynomial
- Using SeDuMi to find various optimal designs for regression models
- Some explicit solutions of \(c\)-optimal design problems for polynomial regression with no intercept
- Optimal design of experiments with anticipated pattern of missing observations
- Constructing \(c\)-optimal designs for polynomial regression without an intercept
- Optimal discrimination designs
- Optimal approximate designs for comparison with control in dose-escalation studies
- Interpolation and extrapolation optimal designs 1. Polynomial regression and approximation theory
- Adaptive A-optimal experimental design for linear dynamical systems
- Equally spaced design points in polynomial regression: A comparison of systematic sampling methods with the optimal design of experiments
- E‐optimal designs for regression models with quantitative factors— a reasonable choice?
- scientific article; zbMATH DE number 1532006 (Why is no real title available?)
- \(E\)-optimal designs for second-order response surface models
- Optimal experiment design for regression polynomial models identification
- E- and R-optimality of block designs for treatment-control comparisons
- DE- and EDP\(_M\)-compound optimality for the information and probability-based criteria
- Concentration sets, elfving sets and norms in optimum design
- Optimal characteristic designs for polynomial models
- ComputingA-optimal Designs for Weighted Polynomial Regression by Taylor Expansion
- Convex optimal designs for compound polynomial extrapolation
- Near G-optimal Tchakaloff designs
This page was built for publication: \(E\)-optimal designs for polynomial regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366747)
