IDEAS home Printed from https://ideas.repec.org/a/eee/ecosta/v28y2023icp155-162.html
   My bibliography  Save this article

Numerical Methods for Finding A-optimal Designs Analytically

Author

Listed:
  • Chen, Ping-Yang
  • Chen, Ray-Bing
  • Chen, Yu-Shi
  • Wong, Weng Kee

Abstract

The traditional way in statistics to find optimal designs for regression models is an analytical approach. Technical conditions that may be restrictive in practice are sometimes imposed to obtain the analytical results. Even then, the mathematical technique is invariably not amendable to find an optimal design under a different criterion or for the same criterion with a slightly changed model, suggesting that developing flexible and effective algorithms to search for the optimum is very useful. In particular, numerical results from an algorithm can be helpful to find analytical descriptions of optimal designs. As an example, particle swarm optimization has been shown to be quite effective for finding optimal designs for hard design problems and this paper demonstrates how its output can be used to find new analytic A-optimal approximate designs for the Gamma and inverse Gaussian models, each with the inverse link function. The methodology is quite general and may be applied to find analytical A-optimal designs for other models, like the Poisson model with the log link function, or other types of optimal designs.

Suggested Citation

  • Chen, Ping-Yang & Chen, Ray-Bing & Chen, Yu-Shi & Wong, Weng Kee, 2023. "Numerical Methods for Finding A-optimal Designs Analytically," Econometrics and Statistics, Elsevier, vol. 28(C), pages 155-162.
    • Handle: RePEc:eee:ecosta:v:28:y:2023:i:c:p:155-162
    DOI: 10.1016/j.ecosta.2022.09.005
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S2452306222000867
    Download Restriction: Full text for ScienceDirect subscribers only. Contains open access articles
    File URL: https://libkey.io/10.1016/j.ecosta.2022.09.005?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. Yuanzhi Huang & Steven G. Gilmour & Kalliopi Mylona & Peter Goos, 2020. "Optimal Design of Experiments for Hybrid Nonlinear Models, with Applications to Extended Michaelis–Menten Kinetics," Journal of Agricultural, Biological and Environmental Statistics, Springer;The International Biometric Society;American Statistical Association, vol. 25(4), pages 601-616, December.
    2. Min Yang & Stefanie Biedermann & Elina Tang, 2013. "On Optimal Designs for Nonlinear Models: A General and Efficient Algorithm," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 108(504), pages 1411-1420, December.
    3. Masoudi, Ehsan & Holling, Heinz & Wong, Weng Kee, 2017. "Application of imperialist competitive algorithm to find minimax and standardized maximin optimal designs," Computational Statistics & Data Analysis, Elsevier, vol. 113(C), pages 330-345.
    4. Wael Korani & Malek Mouhoub, 2021. "Review on Nature-Inspired Algorithms," SN Operations Research Forum, Springer, vol. 2(3), pages 1-26, September.
    5. García-Ródenas, Ricardo & García-García, José Carlos & López-Fidalgo, Jesús & Martín-Baos, José Ángel & Wong, Weng Kee, 2020. "A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs," Computational Statistics & Data Analysis, Elsevier, vol. 144(C).
    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. Nedka Dechkova Nikiforova & Rossella Berni & Jesús Fernando López‐Fidalgo, 2022. "Optimal approximate choice designs for a two‐step coffee choice, taste and choice again experiment," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 71(5), pages 1895-1917, November.
    2. Yu, Jun & Meng, Xiran & Wang, Yaping, 2023. "Optimal designs for semi-parametric dose-response models under random contamination," Computational Statistics & Data Analysis, Elsevier, vol. 178(C).
    3. 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.
    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. 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.
    6. Hans-Peter Piepho & Robert J. Tempelman & Emlyn R. Williams, 2020. "Guest Editors’ Introduction to the Special Issue on “Recent Advances in Design and Analysis of Experiments and Observational Studies in Agriculture”," Journal of Agricultural, Biological and Environmental Statistics, Springer;The International Biometric Society;American Statistical Association, vol. 25(4), pages 453-456, December.
    7. Haoyu Wang & Chongqi Zhang, 2022. "The mixture design threshold accepting algorithm for generating $$\varvec{D}$$ D -optimal designs of the mixture models," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 85(3), pages 345-371, April.
    8. 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).
    9. Lianyan Fu & Faming Ma & Zhuoxi Yu & Zhichuan Zhu, 2023. "Multiplication Algorithms for Approximate Optimal Distributions with Cost Constraints," Mathematics, MDPI, vol. 11(8), pages 1-14, April.
    10. Carlos de la Calle-Arroyo & Miguel A. González-Fernández & Licesio J. Rodríguez-Aragón, 2023. "Optimal Designs for Antoine’s Equation: Compound Criteria and Multi-Objective Designs via Genetic Algorithms," Mathematics, MDPI, vol. 11(3), pages 1-16, January.
    11. 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.
    12. Qing Liu & Yihui (Elina) Tang, 2015. "Construction of Heterogeneous Conjoint Choice Designs: A New Approach," Marketing Science, INFORMS, vol. 34(3), pages 346-366, May.
    13. Rosa, Samuel & Harman, Radoslav, 2022. "Computing minimum-volume enclosing ellipsoids for large datasets," Computational Statistics & Data Analysis, Elsevier, vol. 171(C).
    14. Lenka Filová & Radoslav Harman, 2020. "Ascent with quadratic assistance for the construction of exact experimental designs," Computational Statistics, Springer, vol. 35(2), pages 775-801, June.
    15. García-Ródenas, Ricardo & García-García, José Carlos & López-Fidalgo, Jesús & Martín-Baos, José Ángel & Wong, Weng Kee, 2020. "A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs," Computational Statistics & Data Analysis, Elsevier, vol. 144(C).
    16. Wael Korani & Malek Mouhoub, 2021. "Review on Nature-Inspired Algorithms," SN Operations Research Forum, Springer, vol. 2(3), pages 1-26, September.
    17. Ul Hassan, Mahmood & Miller, Frank, 2021. "An exchange algorithm for optimal calibration of items in computerized achievement tests," Computational Statistics & Data Analysis, Elsevier, vol. 157(C).
    18. Lei He & Rong-Xian Yue, 2022. "$$I_L$$ I L -optimal designs for regression models under the second-order least squares estimator," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 85(1), pages 53-66, January.
    19. Xin Liu & Rong‐Xian Yue & Weng Kee Wong, 2022. "Equivalence theorems for c and DA‐optimality for linear mixed effects models with applications to multitreatment group assignments in health care," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 49(4), pages 1842-1859, December.
    20. Radoslav Harman & Eva Benková, 2017. "Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 80(2), pages 201-225, February.

    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:eee:ecosta:v:28:y:2023:i:c:p:155-162. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/econometrics-and-statistics .

    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.