Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments
Author
Abstract
Suggested Citation
DOI: 10.1007/s00184-016-0599-3
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Yu, Yaming, 2010. "Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs," Computational Statistics & Data Analysis, Elsevier, vol. 54(6), pages 1419-1425, June.
- Harman, Radoslav & Filová, Lenka, 2014. "Computing efficient exact designs of experiments using integer quadratic programming," Computational Statistics & Data Analysis, Elsevier, vol. 71(C), pages 1159-1167.
- Harman, Radoslav & Pronzato, Luc, 2007. "Improvements on removing nonoptimal support points in D-optimum design algorithms," Statistics & Probability Letters, Elsevier, vol. 77(1), pages 90-94, January.
- Min Yang & Stefanie Biedermann & Elina Tang, 2013. "On Optimal Designs for Nonlinear Models: A General and Efficient Algorithm," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 108(504), pages 1411-1420, December.
- Torsney, B. & Mandal, S., 2006. "Two classes of multiplicative algorithms for constructing optimizing distributions," Computational Statistics & Data Analysis, Elsevier, vol. 51(3), pages 1591-1601, December.
- Dette, Holger & Pepelyshev, Andrey & Zhigljavsky, Anatoly, 2008. "Improving updating rules in multiplicative algorithms for computing D-optimal designs," Computational Statistics & Data Analysis, Elsevier, vol. 53(2), pages 312-320, December.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Duarte, Belmiro P.M. & Atkinson, Anthony C. & Granjo, Jose F.O & Oliveira, Nuno M.C, 2019. "Optimal design of experiments for liquid–liquid equilibria characterization via semidefinite programming," LSE Research Online Documents on Economics 102500, London School of Economics and Political Science, LSE Library.
- Duarte, Belmiro P.M. & Atkinson, Anthony C. & Granjo, Jose F.O & Oliveira, Nuno M.C, 2022. "Optimal design of experiments for implicit models," LSE Research Online Documents on Economics 107584, London School of Economics and Political Science, LSE Library.
- Belmiro P. M. Duarte, 2023. "Exact Optimal Designs of Experiments for Factorial Models via Mixed-Integer Semidefinite Programming," Mathematics, MDPI, vol. 11(4), pages 1-17, February.
- Yu, Yaming, 2010. "Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs," Computational Statistics & Data Analysis, Elsevier, vol. 54(6), pages 1419-1425, June.
- Pronzato, Luc, 2013. "A delimitation of the support of optimal designs for Kiefer’s ϕp-class of criteria," Statistics & Probability Letters, Elsevier, vol. 83(12), pages 2721-2728.
- Sahu, Nitesh & Babu, Prabhu, 2021. "A new monotonic algorithm for the E-optimal experiment design problem," Statistics & Probability Letters, Elsevier, vol. 174(C).
- Lianyan Fu & Faming Ma & Zhuoxi Yu & Zhichuan Zhu, 2023. "Multiplication Algorithms for Approximate Optimal Distributions with Cost Constraints," Mathematics, MDPI, vol. 11(8), pages 1-14, April.
- Rosa, Samuel & Harman, Radoslav, 2022. "Computing minimum-volume enclosing ellipsoids for large datasets," Computational Statistics & Data Analysis, Elsevier, vol. 171(C).
- Lenka Filová & Radoslav Harman, 2020. "Ascent with quadratic assistance for the construction of exact experimental designs," Computational Statistics, Springer, vol. 35(2), pages 775-801, June.
- Lucy L. Gao & Julie Zhou, 2017. "D-optimal designs based on the second-order least squares estimator," Statistical Papers, Springer, vol. 58(1), pages 77-94, March.
- Tim Holland-Letz & Holger Dette & Didier Renard, 2012. "Efficient Algorithms for Optimal Designs with Correlated Observations in Pharmacokinetics and Dose-Finding Studies," Biometrics, The International Biometric Society, vol. 68(1), pages 138-145, March.
- Yu, Jun & Meng, Xiran & Wang, Yaping, 2023. "Optimal designs for semi-parametric dose-response models under random contamination," Computational Statistics & Data Analysis, Elsevier, vol. 178(C).
- Monica Dessole & Fabio Marcuzzi & Marco Vianello, 2020. "dCATCH—A Numerical Package for d-Variate near G-Optimal Tchakaloff Regression via Fast NNLS," Mathematics, MDPI, vol. 8(7), pages 1-15, July.
- Harman, Radoslav & Rosa, Samuel, 2019. "Removal of the points that do not support an E-optimal experimental design," Statistics & Probability Letters, Elsevier, vol. 147(C), pages 83-89.
- Selin Ahipaşaoğlu, 2015. "Fast algorithms for the minimum volume estimator," Journal of Global Optimization, Springer, vol. 62(2), pages 351-370, June.
- Len Bos & Federico Piazzon & Marco Vianello, 2020. "Near G-optimal Tchakaloff designs," Computational Statistics, Springer, vol. 35(2), pages 803-819, June.
- Dette, Holger & Pepelyshev, Andrey & Zhigljavsky, Anatoly, 2007. "Improving updating rules in multiplicativealgorithms for computing D-optimal designs," Technical Reports 2007,28, Technische Universität Dortmund, Sonderforschungsbereich 475: Komplexitätsreduktion in multivariaten Datenstrukturen.
- Tommasi, C. & López-Fidalgo, J., 2010. "Bayesian optimum designs for discriminating between models with any distribution," Computational Statistics & Data Analysis, Elsevier, vol. 54(1), pages 143-150, January.
- Dette, Holger & Pepelyshev, Andrey & Zhigljavsky, Anatoly, 2014. "‘Nearly’ universally optimal designs for models with correlated observations," Computational Statistics & Data Analysis, Elsevier, vol. 71(C), pages 1103-1112.
- Belmiro P. M. Duarte & Weng Kee Wong, 2015. "Finding Bayesian Optimal Designs for Nonlinear Models: A Semidefinite Programming-Based Approach," International Statistical Review, International Statistical Institute, vol. 83(2), pages 239-262, August.
More about this item
Keywords
Optimal design of experiments; D-optimality; Cost constraints; Barycentric algorithm;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:metrik:v:80:y:2017:i:2:d:10.1007_s00184-016-0599-3. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.