IDEAS home Printed from https://ideas.repec.org/a/bla/biomet/v68y2012i1p138-145.html
   My bibliography  Save this article

Efficient Algorithms for Optimal Designs with Correlated Observations in Pharmacokinetics and Dose-Finding Studies

Author

Listed:
  • Tim Holland-Letz
  • Holger Dette
  • Didier Renard

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:bla:biomet:v:68:y:2012:i:1:p:138-145
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1111/j.1541-0420.2011.01657.x
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. 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.
    2. Holger Dette, 1997. "Designing Experiments with Respect to ‘Standardized’ Optimality Criteria," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 59(1), pages 97-110.
    3. 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.
    Full references (including those not matched with items on IDEAS)

    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.
    1. 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.
    2. Radoslav Harman & Eva Benková, 2017. "Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 80(2), pages 201-225, February.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. Dette, Holger & Biedermann, Stefanie & Zhu, Wei, 2005. "Geometric construction of optimal designs for dose-responsemodels with two parameters," Technical Reports 2005,08, Technische Universität Dortmund, Sonderforschungsbereich 475: Komplexitätsreduktion in multivariaten Datenstrukturen.
    8. Dennis Schmidt & Rainer Schwabe, 2015. "On optimal designs for censored data," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 78(3), pages 237-257, April.
    9. Holger Dette & Laura Hoyden & Sonja Kuhnt & Kirsten Schorning, 2017. "Optimal designs for thermal spraying," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 66(1), pages 53-72, January.
    10. Lenka Filová & Mária Trnovská & Radoslav Harman, 2012. "Computing maximin efficient experimental designs using the methods of semidefinite programming," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 75(5), pages 709-719, July.
    11. Liu, Xin & Yue, Rong-Xian & Chatterjee, Kashinath, 2014. "R-optimal designs in random coefficient regression models," Statistics & Probability Letters, Elsevier, vol. 88(C), pages 127-132.
    12. 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.
    13. Ulrike Graßhoff & Heinz Holling & Rainer Schwabe, 2012. "Optimal Designs for the Rasch Model," Psychometrika, Springer;The Psychometric Society, vol. 77(4), pages 710-723, October.
    14. Bin Han & Ilya O. Ryzhov & Boris Defourny, 2016. "Optimal Learning in Linear Regression with Combinatorial Feature Selection," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 721-735, November.
    15. Pepelyshev, Andrey & Melas, Viatcheslav B. & Strigul, Nikolay & Dette, Holger, 2004. "Design of experiments for the Monod model : robust and efficient designs," Technical Reports 2004,36, Technische Universität Dortmund, Sonderforschungsbereich 475: Komplexitätsreduktion in multivariaten Datenstrukturen.
    16. 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.
    17. Lei He & Rong-Xian Yue, 2020. "R-optimal designs for trigonometric regression models," Statistical Papers, Springer, vol. 61(5), pages 1997-2013, October.
    18. Rosa, Samuel & Harman, Radoslav, 2022. "Computing minimum-volume enclosing ellipsoids for large datasets," Computational Statistics & Data Analysis, Elsevier, vol. 171(C).
    19. Dette, Holger & O'Brien, Timothy E., 2003. "Efficient experimental design for the Behrens-Fisher problem with application to bioassay," Technical Reports 2003,21, Technische Universität Dortmund, Sonderforschungsbereich 475: Komplexitätsreduktion in multivariaten Datenstrukturen.
    20. He, Lei & He, Daojiang, 2020. "R-optimal designs for individual prediction in random coefficient regression models," Statistics & Probability Letters, Elsevier, vol. 159(C).

    More about this item

    Statistics

    Access and download statistics

    Corrections

    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:bla:biomet:v:68:y:2012:i:1:p:138-145. 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: Wiley Content Delivery (email available below). General contact details of provider: http://www.blackwellpublishing.com/journal.asp?ref=0006-341X .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.