IDEAS home Printed from https://ideas.repec.org/a/spr/alstar/v94y2010i4p341-351.html
   My bibliography  Save this article

Optimal Latin hypercube designs for the Kullback–Leibler criterion

Author

Listed:
  • A. Jourdan
  • J. Franco

Abstract

No abstract is available for this item.

Suggested Citation

  • A. Jourdan & J. Franco, 2010. "Optimal Latin hypercube designs for the Kullback–Leibler criterion," AStA Advances in Statistical Analysis, Springer;German Statistical Society, vol. 94(4), pages 341-351, December.
    • Handle: RePEc:spr:alstar:v:94:y:2010:i:4:p:341-351
    DOI: 10.1007/s10182-010-0145-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10182-010-0145-y
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10182-010-0145-y?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. Husslage, B.G.M. & Rennen, G. & van Dam, E.R. & den Hertog, D., 2008. "Space-Filling Latin Hypercube Designs For Computer Experiments (Revision of CentER DP 2006-18)," Discussion Paper 2008-104, Tilburg University, Center for Economic Research.
    2. Grosso, A. & Jamali, A.R.M.J.U. & Locatelli, M., 2009. "Finding maximin latin hypercube designs by Iterated Local Search heuristics," European Journal of Operational Research, Elsevier, vol. 197(2), pages 541-547, September.
    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. János Pintér & Zoltán Horváth, 2013. "Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints," Journal of Global Optimization, Springer, vol. 57(1), pages 191-215, September.
    2. Crabbe, Marjolein & Akinc, Deniz & Vandebroek, Martina, 2014. "Fast algorithms to generate individualized designs for the mixed logit choice model," Transportation Research Part B: Methodological, Elsevier, vol. 60(C), pages 1-15.
    3. Astrid Jourdan, 2024. "Space-filling designs with a Dirichlet distribution for mixture experiments," Statistical Papers, Springer, vol. 65(5), pages 2667-2686, July.

    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. János Pintér & Zoltán Horváth, 2013. "Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints," Journal of Global Optimization, Springer, vol. 57(1), pages 191-215, September.
    2. Rennen, G. & Husslage, B.G.M. & van Dam, E.R. & den Hertog, D., 2010. "Nested maximin Latin hypercube designs," Other publications TiSEM 7f0703e8-06bc-45b4-886c-3, Tilburg University, School of Economics and Management.
    3. Jing Zhang & Jin Xu & Kai Jia & Yimin Yin & Zhengming Wang, 2019. "Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes," Mathematics, MDPI, vol. 7(9), pages 1-16, September.
    4. Rennen, G. & Husslage, B.G.M. & van Dam, E.R. & den Hertog, D., 2009. "Nested Maximin Latin Hypercube Designs," Discussion Paper 2009-06, Tilburg University, Center for Economic Research.
    5. Bozağaç, Doruk & Batmaz, İnci & Oğuztüzün, Halit, 2016. "Dynamic simulation metamodeling using MARS: A case of radar simulation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 124(C), pages 69-86.
    6. Liuqing Yang & Yongdao Zhou & Min-Qian Liu, 2021. "Maximin distance designs based on densest packings," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 84(5), pages 615-634, July.
    7. Edwin R. van Dam & Gijs Rennen & Bart Husslage, 2009. "Bounds for Maximin Latin Hypercube Designs," Operations Research, INFORMS, vol. 57(3), pages 595-608, June.
    8. Vinícius Resende Domingues & Luan Carlos de Sena Monteiro Ozelim & André Pacheco de Assis & André Luís Brasil Cavalcante, 2022. "Combining Numerical Simulations, Artificial Intelligence and Intelligent Sampling Algorithms to Build Surrogate Models and Calculate the Probability of Failure of Urban Tunnels," Sustainability, MDPI, vol. 14(11), pages 1-29, May.
    9. Crombecq, K. & Laermans, E. & Dhaene, T., 2011. "Efficient space-filling and non-collapsing sequential design strategies for simulation-based modeling," European Journal of Operational Research, Elsevier, vol. 214(3), pages 683-696, November.
    10. Pengfei Gao & Xinggang Yan & Yao Wang & Hongwei Li & Mei Zhan & Fei Ma & Mingwang Fu, 2023. "An online intelligent method for roller path design in conventional spinning," Journal of Intelligent Manufacturing, Springer, vol. 34(8), pages 3429-3444, December.
    11. Gao, Yanping & Yi, Siyu & Zhou, Yongdao, 2022. "Maximin L1-distance Range-fixed Level-augmented designs," Statistics & Probability Letters, Elsevier, vol. 186(C).
    12. Tonghui Pang & Yan Wang & Jian-Feng Yang, 2022. "Asymptotically optimal maximin distance Latin hypercube designs," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 85(4), pages 405-418, May.
    13. van Dam, E.R. & Rennen, G. & Husslage, B.G.M., 2009. "Bounds for maximin Latin hypercube designs," Other publications TiSEM f556d9e2-e3b9-42db-96ee-9, Tilburg University, School of Economics and Management.

    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:alstar:v:94:y:2010:i:4:p:341-351. 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.