A branch-and-bound algorithm for the exact optimal experimental design problem-Reference-Cited by-同舟云学术

A branch-and-bound algorithm for the exact optimal experimental design problem

Published:2021-08-27 Issue:5 Volume:31 Page:
ISSN:0960-3174
Container-title:Statistics and Computing
language:en
Short-container-title:Stat Comput

Author:

Ahipaşaoğlu Selin Damla^ORCID

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Statistics, Probability and Uncertainty,Statistics and Probability,Theoretical Computer Science

Link

https://link.springer.com/content/pdf/10.1007/s11222-021-10043-5.pdf

Reference40 articles.

1. Ahipaşaoğlu, S.D., Sun, P., Todd, M.J.: Linear convergence of a Modified Frank-Wolfe algorithm for computing minimum-volume enclosing ellipsoids. Optim. Methods Softw. 23, 5–19 (2008)

2. Ahipaşaoğlu, S.D.: A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach. Stat. Comput. 25, 1113–1127 (2015)

3. Allen-Zhu, Z., Li, Y., Singh, A., Wang, Y.: Near-optimal design of experiments via regret minimization. In: Proceedings of Machine Learning Research 126–135,(2017)

4. Atkinson, A.C., Donev, A.N., Tobias, R.D.: Optimum Experimental Designs, with SAS. Oxford University Press, Oxford (1992)

5. Atwood, C.L.: Sequences converging to D-optimal designs of experiments. Ann. Stat. 1(2), 342–352 (1973)

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Mixed-integer linear programming for computing optimal experimental designs;Journal of Statistical Planning and Inference;2025-01

2. D- andA-Optimal Screening Designs;Technometrics;2023-04-07