A feasible directions method for computing Bayes E-optimal block designs

DOI10.1016/0167-9473(88)90013-8zbMath0726.62139OpenAlexW2028953757WikidataQ126975613 ScholiaQ126975613MaRDI QIDQ804197

Isabella Verdinelli, Bruno Simeone

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

zbMATH Keywords

convex programmingknapsack problemsBayesian designsE-optimality design criterionTopkis and Veinott's feasible directions algorithmtwo- way analysis of variance model

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Bayesian inference (62F15) Convex programming (90C25) Statistical block designs (62K10) Analysis of variance and covariance (ANOVA) (62J10)

Uses Software

• CONOPT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• General equivalence theory for optimum designs (approximate theory)
• CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
• Bayes D-optimal and E-optimal block designs
• A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
• Optimal design: Variation in structure and performance under change of criterion
• The Optimum Design of a Two-Factor Experiment Using Prior Information
• On the Efficiency of Experimental Designs