Optimal design of experiments via linear programming
From MaRDI portal
Publication:2374424
Abstract: We investigate the possibility of extending some results of Pazman and Pronzato (2014) to a larger set of optimality criteria. Namely, in a linear regression model the problem of computing D-, A-, E_k-optimal designs, of combining these optimality criteria, and the "criterion robust" problem of Harman (2004) are reformulated here as "infinite-dimensional" linear programming problems. Approximate optimum designs can then be computed by a modified cutting-plane method, and this is checked on examples. Finally, the expressions for these criteria are reformulated in terms of the response function of an even nonlinear model.
Recommendations
- Computing \(c\)-optimal experimental designs using the simplex method of linear programming
- Computing the minimal efficiency of designs by a differentiable approximation of \(\Phi _{E_k}\)-optimal\-ity criteria
- Computing exact \(D\)-optimal designs by mixed integer second-order cone programming
- scientific article; zbMATH DE number 800961
- Constrained optimal designs for regressiom models
Cites work
- scientific article; zbMATH DE number 2130678 (Why is no real title available?)
- scientific article; zbMATH DE number 54240 (Why is no real title available?)
- scientific article; zbMATH DE number 1077338 (Why is no real title available?)
- scientific article; zbMATH DE number 800961 (Why is no real title available?)
- Admissible experimental designs in multiple polynomial regression
- Computing \(c\)-optimal experimental designs using the simplex method of linear programming
- Computing maximin efficient experimental designs using the methods of semidefinite programming
- Criterion-robust experimental designs for the quadratic regression on a square and a cube
- Design of experiments in nonlinear models. Asymptotic normality, optimality criteria and small-sample properties
- Equivalence Theorems and Cutting Plane Algorithms for a Class of Experimental Design Problems
- Further characterizations of design optimality and admissibility for partial parameter estimation in linear regression
- General equivalence theory for optimum designs (approximate theory)
- Introductory lectures on convex optimization. A basic course.
- Minimal efficiency of designs under the class of orthogonally invariant information criteria
- Necessary conditions for min-max problems and algorithms by a relaxation procedure
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Optimal design: Variation in structure and performance under change of criterion
- Optimal weights for experimental designs on linearly independent support points
- Optimum Designs in Regression Problems
- Optimum Experimental Designs for Properties of a Compartmental Model
- Optimum design accounting for the global nonlinear behavior of the model
- The Cutting-Plane Method for Solving Convex Programs
Cited in
(27)- Simplex algorithm for finding \(E\)-optimal plans
- scientific article; zbMATH DE number 1052818 (Why is no real title available?)
- Efficient and robust optimal design for quantile regression based on linear programming
- Optimal weights for experimental designs on linearly independent support points
- Design of c-optimal experiments for high-dimensional linear models
- Computing efficient exact designs of experiments using integer quadratic programming
- Computing exact \(D\)-optimal designs by mixed integer second-order cone programming
- THE SIMPLE LINEAR CALIBRATION PROBLEM AS AN OPTIMAL EXPERIMENTAL DESIGN
- Two complexity results on c-optimality in experimental design
- On computational complexity of construction of \(c\)-optimal linear regression models over finite experimental domains
- A new monotonic algorithm for the \(E\)-optimal experiment design problem
- Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion
- An algorithm based on semidefinite programming for finding minimax optimal designs
- A relaxation procedure for calculating \((\Gamma\)-)minimax optimal designs
- Optimal design of nonlinear experiments with parameter constraints
- Computing the minimal efficiency of designs by a differentiable approximation of \(\Phi _{E_k}\)-optimal\-ity criteria
- Minimum Cost Experimental Design with a Prescribed Information Matrix
- Una caracterizacion de diseños de experimentos optimos por subgradientes
- Computing D-optimal experimental designs for estimating treatment contrasts under the presence of a nuisance time trend
- \(K\)-optimal design via semidefinite programming and entropy optimization
- Combinations of optimality criteria and optimum designs
- A convex approach to optimum design of experiments with correlated observations
- Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming
- Solution of the problem of \(L\)-optimal experiment design with a skeleton algorithm
- Computing \(c\)-optimal experimental designs using the simplex method of linear programming
- Optimal exact designs of experiments via mixed integer nonlinear programming
- Optimal experimental design and quadratic optimization
This page was built for publication: Optimal design of experiments via linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2374424)
