A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models

被引:0
|
作者
Belmiro P. M. Duarte
Weng Kee Wong
机构
[1] Polytechnic Institute of Coimbra,Department of Chemical and Biological Engineering, ISEC
[2] University of Coimbra,GEPSI, CIEPQPF, Department of Chemical Engineering
[3] UCLA,Department of Biostatistics, Fielding School of Public Health
来源
Statistics and Computing | 2014年 / 24卷
关键词
Continuous design; Fisher Information Matrix; General equivalence theorem; Power logistic model; Semi-infinite programming; Minmax problem;
D O I
暂无
中图分类号
学科分类号
摘要
Minimax optimal experimental designs are notoriously difficult to study largely because the optimality criterion is not differentiable and there is no effective algorithm for generating them. We apply semi-infinite programming (SIP) to solve minimax design problems for nonlinear models in a systematic way using a discretization based strategy and solvers from the General Algebraic Modeling System (GAMS). Using popular models from the biological sciences, we show our approach produces minimax optimal designs that coincide with the few theoretical and numerical optimal designs in the literature. We also show our method can be readily modified to find standardized maximin optimal designs and minimax optimal designs for more complicated problems, such as when the ranges of plausible values for the model parameters are dependent and we want to find a design to minimize the maximal inefficiency of estimates for the model parameters.
引用
收藏
页码:1063 / 1080
页数:17
相关论文
共 50 条
  • [1] A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models
    Duarte, Belmiro P. M.
    Wong, Weng Kee
    [J]. STATISTICS AND COMPUTING, 2014, 24 (06) : 1063 - 1080
  • [2] An algorithm based on semidefinite programming for finding minimax optimal designs
    Duarte, Belmiro P. M.
    Sagnol, Guillaume
    Wong, Weng Kee
    [J]. COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2018, 119 : 99 - 117
  • [3] A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming
    Ou Yigui
    Zhou Qian
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2009, 215 (02) : 474 - 480
  • [4] Semi-Infinite Programming and Applications to Minimax Problems
    Stanislav Žaković
    Berc Rustem
    [J]. Annals of Operations Research, 2003, 124 : 81 - 110
  • [5] Semi-infinite programming and applications to minimax problems
    Zakovic, S
    Rustem, B
    [J]. ANNALS OF OPERATIONS RESEARCH, 2003, 124 (1-4) : 81 - 110
  • [6] On Nonsmooth Semi-Infinite Minimax Programming Problem with (Φ, ρ)-Invexity
    Liu, X. L.
    Lai, G. M.
    Xu, C. Q.
    Yuan, D. H.
    [J]. ABSTRACT AND APPLIED ANALYSIS, 2014,
  • [7] On Minimax Fractional Semi-Infinite Programming Problems with Applications
    Bae, Kwan Deok
    Piao, Guang-Ri
    Hong, Zhe
    Kim, Do Sang
    [J]. NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION, 2021, 42 (13) : 1522 - 1538
  • [8] A parallel algorithm for semi-infinite programming
    Zakovic, S
    Rustem, B
    Asprey, SP
    [J]. COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2003, 44 (1-2) : 377 - 390
  • [9] A PURIFICATION ALGORITHM FOR SEMI-INFINITE PROGRAMMING
    LEON, T
    VERCHER, E
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 57 (03) : 412 - 420
  • [10] A Semi-Infinite Programming based algorithm for determining T-optimum designs for model discrimination
    Duarte, Belmiro P. M.
    Wong, Weng Kee
    Atkinson, Anthony C.
    [J]. JOURNAL OF MULTIVARIATE ANALYSIS, 2015, 135 : 11 - 24