2015
DOI: 10.1016/j.jspi.2014.10.006
|View full text |Cite
|
Sign up to set email alerts
|

Optimal design measures under asymmetric errors, with application to binary design points

Abstract: We study the optimal design problem under second-order least squares estimation which is known to outperform ordinary least squares estimation when the error distribution is asymmetric.First, a general approximate theory is developed, taking due cognizance of the nonlinearity of the underlying information matrix in the design measure. This yields necessary and sufficient conditions that a D-or A-optimal design measure must satisfy. The results are then applied to find optimal design measures when the design po… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
12
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 19 publications
(13 citation statements)
references
References 6 publications
1
12
0
Order By: Relevance
“…These results are similar to those in Bose and Mukerjee (2015), and the proofs are given in the Appendix. For practical purposes, we treat a design as optimal if its weight vectorŵ satisfies:…”
Section: Kiefer-wolfowitz Equivalence Theoremsupporting
confidence: 83%
“…These results are similar to those in Bose and Mukerjee (2015), and the proofs are given in the Appendix. For practical purposes, we treat a design as optimal if its weight vectorŵ satisfies:…”
Section: Kiefer-wolfowitz Equivalence Theoremsupporting
confidence: 83%
“…Using this result, Gao and Zhou (2014) proposed new optimality criteria under SLSE and obtained several results. Bose and Mukerjee (2015) and Gao and Zhou (2015) made further developments, including the convexity results for the criteria and numerical algorithms. Bose and Mukerjee (2015) applied the multiplicative algorithms in Zhang and Mukerjee (2013) for computing the optimal designs, while Gao and Zhou (2015) used the CVX program in MATLAB (Grant and Boyd (2013)).…”
Section: Introductionmentioning
confidence: 99%
“…It is important that boldIξNfalse(bold-italicθfalse) is linear in w , so scriptLDfalse(ξNfalse), scriptLDfalse(ξNfalse) and scriptLACfalse(ξNfalse) are convex functions of w (Boyd & Vandenberghe, ; Bose & Mukerjee, ). We then apply CVX to find optimal designs after writing the convex optimization problem in a general form: alignleftalign-1minwL(ξN),subject to:wi0,i=1,,N,falsefalsei=1Nwi=1,align-2 where scriptLfalse(ξNfalse) can be scriptLDfalse(ξNfalse), scriptLDfalse(ξNfalse), scriptLACfalse(ξNfalse), or other convex functions of w discussed later in Section 4.4.…”
Section: Cvx‐based Algorithmsmentioning
confidence: 99%
“…Similar to Bose & Mukerjee () and Wong, Yin & Zhou (), the optimality conditions are stated in Lemma . Let ξN be the optimal design with weight vector trueboldw^, let hTifalse(trueboldw^false)=trace()boldC1em()boldIξN1false(bold-italicθfalse)1emboldIboldxifalse(bold-italicθfalse)boldIξN1false(bold-italicθfalse)boldIξN1false(bold-italicθfalse)boldC, and let hDifalse(trueboldw^false)=trace()boldIξN1false(bold-italicθfalse)1emboldIboldxifalse(bold-italicθfalse)q,1emi=1,,N. The latter two functions represent the negative directional derivative of the criterion evaluated at ξN in the direction of the degenerate design at x i .…”
Section: Cvx‐based Algorithmsmentioning
confidence: 99%
See 1 more Smart Citation