A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models
From MaRDI portal
Publication:261002
DOI10.1007/s11222-013-9420-6zbMath1332.90189OpenAlexW2083573549MaRDI QIDQ261002
Weng Kee Wong, Belmiro P. M. Duarte
Publication date: 22 March 2016
Published in: Statistics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11222-013-9420-6
semi-infinite programmingFisher information matrixcontinuous designgeneral equivalence theoremminmax problempower logistic model
Related Items
Optimal Design of Experiments for Implicit Models, An algorithm based on semidefinite programming for finding minimax optimal designs, Optimal designs for comparing curves in regression models with asymmetric errors, Adaptive grid semidefinite programming for finding optimal designs, D-optimal designs based on the second-order least squares estimator, A semi-infinite programming based algorithm for determining T-optimum designs for model discrimination, Using SeDuMi to find various optimal designs for regression models, Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion, A Metaheuristic Adaptive Cubature Based Algorithm to Find Bayesian Optimal Designs for Nonlinear Models, Optimal experimental design for linear time invariant state-space models, Optimal design of multifactor experiments via grid exploration
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimax optimal designs via particle swarm optimization methods
- Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
- Optimal minimax designs over a prespecified interval in a heteroscedastic polynomial model
- On the number of support points of maximin and Bayesian optimal designs
- A comparison of GCV and GML for choosing the smoothing parameter in the generalized spline smoothing problem
- Optimal Bayesian design applied to logistic regression experiments
- Infinitely constrained optimization problems
- Maximin efficient designs for estimating nonlinear aspects in linear models
- Bayesian D-optimal designs for exponential regression models
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- Semi-infinite programming and applications to minimax problems
- A minimax algorithm for constructing optimal symmetrical balanced designs for a logistic regression model
- Bayesian experimental design: A review
- E-optimal design for the Michaelis-Menten model
- Minimax \(D\)-optimal designs for item response theory models
- Semi-Infinite Programming: Theory, Methods, and Applications
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- An Introduction to Optimal Designs for Social and Biomedical Research
- A Quadratic Design Criterion for Precise Estimation in Nonlinear Regression Models
- Time- and Space-Saving Computer Methods, Related to Mitchell's DETMAX, for Finding D-Optimum Designs
- Convex design theory1
- Model Robust, Linear-Optimal Designs
- A unified approach to the construction of minimax designs
- An Algorithm for the Construction of "D-Optimal" Experimental Designs
- Design of Experiments for Subsets of Parameters
- Equivalence Theorems and Cutting Plane Algorithms for a Class of Experimental Design Problems
- Adaptive Approximations and Exact Penalization for the Solution of Generalized Semi-infinite Min-Max Problems
- Minimax D‐Optimal Designs for the Logistic Model
- Optimal designs for the power logistic model
- Optimal Designs for Rational Function Regression
- Minimax Designs
