IDEAS home Printed from https://ideas.repec.org/a/spr/stpapr/v57y2016i4d10.1007_s00362-016-0782-7.html
   My bibliography  Save this article

Optimal design of experiments via linear programming

Author

Listed:
  • Katarína Burclová

    (Comenius University Bratislava)

  • Andrej Pázman

    (Comenius University Bratislava)

Abstract

We investigate the possibility of extending some results of Pázman and Pronzato (Ann Stat 42(4):1426–1451, 2014) to a larger set of optimality criteria. Namely, the problems of computing D-, A-, and $$E_k$$ E k -optimal designs in a linear regression model are reformulated here as “infinite-dimensional” linear programming problems. The same approach is applied to combination of these optimality criteria and to the “criterion robust” problem of Harman (Metrika 60:137–153, 2004). Approximate optimum designs can then be computed by a relaxation method (Shimizu and Aiyoshi in IEEE Trans Autom Control 25(1):62–66, 1980), and this is illustrated on various examples.

Suggested Citation

  • Katarína Burclová & Andrej Pázman, 2016. "Optimal design of experiments via linear programming," Statistical Papers, Springer, vol. 57(4), pages 893-910, December.
    • Handle: RePEc:spr:stpapr:v:57:y:2016:i:4:d:10.1007_s00362-016-0782-7
    DOI: 10.1007/s00362-016-0782-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00362-016-0782-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00362-016-0782-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. 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.
    2. Radoslav Harman, 2004. "Minimal efficiency of designs under the class of orthogonally invariant information criteria," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 60(2), pages 137-153, September.
    3. Harman, Radoslav & Jurík, Tomás, 2008. "Computing c-optimal experimental designs using the simplex method of linear programming," Computational Statistics & Data Analysis, Elsevier, vol. 53(2), pages 247-254, December.
    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. 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.
    2. Duarte, Belmiro P.M. & Sagnol, Guillaume & Wong, Weng Kee, 2018. "An algorithm based on semidefinite programming for finding minimax optimal designs," Computational Statistics & Data Analysis, Elsevier, vol. 119(C), pages 99-117.
    3. Samuel Rosa, 2018. "Optimal designs for treatment comparisons represented by graphs," AStA Advances in Statistical Analysis, Springer;German Statistical Society, vol. 102(4), pages 479-503, October.
    4. 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.
    5. Michal Černý & Milan Hladík, 2012. "Two complexity results on c-optimality in experimental design," Computational Optimization and Applications, Springer, vol. 51(3), pages 1397-1408, April.
    6. 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.
    7. Samuel Rosa & Radoslav Harman, 2016. "Optimal approximate designs for estimating treatment contrasts resistant to nuisance effects," Statistical Papers, Springer, vol. 57(4), pages 1077-1106, December.
    8. Rodríguez-Díaz, Juan M., 2017. "Computation of c-optimal designs for models with correlated observations," Computational Statistics & Data Analysis, Elsevier, vol. 113(C), pages 287-296.
    9. Elham Yousefi & Werner G. Müller, 2023. "Impact of the Error Structure on the Design and Analysis of Enzyme Kinetic Models," Statistics in Biosciences, Springer;International Chinese Statistical Association, vol. 15(1), pages 31-56, April.
    10. Peng, Cheng & Kouri, Drew P. & Uryasev, Stan, 2024. "Efficient and robust optimal design for quantile regression based on linear programming," Computational Statistics & Data Analysis, Elsevier, vol. 192(C).
    11. 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.

    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:spr:stpapr:v:57:y:2016:i:4:d:10.1007_s00362-016-0782-7. 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.

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