Please use this identifier to cite or link to this item: https://hdl.handle.net/10316/113715
Title: Optimal design of experiments for hypothesis testing on ordered treatments via intersection-union tests
Authors: Duarte, Belmiro P. M. 
Atkinson, Anthony C.
Singh, Satya P.
Reis, Marco S. 
Keywords: Optimal design of experiments; Hypothesis testing; Ordered treatments; Surrogate optimization; Power function; Alphabetic optimality
Issue Date: 2022
Serial title, monograph or event: Statistical Papers
Volume: 64
Issue: 2
Abstract: We find experimental plans for hypothesis testing when a prior ordering of experimental groups or treatments is expected. Despite the practical interest of the topic, namely in dose finding, algorithms for systematically calculating good plans are still elusive. Here, we consider the intersection-union principle for constructing optimal experimental designs for testing hypotheses about ordered treatments. We propose an optimization-based formulation to handle the problem when the power of the test is to be maximized. This formulation yields a complex objective function which we handle with a surrogate-based optimizer. The algorithm proposed is demonstrated for several ordering relations. The relationship between designs maximizing power for the intersection-union test (IUT) and optimality criteria used for linear regression models is analyzed; we demonstrate that IUT-based designs are well approximated by C-optimal designs and maximum entropy sampling designs while DA-optimal designs are equivalent to balanced designs. Theoretical and numerical results supporting these relations are presented.
URI: https://hdl.handle.net/10316/113715
ISSN: 0932-5026
1613-9798
DOI: 10.1007/s00362-022-01334-8
Rights: openAccess
Appears in Collections:FCTUC Eng.Química - Artigos em Revistas Internacionais
I&D CIEPQPF - Artigos em Revistas Internacionais

Show full item record

Page view(s)

24
checked on Apr 24, 2024

Download(s)

9
checked on Apr 24, 2024

Google ScholarTM

Check

Altmetric

Altmetric


This item is licensed under a Creative Commons License Creative Commons