An algorithm for optimal designs on a design space
- 1 January 1978
- journal article
- research article
- Published by Taylor & Francis in Communications in Statistics - Theory and Methods
- Vol. 7 (14) , 1379-1389
- https://doi.org/10.1080/03610927808827719
Abstract
Two variations of a simple monotunic algorithm for computing optimal designs on a finite design space are presented. Various properties are listed. Comparisons witn other algorithms are made.Keywords
This publication has 6 references indexed in Scilit:
- Convergent Design Sequences, for Sufficiently Regular Optimality CriteriaThe Annals of Statistics, 1976
- The Analysis of Contingency Tables with Incompletely Classified DataBiometrics, 1976
- Some General Points in the Theory of Optimal Experimental DesignJournal of the Royal Statistical Society Series B: Statistical Methodology, 1973
- The Sequential Generation of $D$-Optimum Experimental DesignsThe Annals of Mathematical Statistics, 1970
- An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecologyBulletin of the American Mathematical Society, 1967
- INEQUALITIES FOR MOMENTS OF FREQUENCY FUNCTIONS AND FOR VARIOUS STATISTICAL CONSTANTSBiometrika, 1929