IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i3p438-d1578926.html
   My bibliography  Save this article

Construction of Uniform Designs over a Domain with Linear Constraints

Author

Listed:
  • Luojing Yang

    (School of Statistics and Data Science, LPMC & KLMDASR, Nankai University, Tianjin 300071, China)

  • Xiaoping Yang

    (National Elite Institute of Engineering, Northwestern Polytechnical University, Xi’an 710072, China)

  • Yongdao Zhou

    (School of Statistics and Data Science, LPMC & KLMDASR, Nankai University, Tianjin 300071, China)

Abstract

Uniform design is a powerful and robust experimental methodology that is particularly advantageous for multidimensional numerical integration and high-level experiments. As its applications expand across diverse disciplines, the theoretical foundation of uniform design continues to evolve. In real-world scenarios, experimental factors are often subject to one or more linear constraints, which pose challenges in constructing efficient designs within constrained high-dimensional experimental spaces. These challenges typically require sophisticated algorithms, which may compromise uniformity and robustness. Addressing these constraints is critical for reducing costs, improving model accuracy, and identifying global optima in optimization problems. However, existing research primarily focuses on unconstrained or minimally constrained hypercubes, leaving a gap in constructing designs tailored to arbitrary linear constraints. This study bridges this gap by extending the inverse Rosenblatt transformation framework to develop innovative methods for constructing uniform designs over arbitrary hyperplanes and hyperspheres within unit hypercubes. Explicit construction formulas for these constrained domains are derived, offering simplified calculations for practitioners and providing a practical solution applicable to a wide range of experimental scenarios. Numerical simulations demonstrate the feasibility and effectiveness of these methods, setting a new benchmark for uniform design in constrained experimental regions.

Suggested Citation

  • Luojing Yang & Xiaoping Yang & Yongdao Zhou, 2025. "Construction of Uniform Designs over a Domain with Linear Constraints," Mathematics, MDPI, vol. 13(3), pages 1-23, January.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:3:p:438-:d:1578926
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/3/438/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/3/438/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Lin, D.K.J. & Sharpe, C. & Winker, P., 2010. "Optimized U-type designs on flexible regions," Computational Statistics & Data Analysis, Elsevier, vol. 54(6), pages 1505-1515, June.
    2. Astrid Jourdan, 2024. "Space-filling designs with a Dirichlet distribution for mixture experiments," Statistical Papers, Springer, vol. 65(5), pages 2667-2686, July.
    3. Yang Huang & Yongdao Zhou, 2022. "Convergence of Uniformity Criteria and the Application in Numerical Integration," Mathematics, MDPI, vol. 10(19), pages 1-20, October.
    4. Yan Liu & Min-Qian Liu, 2016. "Construction of uniform designs for mixture experiments with complex constraints," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 45(8), pages 2172-2180, April.
    5. Zong-Feng Qi & Jian-Feng Yang & Yan Liu & Min-Qian Liu, 2017. "Construction of nearly uniform designs on irregular regions," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 46(17), pages 8318-8327, September.
    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. Xiong, Zikang & Liu, Liwei & Ning, Jianhui & Qin, Hong, 2020. "Sphere packing design for experiments with mixtures," Statistics & Probability Letters, Elsevier, vol. 164(C).
    2. Chen, Ray-Bing & Hsu, Yen-Wen & Hung, Ying & Wang, Weichung, 2014. "Discrete particle swarm optimization for constructing uniform design on irregular regions," Computational Statistics & Data Analysis, Elsevier, vol. 72(C), pages 282-297.
    3. Rios, Nicholas & Winker, Peter & Lin, Dennis K.J., 2022. "TA algorithms for D-optimal OofA Mixture designs," Computational Statistics & Data Analysis, Elsevier, vol. 168(C).
    4. Marianna Lyra, 2010. "Heuristic Strategies in Finance – An Overview," Working Papers 045, COMISEF.
    5. Astrid Jourdan, 2024. "Space-filling designs with a Dirichlet distribution for mixture experiments," Statistical Papers, Springer, vol. 65(5), pages 2667-2686, July.

    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:gam:jmathe:v:13:y:2025:i:3:p:438-:d:1578926. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.