A semi-infinite programming based algorithm for determining T-optimum designs for model discrimination
From MaRDI portal
Publication:2256741
DOI10.1016/j.jmva.2014.11.006zbMath1314.62164OpenAlexW1999732211WikidataQ37008451 ScholiaQ37008451MaRDI QIDQ2256741
Weng Kee Wong, Anthony C. Atkinson, Belmiro P. M. Duarte
Publication date: 20 February 2015
Published in: Journal of Multivariate Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmva.2014.11.006
global optimizationequivalence theoremsemi-infinite programmingcontinuous designminimax programmaximum likelihood design
Related Items
Optimal Design of Experiments for Implicit Models, An algorithm based on semidefinite programming for finding minimax optimal designs, R-optimal designs for multi-response regression models with multi-factors, Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces, An equivalence theorem for design optimality with respect to a multi-objective criterion, Adaptive grid semidefinite programming for finding optimal designs, D-optimal designs based on the second-order least squares estimator, Using SeDuMi to find various optimal designs for regression models, Optimal exact designs of experiments via mixed integer nonlinear programming, Optimal experimental design for linear time invariant state-space models, T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models
- \(T\)-optimal designs for discrimination between two polynomial models
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
- Semi-infinite programming
- Optimal designs for discriminating between some extensions of the Michaelis-Menten model
- Global solution of bilevel programs with a nonconvex inner program
- General equivalence theory for optimum designs (approximate theory)
- Infinitely constrained optimization problems
- Discrimination designs for polynomial regression on compact intervals
- Model-oriented design of experiments
- Optimization. Algorithms and consistent approximations
- Semi-infinite programming and applications to minimax problems
- Optimal designs for the identification of the order of a Fourier regression
- Optimal discrimination designs
- Optimal Design for Nonlinear Response Models
- Optimum Experimental Designs for Choosing Between Competitive and Non Competitive Models of Enzyme Inhibition
- Robust Discrimination Designs
- Semi-Infinite Programming: Theory, Methods, and Applications
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- The Equivalence of Two Extremum Problems
- An Introduction to Optimal Designs for Social and Biomedical Research
- Optimal Measurement Methods for Distributed Parameter System Identification
- Necessary conditions for min-max problems and algorithms by a relaxation procedure
- Optimum experimental design for discriminating between two rival models in the presence of prior information
- The design of experiments for discriminating between two rival models
- Equivalence Theorems and Cutting Plane Algorithms for a Class of Experimental Design Problems
- T-Optimum Designs for Discrimination Between Two Multiresponse Dynamic Models
- An Optimal Experimental Design Criterion for Discriminating Between Non-Normal Models
- The Sequential Generation of $D$-Optimum Experimental Designs
- Übersichtsarbeiten
