Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    When is an Equally-Weighted Design D-optimal? (1999)
    Springer
    Annals of the Institute of Statistical Mathematics 51 (1999), S. 531-540 
    Details
    ISSN: 1572-9052
    Keywords: D-optimum design ; equivalence theorem ; G-optimum design ; information matrix
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We discuss conditions under which an equally weighted design is D-optimal. The concept of a model being maximally invariant with respect to a set is introduced and is shown to be useful in this work. Several illustrative examples are given, including two biomedical applications using compartmental and segmented models.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1003954207112
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Efficiency Bounds for Product Designs in Linear Models (1999)
    Springer
    Annals of the Institute of Statistical Mathematics 51 (1999), S. 723-730 
    Details
    ISSN: 1572-9052
    Keywords: A-optimal designs ; additive models ; continuous designs ; interaction ; k-way layout ; marginal models
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We provide lower efficiency bounds for the best product design for an additive multifactor linear model. The A-optimality criterion is used to demonstrate that out bounds are better than the conventional bounds. Applications to other criteria, such as IMSE (integrated mean squared error) criterion are also indicated. In all the cases, the best product design appears to perform better when there are more levels in each factor but decreases when more factors are included. Explicit efficiency formulas for non-additive models are also constructed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1004087314831
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Minimax d-optimal designs for item response theory models (2000)
    Springer
    Psychometrika 65 (2000), S. 377-390 
    Details
    ISSN: 1860-0980
    Keywords: optimal design ; IRT models ; minimax ; sequential designs
    Source: Springer Online Journal Archives 1860-2000
    Topics: Psychology
    Notes: Abstract Various different item response theory (IRT) models can be used in educational and psychological measurement to analyze test data. One of the major drawbacks of these models is that efficient parameter estimation can only be achieved with very large data sets. Therefore, it is often worthwhile to search for designs of the test data that in some way will optimize the parameter estimates. The results from the statistical theory on optimal design can be applied for efficient estimation of the parameters. A major problem in finding an optimal design for IRT models is that the designs are only optimal for a given set of parameters, that is, they are locally optimal. Locally optimal designs can be constructed with a sequential design procedure. In this paper minimax designs are proposed for IRT models to overcome the problem of local optimality. Minimax designs are compared to sequentially constructed designs for the two parameter logistic model and the results show that minimax design can be nearly as efficient as sequentially constructed designs.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02296152
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    facet.materialart.
    Unknown
    An algorithm based on Semidefinite Programming for finding minimax optimal designs (2018)
    Details
    Publication Date: 2020-08-05
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 5
    facet.materialart.
    Unknown
    An algorithm based on Semidefinite Programming for finding minimax optimal designs (2017)
    Details
    Publication Date: 2020-08-05
    Description: An algorithm based on a delayed constraint generation method for solving semi-infinite programs for constructing minimax optimal designs for nonlinear models is proposed. The outer optimization level of the minimax optimization problem is solved using a semidefinite programming based approach that requires the design space be discretized. A nonlinear programming solver is then used to solve the inner program to determine the combination of the parameters that yields the worst-case value of the design criterion. The proposed algorithm is applied to find minimax optimal designs for the logistic model, the flexible 4-parameter Hill homoscedastic model and the general nth order consecutive reaction model, and shows that it (i) produces designs that compare well with minimax $D-$optimal designs obtained from semi-infinite programming method in the literature; (ii) can be applied to semidefinite representable optimality criteria, that include the common A-, E-,G-, I- and D-optimality criteria; (iii) can tackle design problems with arbitrary linear constraints on the weights; and (iv) is fast and relatively easy to use.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...