A feasible directions method for computing Bayes E-optimal block designs
DOI10.1016/0167-9473(88)90013-8zbMATH Open0726.62139OpenAlexW2028953757WikidataQ126975613 ScholiaQ126975613MaRDI QIDQ804197FDOQ804197
Authors: Bruno Simeone, Isabella Verdinelli
Publication date: 1988
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-9473(88)90013-8
Recommendations
convex programmingknapsack problemsBayesian designsE-optimality design criterionTopkis and Veinott's feasible directions algorithmtwo- way analysis of variance model
Bayesian inference (62F15) Convex programming (90C25) Analysis of variance and covariance (ANOVA) (62J10) Optimal statistical designs (62K05) Statistical block designs (62K10)
Cites Work
- General equivalence theory for optimum designs (approximate theory)
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
- The Optimum Design of a Two-Factor Experiment Using Prior Information
- Title not available (Why is that?)
- Optimal design: Variation in structure and performance under change of criterion
- On the Efficiency of Experimental Designs
- Bayes D-optimal and E-optimal block designs
Cited In (2)
Uses Software
This page was built for publication: A feasible directions method for computing Bayes E-optimal block designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804197)