T-optimality: a stopping rule for a first order algorithm
In the optimal design theory, the T-optimality criterion is useful for the discrimination between two competitive models. This criterion has an interesting statistical interpretation as the power of a test for the fit of a second model when the first one is true. Usually there is not a closed form for the T-optimum design and it must be computed through an iterative procedure. In this short note a stopping rule for a first order algorithm is provided. The proposed stopping rule has the interesting feature that the algorithm will always stop at a design which reaches a minimum fixed efficiency. In other words, the algorithm stops when it reaches a design efficiency (with respect to the unknown T-optimum design) as good as wanted.
|Date of creation:||01 Jan 2004|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: +39 02 50321522
Fax: +39 02 50321505
Web page: http://www.demm.unimi.it
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:mil:wpdepa:2004-30. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (DEMM Working Papers)
If references are entirely missing, you can add them using this form.