A new monotonic algorithm for the E-optimal experiment design problem
Nitesh Sahu and
Statistics & Probability Letters, 2021, vol. 174, issue C
In this paper, we develop a new monotonic algorithm for the E-optimal design problem, for which no simple monotonic algorithm is known to exist, using the idea of majorization–minimization. The available algorithms in the literature have no simple closed update equations whereas the proposed new algorithm has simple closed form update equations. The new algorithm is illustrated through numerical examples, and is shown to be competitive compared with the interior point method and existing state-of-the-art algorithm.
Keywords: E-optimal design criterion; majorization–minimization; Multiplicative algorithm; Experiment design (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
Full text for ScienceDirect subscribers only
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:174:y:2021:i:c:s0167715221000596
Ordering information: This journal article can be ordered from
https://shop.elsevie ... _01_ooc_1&version=01
Access Statistics for this article
Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul
More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().