Computing maximin efficient experimental designs using the methods of semidefinite programming
From MaRDI portal
Recommendations
- Computing A-optimal and E-optimal designs for regression models via semidefinite programming
- An algorithm based on semidefinite programming for finding minimax optimal designs
- Computing the minimal efficiency of designs by a differentiable approximation of \(\Phi _{E_k}\)-optimal\-ity criteria
- A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models
- \(K\)-optimal design via semidefinite programming and entropy optimization
Cites work
- scientific article; zbMATH DE number 1086072 (Why is no real title available?)
- scientific article; zbMATH DE number 2042822 (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
- Applications of necessary and sufficient conditions for maximin efficient designs
- Applications of semidefinite programming
- Approximate D-optimal designs of experiments on the convex hull of a finite set of information matrices
- Comparison of design for quadratic regression of cubes
- Computing the minimal efficiency of designs by a differentiable approximation of \(\Phi _{E_k}\)-optimal\-ity criteria
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Maximin designs for exponential growth models and heteroscedastic polynomial models
- Minimal efficiency of designs under the class of orthogonally invariant information criteria
- Monotonic convergence of a general algorithm for computing optimal designs
- On the Sum of the Largest Eigenvalues of a Symmetric Matrix
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
- Robust and Efficient Designs for the Michaelis–Menten Model
- Semidefinite Programming
- \(E\)-optimal designs for polynomial regression
Cited in
(12)- Computing exact \(D\)-optimal designs by mixed integer second-order cone programming
- Computing optimal experimental designs via interior point method
- Adaptive grid semidefinite programming for finding optimal designs
- Criterion-robust experimental designs for the quadratic regression on a square and a cube
- A Graphical Method for Finding Maximin Efficiency Designs
- An algorithm based on semidefinite programming for finding minimax optimal designs
- \(K\)-optimal design via semidefinite programming and entropy optimization
- Maximum projection designs for computer experiments
- A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models
- Optimal exact designs of experiments via mixed integer nonlinear programming
- Computing A-optimal and E-optimal designs for regression models via semidefinite programming
- Optimal design of experiments via linear programming
This page was built for publication: Computing maximin efficient experimental designs using the methods of semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1936672)
