A semi-infinite programming based algorithm for determining T-optimum designs for model discrimination
From MaRDI portal
Publication:2256741
Recommendations
- A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models
- Optimal discrimination designs
- An algorithm based on semidefinite programming for finding minimax optimal designs
- Bayesian \(T\)-optimal discriminating designs
- Optimal discriminating designs for several competing regression models
Cites work
- T-Optimum Designs for Discrimination Between Two Multiresponse Dynamic 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
- A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models
- An Introduction to Optimal Designs for Social and Biomedical Research
- An Optimal Experimental Design Criterion for Discriminating Between Non-Normal Models
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- Discrimination designs for polynomial regression on compact intervals
- Equivalence Theorems and Cutting Plane Algorithms for a Class of Experimental Design Problems
- General equivalence theory for optimum designs (approximate theory)
- Global solution of bilevel programs with a nonconvex inner program
- scientific article; zbMATH DE number 3176492 (Why is no real title available?)
- scientific article; zbMATH DE number 3456364 (Why is no real title available?)
- scientific article; zbMATH DE number 3502650 (Why is no real title available?)
- scientific article; zbMATH DE number 1834580 (Why is no real title available?)
- scientific article; zbMATH DE number 800961 (Why is no real title available?)
- scientific article; zbMATH DE number 2209647 (Why is no real title available?)
- Infinitely constrained optimization problems
- Model-oriented design of experiments
- Necessary conditions for min-max problems and algorithms by a relaxation procedure
- Optimal design for nonlinear response models
- Optimal designs for discriminating between some extensions of the Michaelis-Menten model
- Optimal designs for the identification of the order of a Fourier regression
- Optimal discrimination designs
- Optimal Measurement Methods for Distributed Parameter System Identification
- Optimization. Algorithms and consistent approximations
- Optimum experimental design for discriminating between two rival models in the presence of prior information
- Optimum experimental designs for choosing between competitive and non competitive models of enzyme inhibition
- Optimum experimental designs, with SAS
- Robust discrimination designs
- Semi-infinite programming
- Semi-infinite programming and applications to minimax problems
- Semi-Infinite Programming: Theory, Methods, and Applications
- The design of experiments for discriminating between two rival models
- The Equivalence of Two Extremum Problems
- The Sequential Generation of D-Optimum Experimental Designs
- Übersichtsarbeiten
Cited in
(14)- An algorithm based on semidefinite programming for finding minimax optimal designs
- Adaptive grid semidefinite programming for finding optimal designs
- Using SeDuMi to find various optimal designs for regression models
- Optimal experimental design for linear time invariant state-space models
- Optimal exact designs of experiments via mixed integer nonlinear programming
- T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method
- A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models
- Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces
- R-optimal designs for multi-response regression models with multi-factors
- D-optimal designs based on the second-order least squares estimator
- Optimal Design of Experiments for Implicit Models
- An equivalence theorem for design optimality with respect to a multi-objective criterion
- A tri-level approach for T-criterion-based model discrimination
- Compound optimal design of experiments - semidefinite programming formulations
This page was built for publication: A semi-infinite programming based algorithm for determining T-optimum designs for model discrimination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256741)
