Asymptotically D-optimal design of mixture experiment with complex constraints

DOI10.3969/J.ISSN.1001-4268.2017.02.007zbMATH Open1389.62123MaRDI QIDQ3131129FDOQ3131129

Authors: Guanghui Li, Chongqi Zhang 

Publication date: 29 January 2018

Recommendations

• Random search algorithm for optimal mixture experimental design
• Construction of uniform designs for mixture experiments with complex constraints
• Optimal designs for mixture models with amount constraints
• scientific article; zbMATH DE number 7588258
• Efficient algorithms for constructing \(D\)- and \(I\)-optimal exact designs for linear and non-linear models in mixture experiments

zbMATH Keywords

information matrixMonte Carlo methodD-criterion

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Optimal statistical designs (62K05)

Cited In (5)

• Title not available (Why is that?)
• Mixture experiments with process variables: d-optimal orthogonal experimental designs
• Graphical method in testing the optimality of symmetrical mixture design
• Random search algorithm for optimal mixture experimental design
• A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments

This page was built for publication: Asymptotically D-optimal design of mixture experiment with complex constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3131129)