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 条
  • [41] Flexible multi-core learning algorithm based on semi-infinite programming
    Automotive Engineering Research Institute, Jiangsu University, Zhenjiang
    Jiangsu
    212013, China
    [J]. Huazhong Ligong Daxue Xuebao, 8 (103-106): : 103 - 106
  • [42] CONDITIONS FOR THE UNIQUENESS OF THE OPTIMAL SOLUTION IN LINEAR SEMI-INFINITE PROGRAMMING
    GOBERNA, MA
    LOPEZ, MA
    [J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1992, 72 (02) : 225 - 246
  • [43] On generalized semi-infinite programming
    Rueckmann, Jan-J.
    Gomez, Juan Alfredo
    [J]. TOP, 2006, 14 (01) : 1 - 32
  • [44] A NEW PRIMAL ALGORITHM FOR SEMI-INFINITE LINEAR-PROGRAMMING
    ANDERSON, EJ
    [J]. LECTURE NOTES IN ECONOMICS AND MATHEMATICAL SYSTEMS, 1985, 259 : 108 - 122
  • [45] Comparative study of RPSALG algorithm for convex semi-infinite programming
    A. Auslender
    A. Ferrer
    M. A. Goberna
    M. A. López
    [J]. Computational Optimization and Applications, 2015, 60 : 59 - 87
  • [46] AN INTERIOR POINT ALGORITHM FOR SEMI-INFINITE LINEAR-PROGRAMMING
    FERRIS, MC
    PHILPOTT, AB
    [J]. MATHEMATICAL PROGRAMMING, 1989, 43 (03) : 257 - 276
  • [47] Modified gradient sampling algorithm for nonsmooth semi-infinite programming
    Shang, Tianyou
    Su, Ke
    Zhao, Bing
    Wei, Yanshu
    [J]. JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2023, 69 (06) : 4425 - 4450
  • [48] AN EXTENSION OF THE SIMPLEX ALGORITHM FOR SEMI-INFINITE LINEAR-PROGRAMMING
    ANDERSON, EJ
    LEWIS, AS
    [J]. MATHEMATICAL PROGRAMMING, 1989, 44 (03) : 247 - 269
  • [49] Comparative study of RPSALG algorithm for convex semi-infinite programming
    Auslender, A.
    Ferrer, A.
    Goberna, M. A.
    Lopez, M. A.
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2015, 60 (01) : 59 - 87
  • [50] A semi-infinite quadratic programming algorithm with applications to channel equalization
    Tran, T
    Dahl, M
    Claesson, I
    [J]. SEVENTH INTERNATIONAL SYMPOSIUM ON SIGNAL PROCESSING AND ITS APPLICATIONS, VOL 1, PROCEEDINGS, 2003, : 653 - 656