IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v51y2012i3p1397-1408.html
   My bibliography  Save this article

Two complexity results on c-optimality in experimental design

Author

Listed:
  • Michal Černý
  • Milan Hladík

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:coopap:v:51:y:2012:i:3:p:1397-1408
    DOI: 10.1007/s10589-010-9377-8
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-010-9377-8
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-010-9377-8?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. 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)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Guillaume Sagnol & Edouard Pauwels, 2019. "An unexpected connection between Bayes A-optimal designs and the group lasso," Statistical Papers, Springer, vol. 60(2), pages 565-584, April.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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).
    7. Katarína Burclová & Andrej Pázman, 2016. "Optimal design of experiments via linear programming," Statistical Papers, Springer, vol. 57(4), pages 893-910, December.
    8. 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:coopap:v:51:y:2012:i:3:p:1397-1408. 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.