Admissible and optimal exact designs for polynomial regression (Q1821462)

From MaRDI portal
Revision as of 19:48, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Admissible and optimal exact designs for polynomial regression
scientific article

    Statements

    Admissible and optimal exact designs for polynomial regression (English)
    0 references
    0 references
    0 references
    0 references
    1987
    0 references
    The authors' interest is to address some classical optimal design questions in the context of the exact design setting for the polynomial regression model. Let \(x_ 0,...,x_ l\) denote the distinct levels at which \(n_ 0,...,n_ l\) observations are to be taken. Here \(n_ 0+...+n_ l=N\). An exact design \(\xi^ N\) is a probability measure on [a,b] which concentrates mass \(n_ i/N\) at each \(x_ i\). Let \(M(\xi^ N)\) denote the information matrix (per observation) of an exact design \(\xi^ N\). An exact design \(\xi^ N\) is said to be admissible if and only if there exists no other exact design \({\tilde \xi}^ N\) such that \(M(\xi^ N)\neq M({\tilde \xi}^ N)\) and \(M(\xi^ N)\leq M({\tilde \xi}^ N)\). Solution of this problem will enable us to restrict our search for an optimal design to the class of admissible designs. A necessary condition for an exact design to be admissible is provided. It is conjectured that this condition is also sufficient and the basis for the conjecture is discussed. It is shown that the Salaevskij's conjecture holds for cubic regression. The interesting forms of G-optimal exact designs are indicated.
    0 references
    exact design
    0 references
    polynomial regression
    0 references
    admissible designs
    0 references
    Salaevskij's conjecture
    0 references
    G-optimal exact designs
    0 references

    Identifiers